./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.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/openbsd_cstrcmp-alloca-1.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 f68b319d77fa756392ca29e618a1e0accd9b6c9e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:26:09,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:09,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:09,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:09,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:09,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:09,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:09,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:09,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:09,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:09,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:09,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:09,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:09,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:09,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:09,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:09,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:09,284 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:09,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:09,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:09,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:09,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:09,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:09,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:09,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:09,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:09,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:09,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:09,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:09,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:09,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:09,312 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:09,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:09,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:09,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:09,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:09,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:09,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:09,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:09,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:09,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:09,319 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:26:09,338 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:09,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:09,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:09,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:09,340 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:09,340 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:09,340 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:09,340 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:09,340 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:09,341 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:09,341 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:09,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:09,341 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:09,342 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:09,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:09,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:09,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:09,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:09,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:09,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:09,343 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:09,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:09,343 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:09,344 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:09,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:09,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:09,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:09,345 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:09,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:09,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:09,345 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:09,345 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:09,346 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:09,347 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 -> f68b319d77fa756392ca29e618a1e0accd9b6c9e [2020-07-29 03:26:09,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:09,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:09,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:09,665 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:09,665 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:09,666 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2020-07-29 03:26:09,747 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d468976b6/ca1dc93c5512439c85d54bf25de286f5/FLAG31f5d032f [2020-07-29 03:26:10,331 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:10,332 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcmp-alloca-1.i [2020-07-29 03:26:10,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d468976b6/ca1dc93c5512439c85d54bf25de286f5/FLAG31f5d032f [2020-07-29 03:26:10,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d468976b6/ca1dc93c5512439c85d54bf25de286f5 [2020-07-29 03:26:10,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:10,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:10,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:10,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:10,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:10,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:10" (1/1) ... [2020-07-29 03:26:10,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a8c628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:10, skipping insertion in model container [2020-07-29 03:26:10,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:10" (1/1) ... [2020-07-29 03:26:10,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:10,721 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:11,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:11,170 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:11,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:11,341 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:11,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11 WrapperNode [2020-07-29 03:26:11,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:11,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:11,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:11,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:11,354 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:26:11" (1/1) ... [2020-07-29 03:26:11,386 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:26:11" (1/1) ... [2020-07-29 03:26:11,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:11,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:11,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:11,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:11,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (1/1) ... [2020-07-29 03:26:11,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (1/1) ... [2020-07-29 03:26:11,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (1/1) ... [2020-07-29 03:26:11,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (1/1) ... [2020-07-29 03:26:11,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (1/1) ... [2020-07-29 03:26:11,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (1/1) ... [2020-07-29 03:26:11,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (1/1) ... [2020-07-29 03:26:11,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:11,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:11,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:11,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:11,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (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:26:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:26:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:26:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:26:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:12,164 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:12,165 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 03:26:12,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:12 BoogieIcfgContainer [2020-07-29 03:26:12,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:12,171 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:12,171 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:12,175 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:12,177 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:12,177 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:10" (1/3) ... [2020-07-29 03:26:12,178 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b3e5e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:12, skipping insertion in model container [2020-07-29 03:26:12,179 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:12,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:11" (2/3) ... [2020-07-29 03:26:12,181 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b3e5e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:12, skipping insertion in model container [2020-07-29 03:26:12,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:12,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:12" (3/3) ... [2020-07-29 03:26:12,184 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcmp-alloca-1.i [2020-07-29 03:26:12,238 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:12,240 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:12,240 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:12,240 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:12,241 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:12,241 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:12,241 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:12,241 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:12,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 03:26:12,292 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 03:26:12,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:12,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:12,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:26:12,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:12,298 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:12,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 03:26:12,302 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 03:26:12,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:12,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:12,303 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:26:12,304 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:12,310 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 13#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L524true assume !(main_~length1~0 < 1); 12#L524-2true assume !(main_~length2~0 < 1); 3#L527-1true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 16#L533-3true [2020-07-29 03:26:12,310 INFO L796 eck$LassoCheckResult]: Loop: 16#L533-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 15#L533-2true main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 16#L533-3true [2020-07-29 03:26:12,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:12,317 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 03:26:12,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:12,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234215855] [2020-07-29 03:26:12,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,439 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-07-29 03:26:12,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:12,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97666433] [2020-07-29 03:26:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,479 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,491 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-07-29 03:26:12,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:12,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104819339] [2020-07-29 03:26:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:12,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:12,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:12,817 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-29 03:26:12,941 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:12,941 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:12,942 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:12,942 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:12,942 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:12,942 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:12,943 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:12,943 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:12,943 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration1_Lasso [2020-07-29 03:26:12,943 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:12,944 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:13,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:13,016 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:26:13,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:13,028 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:26:13,037 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:26:13,043 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:26:13,050 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:26:13,057 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:26:13,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:13,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:13,083 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:26:13,090 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:26:13,098 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:26:13,284 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-07-29 03:26:13,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:13,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:14,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:14,029 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:26:14,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:14,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:14,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:14,058 INFO L522 LassoAnalysis]: Proving 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:26:14,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:14,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:14,103 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:14,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:14,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:14,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:14,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:14,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:14,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:14,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,191 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,191 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:14,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:14,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:14,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 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:26:14,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:14,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:14,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:14,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:14,286 INFO L522 LassoAnalysis]: Proving 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:26:14,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:14,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:14,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:14,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:14,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:14,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:14,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:14,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:14,454 INFO L522 LassoAnalysis]: Proving 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:26:14,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:14,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:14,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:14,489 INFO L522 LassoAnalysis]: Proving 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:26:14,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:14,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:14,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,552 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:14,557 INFO L522 LassoAnalysis]: Proving 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:26:14,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:14,603 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:14,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:14,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:14,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:14,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:14,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:14,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,725 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:14,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:14,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:14,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:14,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:14,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:14,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:14,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:14,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:14,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:14,830 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:15,062 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-29 03:26:15,062 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:15,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:15,087 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:15,088 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:15,089 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:26:15,150 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:15,155 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15;" "main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14;" [2020-07-29 03:26:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:15,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:15,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:15,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:15,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {29#unseeded} is VALID [2020-07-29 03:26:15,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {29#unseeded} is VALID [2020-07-29 03:26:15,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#unseeded} assume !(main_~length1~0 < 1); {29#unseeded} is VALID [2020-07-29 03:26:15,235 INFO L280 TraceCheckUtils]: 3: Hoare triple {29#unseeded} assume !(main_~length2~0 < 1); {29#unseeded} is VALID [2020-07-29 03:26:15,235 INFO L280 TraceCheckUtils]: 4: Hoare triple {29#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {29#unseeded} is VALID [2020-07-29 03:26:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:15,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:15,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:15,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#(>= 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~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {89#(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:26:15,265 INFO L280 TraceCheckUtils]: 1: Hoare triple {89#(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~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {72#(or (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:15,266 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:26:15,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:15,288 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:26:15,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:15,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,299 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:26:15,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2020-07-29 03:26:15,445 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 45 states and 64 transitions. Complement of second has 7 states. [2020-07-29 03:26:15,445 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:26:15,446 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:15,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 03:26:15,449 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 03:26:15,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:15,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:15,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:15,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:15,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:15,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:15,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2020-07-29 03:26:15,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:26:15,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:15,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:15,463 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states. [2020-07-29 03:26:15,471 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 03:26:15,474 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:15,474 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:15,480 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:15,484 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:15,484 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 64 transitions. cyclomatic complexity: 26 [2020-07-29 03:26:15,486 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:26:15,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:15,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:15,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:15,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:15,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:15,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:15,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:15,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:15,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:15,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:26:15,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:26:15,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 19 letters. [2020-07-29 03:26:15,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:15,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:15,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:15,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:15,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:15,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:15,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:15,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:15,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:15,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:15,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:15,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:15,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:15,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:15,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:15,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:15,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:15,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:15,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:15,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:15,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:15,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:15,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:15,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:15,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:15,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:15,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:15,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:15,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:15,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:15,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:15,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:15,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:15,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:15,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:15,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:15,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:15,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:15,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:15,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,535 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-29 03:26:15,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:15,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:15,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:26:15,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:15,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. cyclomatic complexity: 26 [2020-07-29 03:26:15,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:26:15,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 15 states and 20 transitions. [2020-07-29 03:26:15,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:26:15,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:26:15,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-29 03:26:15,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:15,581 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:26:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-29 03:26:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 03:26:15,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:15,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:15,612 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:15,615 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:26:15,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:15,620 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 03:26:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:26:15,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:15,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:15,621 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 03:26:15,621 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 03:26:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:15,623 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 03:26:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:26:15,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:15,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:15,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:15,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:15,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:26:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 03:26:15,626 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:26:15,626 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:26:15,626 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:15,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:26:15,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 03:26:15,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:15,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:15,628 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:15,628 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:15,628 INFO L794 eck$LassoCheckResult]: Stem: 161#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 158#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 154#L524 assume !(main_~length1~0 < 1); 155#L524-2 assume !(main_~length2~0 < 1); 148#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 149#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 162#L533-4 main_~i~1 := 0; 153#L537-3 [2020-07-29 03:26:15,628 INFO L796 eck$LassoCheckResult]: Loop: 153#L537-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 152#L537-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 153#L537-3 [2020-07-29 03:26:15,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:15,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-07-29 03:26:15,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:15,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584190892] [2020-07-29 03:26:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:15,642 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:15,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:15,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:15,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:15,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-07-29 03:26:15,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:15,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232370483] [2020-07-29 03:26:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:15,664 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:15,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:15,673 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:15,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:15,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-07-29 03:26:15,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:15,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964747043] [2020-07-29 03:26:15,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:15,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:15,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:15,731 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:15,966 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-07-29 03:26:16,063 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:16,063 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:16,063 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:16,063 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:16,064 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:16,064 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:16,064 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:16,064 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:16,064 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration2_Lasso [2020-07-29 03:26:16,064 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:16,064 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:16,092 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:26:16,096 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:26:16,099 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:26:16,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:16,258 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:26:16,262 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:26:16,265 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:26:16,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:16,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:16,281 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:26:16,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:16,289 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:26:16,293 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:26:16,297 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:26:16,898 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:16,898 INFO L489 LassoAnalysis]: Using template 'affine'. 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:26:16,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:16,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:16,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:16,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:16,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:16,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:16,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:16,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:16,910 INFO L522 LassoAnalysis]: Proving 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:26:16,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:16,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:16,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:16,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:16,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:16,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:16,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:16,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:16,957 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:26:17,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:17,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:17,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:17,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:17,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:17,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:17,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:17,016 INFO L522 LassoAnalysis]: Proving 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:26:17,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:17,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:17,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:17,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:17,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:17,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:17,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:17,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:17,149 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2020-07-29 03:26:17,149 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:17,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:17,161 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:26:17,161 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:17,161 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2) = -1*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 Supporting invariants [1*ULTIMATE.start_main_~nondetString2~0.offset >= 0] [2020-07-29 03:26:17,221 INFO L297 tatePredicateManager]: 5 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 03:26:17,234 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17;" "main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16;" [2020-07-29 03:26:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:26:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:17,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {202#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {202#unseeded} is VALID [2020-07-29 03:26:17,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {202#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {202#unseeded} is VALID [2020-07-29 03:26:17,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {202#unseeded} assume !(main_~length1~0 < 1); {202#unseeded} is VALID [2020-07-29 03:26:17,348 INFO L280 TraceCheckUtils]: 3: Hoare triple {202#unseeded} assume !(main_~length2~0 < 1); {202#unseeded} is VALID [2020-07-29 03:26:17,349 INFO L280 TraceCheckUtils]: 4: Hoare triple {202#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {252#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:17,349 INFO L280 TraceCheckUtils]: 5: Hoare triple {252#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !(main_~i~0 < main_~length1~0 - 1); {252#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:17,350 INFO L280 TraceCheckUtils]: 6: Hoare triple {252#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_~i~1 := 0; {252#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) unseeded (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,357 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:26:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:17,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:17,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {253#(and (>= ULTIMATE.start_main_~nondetString2~0.offset 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|))) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {279#(and (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_main_~i~1)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:17,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#(and (<= 0 ULTIMATE.start_main_~nondetString2~0.offset) (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc13.base|) (+ oldRank0 ULTIMATE.start_main_~i~1)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {255#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) (select |#length| |ULTIMATE.start_main_#t~malloc13.base|))) (>= oldRank0 0)) unseeded) (>= ULTIMATE.start_main_~nondetString2~0.offset 0) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc13.base|))} is VALID [2020-07-29 03:26:17,401 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:26:17,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:17,417 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:26:17,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:17,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,418 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:26:17,418 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 03:26:17,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 21 states and 30 transitions. Complement of second has 7 states. [2020-07-29 03:26:17,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:17,620 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:17,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:17,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:17,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:17,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:17,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:17,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:17,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:17,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-07-29 03:26:17,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:17,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:17,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:17,629 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:17,637 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 03:26:17,639 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:17,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:17,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:17,643 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:17,644 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:17,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:17,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:17,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:17,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:17,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:17,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:17,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:17,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:17,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:17,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:17,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:17,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:26:17,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:17,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:17,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:17,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:17,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:17,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:17,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:17,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:17,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:17,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:17,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:17,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:17,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:17,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:17,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:17,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:17,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:17,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:17,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 03:26:17,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:17,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:17,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:17,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:17,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:17,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:17,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,664 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:17,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:17,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2020-07-29 03:26:17,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:17,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:17,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:17,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:17,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 03:26:17,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:17,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 16 states and 22 transitions. [2020-07-29 03:26:17,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:26:17,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:17,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 03:26:17,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:17,671 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 03:26:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 03:26:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 03:26:17,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:17,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:17,673 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:17,673 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:17,675 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 03:26:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 03:26:17,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:17,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:17,676 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 03:26:17,676 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 03:26:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:17,677 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 03:26:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 03:26:17,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:17,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:17,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:17,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 03:26:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 03:26:17,679 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 03:26:17,680 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 03:26:17,680 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:17,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 03:26:17,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:17,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:17,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:17,681 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:17,681 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:17,682 INFO L794 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 327#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 322#L524 assume !(main_~length1~0 < 1); 323#L524-2 assume !(main_~length2~0 < 1); 316#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 317#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 331#L533-4 main_~i~1 := 0; 325#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 326#L537-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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; 324#L516-3 [2020-07-29 03:26:17,682 INFO L796 eck$LassoCheckResult]: Loop: 324#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 318#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 319#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~mem6;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset; 324#L516-3 [2020-07-29 03:26:17,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-07-29 03:26:17,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:17,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864829027] [2020-07-29 03:26:17,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,723 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 1 times [2020-07-29 03:26:17,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:17,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299020103] [2020-07-29 03:26:17,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:17,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:17,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -296047681, now seen corresponding path program 1 times [2020-07-29 03:26:17,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:17,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933388193] [2020-07-29 03:26:17,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:18,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {371#true} is VALID [2020-07-29 03:26:18,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {371#true} is VALID [2020-07-29 03:26:18,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume !(main_~length1~0 < 1); {373#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:18,016 INFO L280 TraceCheckUtils]: 3: Hoare triple {373#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {373#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:18,018 INFO L280 TraceCheckUtils]: 4: Hoare triple {373#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {374#(and (or (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (not (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (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))} is VALID [2020-07-29 03:26:18,020 INFO L280 TraceCheckUtils]: 5: Hoare triple {374#(and (or (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (not (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (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))} assume !(main_~i~0 < main_~length1~0 - 1); {375#(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:26:18,021 INFO L280 TraceCheckUtils]: 6: Hoare triple {375#(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; {375#(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:26:18,022 INFO L280 TraceCheckUtils]: 7: Hoare triple {375#(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); {375#(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:26:18,024 INFO L280 TraceCheckUtils]: 8: Hoare triple {375#(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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; {376#(and (= ULTIMATE.start_cstrcmp_~s1.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) 0)))} is VALID [2020-07-29 03:26:18,025 INFO L280 TraceCheckUtils]: 9: Hoare triple {376#(and (= ULTIMATE.start_cstrcmp_~s1.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) 0)))} call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); {376#(and (= ULTIMATE.start_cstrcmp_~s1.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) 0)))} is VALID [2020-07-29 03:26:18,027 INFO L280 TraceCheckUtils]: 10: Hoare triple {376#(and (= ULTIMATE.start_cstrcmp_~s1.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) 0)))} assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); {377#(= 0 |ULTIMATE.start_cstrcmp_#t~mem6|)} is VALID [2020-07-29 03:26:18,027 INFO L280 TraceCheckUtils]: 11: Hoare triple {377#(= 0 |ULTIMATE.start_cstrcmp_#t~mem6|)} assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~mem6;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset; {372#false} is VALID [2020-07-29 03:26:18,029 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:26:18,029 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933388193] [2020-07-29 03:26:18,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:18,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 03:26:18,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406841769] [2020-07-29 03:26:18,142 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-07-29 03:26:18,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:18,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:26:18,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:26:18,191 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-29 03:26:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:18,438 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-07-29 03:26:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:26:18,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:26:18,457 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:26:18,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2020-07-29 03:26:18,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:18,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 22 transitions. [2020-07-29 03:26:18,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:26:18,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:18,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2020-07-29 03:26:18,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:18,463 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2020-07-29 03:26:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2020-07-29 03:26:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 03:26:18,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:18,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:18,469 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:18,469 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:18,470 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 03:26:18,471 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:26:18,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:18,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:18,471 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 22 transitions. [2020-07-29 03:26:18,471 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 22 transitions. [2020-07-29 03:26:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:18,474 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 03:26:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:26:18,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:18,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:18,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:18,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 03:26:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-07-29 03:26:18,478 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 03:26:18,478 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 03:26:18,479 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:18,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-07-29 03:26:18,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:18,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:18,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:18,480 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:18,480 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:18,480 INFO L794 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 418#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 413#L524 assume !(main_~length1~0 < 1); 414#L524-2 assume !(main_~length2~0 < 1); 407#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 408#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 419#L533-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 420#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 422#L533-4 main_~i~1 := 0; 416#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 417#L537-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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; 415#L516-3 [2020-07-29 03:26:18,481 INFO L796 eck$LassoCheckResult]: Loop: 415#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 409#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 410#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~mem6;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset; 415#L516-3 [2020-07-29 03:26:18,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626632, now seen corresponding path program 1 times [2020-07-29 03:26:18,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:18,483 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719255385] [2020-07-29 03:26:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,564 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:18,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 2 times [2020-07-29 03:26:18,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:18,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533453621] [2020-07-29 03:26:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:18,591 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:18,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:18,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1311502365, now seen corresponding path program 1 times [2020-07-29 03:26:18,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:18,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890048983] [2020-07-29 03:26:18,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:18,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {464#true} is VALID [2020-07-29 03:26:18,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {464#true} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {464#true} is VALID [2020-07-29 03:26:18,939 INFO L280 TraceCheckUtils]: 2: Hoare triple {464#true} assume !(main_~length1~0 < 1); {464#true} is VALID [2020-07-29 03:26:18,940 INFO L280 TraceCheckUtils]: 3: Hoare triple {464#true} assume !(main_~length2~0 < 1); {466#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:18,941 INFO L280 TraceCheckUtils]: 4: Hoare triple {466#(<= 1 ULTIMATE.start_main_~length2~0)} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {467#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (< 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:26:18,943 INFO L280 TraceCheckUtils]: 5: Hoare triple {467#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (< 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~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {467#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (< 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:26:18,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {467#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {467#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (< 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:26:18,944 INFO L280 TraceCheckUtils]: 7: Hoare triple {467#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (< 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); {467#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (< 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:26:18,945 INFO L280 TraceCheckUtils]: 8: Hoare triple {467#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {468#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (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:26:18,946 INFO L280 TraceCheckUtils]: 9: Hoare triple {468#(and (or (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (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); {469#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 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:26:18,947 INFO L280 TraceCheckUtils]: 10: Hoare triple {469#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; {470#(and (= ULTIMATE.start_cstrcmp_~s1.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) ULTIMATE.start_cstrcmp_~s2.offset)))} is VALID [2020-07-29 03:26:18,949 INFO L280 TraceCheckUtils]: 11: Hoare triple {470#(and (= ULTIMATE.start_cstrcmp_~s1.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) ULTIMATE.start_cstrcmp_~s2.offset)))} call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); {471#(and (= ULTIMATE.start_cstrcmp_~s1.offset 0) (= |ULTIMATE.start_cstrcmp_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) ULTIMATE.start_cstrcmp_~s1.offset)) (= 0 |ULTIMATE.start_cstrcmp_#t~mem4|))} is VALID [2020-07-29 03:26:18,950 INFO L280 TraceCheckUtils]: 12: Hoare triple {471#(and (= ULTIMATE.start_cstrcmp_~s1.offset 0) (= |ULTIMATE.start_cstrcmp_#t~mem3| (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base) ULTIMATE.start_cstrcmp_~s1.offset)) (= 0 |ULTIMATE.start_cstrcmp_#t~mem4|))} assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); {472#(= 0 |ULTIMATE.start_cstrcmp_#t~mem6|)} is VALID [2020-07-29 03:26:18,950 INFO L280 TraceCheckUtils]: 13: Hoare triple {472#(= 0 |ULTIMATE.start_cstrcmp_#t~mem6|)} assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~mem6;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset; {465#false} is VALID [2020-07-29 03:26:18,951 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:26:18,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890048983] [2020-07-29 03:26:18,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:18,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-29 03:26:18,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964887664] [2020-07-29 03:26:19,062 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2020-07-29 03:26:19,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:26:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:26:19,120 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-07-29 03:26:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:19,463 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-29 03:26:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:26:19,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:26:19,490 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:26:19,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2020-07-29 03:26:19,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:19,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 17 states and 21 transitions. [2020-07-29 03:26:19,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:26:19,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:26:19,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2020-07-29 03:26:19,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:19,494 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2020-07-29 03:26:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2020-07-29 03:26:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 03:26:19,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:19,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 21 transitions. Second operand 16 states. [2020-07-29 03:26:19,496 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 21 transitions. Second operand 16 states. [2020-07-29 03:26:19,497 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 16 states. [2020-07-29 03:26:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:19,498 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-07-29 03:26:19,498 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-29 03:26:19,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:19,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:19,499 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 21 transitions. [2020-07-29 03:26:19,499 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 21 transitions. [2020-07-29 03:26:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:19,500 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2020-07-29 03:26:19,500 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2020-07-29 03:26:19,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:19,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:19,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:19,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 03:26:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 03:26:19,502 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 03:26:19,502 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 03:26:19,503 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:19,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-07-29 03:26:19,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:19,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:19,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:19,504 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:19,504 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:19,505 INFO L794 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 511#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; 506#L524 assume !(main_~length1~0 < 1); 507#L524-2 assume !(main_~length2~0 < 1); 500#L527-1 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; 501#L533-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; 513#L533-2 main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; 514#L533-3 assume !(main_~i~0 < main_~length1~0 - 1); 515#L533-4 main_~i~1 := 0; 509#L537-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; 504#L537-2 main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; 505#L537-3 assume !(main_~i~1 < main_~length2~0 - 1); 510#L537-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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; 508#L516-3 [2020-07-29 03:26:19,505 INFO L796 eck$LassoCheckResult]: Loop: 508#L516-3 call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); 502#L516-1 assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); 503#L517 assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~mem6;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset; 508#L516-3 [2020-07-29 03:26:19,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1066016806, now seen corresponding path program 1 times [2020-07-29 03:26:19,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:19,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111987879] [2020-07-29 03:26:19,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:19,519 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:19,530 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:19,535 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 77620, now seen corresponding path program 3 times [2020-07-29 03:26:19,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:19,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793069706] [2020-07-29 03:26:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:19,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:19,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:19,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:19,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:19,549 INFO L82 PathProgramCache]: Analyzing trace with hash -718433093, now seen corresponding path program 1 times [2020-07-29 03:26:19,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:19,550 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020362056] [2020-07-29 03:26:19,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:19,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:19,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:19,590 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:20,431 WARN L193 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 114 [2020-07-29 03:26:20,753 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-07-29 03:26:20,757 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:20,757 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:20,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:20,757 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:20,757 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:20,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:20,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:20,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:20,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcmp-alloca-1.i_Iteration5_Lasso [2020-07-29 03:26:20,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:20,758 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:20,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:20,804 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:26:20,810 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:26:20,813 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:26:20,818 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:26:20,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:20,827 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:26:20,833 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:26:20,838 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:26:20,841 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:26:20,845 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:26:20,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:26:20,856 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:26:20,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:26:20,865 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:26:20,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:26:20,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:26:20,879 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:26:20,883 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:26:20,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:26:20,893 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:26:20,897 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:26:21,565 WARN L193 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 87 [2020-07-29 03:26:21,809 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2020-07-29 03:26:21,811 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:21,812 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:21,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:21,832 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:26:21,834 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:26:21,838 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:26:22,576 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2020-07-29 03:26:23,067 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-07-29 03:26:23,305 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:23,305 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:23,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,367 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,368 INFO L522 LassoAnalysis]: Proving 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:26:23,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:23,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:23,398 INFO L522 LassoAnalysis]: Proving 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:26:23,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:23,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:23,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,462 INFO L522 LassoAnalysis]: Proving 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:26:23,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,488 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,488 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,489 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:23,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,548 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:26:23,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,581 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:26:23,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,668 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:26:23,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:23,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:23,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:23,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:23,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,782 INFO L522 LassoAnalysis]: Proving 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) [2020-07-29 03:26:23,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:23,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:23,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:23,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,859 INFO L522 LassoAnalysis]: Proving 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:26:23,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:23,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:23,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:23,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:23,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:23,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:23,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:23,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:23,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:23,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:23,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:23,974 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:26:23,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:23,981 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2020-07-29 03:26:23,982 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2020-07-29 03:26:24,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:24,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:24,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:24,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:24,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:24,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:24,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:24,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:24,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:24,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:26:24,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:24,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:24,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:24,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:24,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:24,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:24,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:24,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:24,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:24,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:24,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:24,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:24,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:24,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:24,173 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:24,293 INFO L443 ModelExtractionUtils]: Simplification made 41 calls to the SMT solver. [2020-07-29 03:26:24,293 INFO L444 ModelExtractionUtils]: 10 out of 58 variables were initially zero. Simplification set additionally 45 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:24,296 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:24,298 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:24,299 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:24,299 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3) = -1*ULTIMATE.start_cstrcmp_~s1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc12.base)_3 Supporting invariants [] [2020-07-29 03:26:24,466 INFO L297 tatePredicateManager]: 25 out of 26 supporting invariants were superfluous and have been removed [2020-07-29 03:26:24,473 INFO L393 LassoCheck]: Loop: "call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1);" "assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1);" "assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~mem6;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset;" [2020-07-29 03:26:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:24,481 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:24,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:26:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:24,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:24,575 INFO L280 TraceCheckUtils]: 0: Hoare triple {559#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {559#unseeded} is VALID [2020-07-29 03:26:24,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {559#unseeded} havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~nondet15, main_#t~post14, main_~i~0, main_#t~nondet17, main_#t~post16, main_~i~1, main_#t~ret18, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet10;havoc main_#t~nondet10;main_~length2~0 := main_#t~nondet11;havoc main_#t~nondet11; {559#unseeded} is VALID [2020-07-29 03:26:24,577 INFO L280 TraceCheckUtils]: 2: Hoare triple {559#unseeded} assume !(main_~length1~0 < 1); {559#unseeded} is VALID [2020-07-29 03:26:24,578 INFO L280 TraceCheckUtils]: 3: Hoare triple {559#unseeded} assume !(main_~length2~0 < 1); {559#unseeded} is VALID [2020-07-29 03:26:24,579 INFO L280 TraceCheckUtils]: 4: Hoare triple {559#unseeded} call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;main_~i~0 := 0; {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,579 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet15, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet15; {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,583 INFO L280 TraceCheckUtils]: 6: Hoare triple {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} main_#t~post14 := main_~i~0;main_~i~0 := 1 + main_#t~post14;havoc main_#t~post14; {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,585 INFO L280 TraceCheckUtils]: 7: Hoare triple {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,588 INFO L280 TraceCheckUtils]: 8: Hoare triple {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} main_~i~1 := 0; {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,589 INFO L280 TraceCheckUtils]: 9: Hoare triple {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet17, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet17; {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} main_#t~post16 := main_~i~1;main_~i~1 := 1 + main_#t~post16;havoc main_#t~post16; {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,596 INFO L280 TraceCheckUtils]: 11: Hoare triple {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,598 INFO L280 TraceCheckUtils]: 12: Hoare triple {724#(and (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} 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~post5.base, cstrcmp_#t~post5.offset, cstrcmp_#t~mem6, cstrcmp_#t~mem3, cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, cstrcmp_#t~mem4, cstrcmp_#t~mem8, cstrcmp_#t~pre7.base, cstrcmp_#t~pre7.offset, cstrcmp_#t~mem9, cstrcmp_~s1.base, cstrcmp_~s1.offset, cstrcmp_~s2.base, cstrcmp_~s2.offset;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; {703#(and (= ULTIMATE.start_cstrcmp_~s1.base |ULTIMATE.start_main_#t~malloc12.base|) unseeded)} is VALID [2020-07-29 03:26:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:24,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:26:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:24,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:24,774 INFO L280 TraceCheckUtils]: 0: Hoare triple {704#(and (= ULTIMATE.start_cstrcmp_~s1.base |ULTIMATE.start_main_#t~malloc12.base|) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcmp_~s1.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|))))} call cstrcmp_#t~mem3 := read~int(cstrcmp_~s1.base, cstrcmp_~s1.offset, 1);cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset := cstrcmp_~s2.base, cstrcmp_~s2.offset;cstrcmp_~s2.base, cstrcmp_~s2.offset := cstrcmp_#t~post2.base, 1 + cstrcmp_#t~post2.offset;call cstrcmp_#t~mem4 := read~int(cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset, 1); {749#(and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ ULTIMATE.start_cstrcmp_~s1.offset oldRank0)) (= ULTIMATE.start_cstrcmp_~s1.base |ULTIMATE.start_main_#t~malloc12.base|))} is VALID [2020-07-29 03:26:24,776 INFO L280 TraceCheckUtils]: 1: Hoare triple {749#(and (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) (+ ULTIMATE.start_cstrcmp_~s1.offset oldRank0)) (= ULTIMATE.start_cstrcmp_~s1.base |ULTIMATE.start_main_#t~malloc12.base|))} assume !!(cstrcmp_#t~mem3 == cstrcmp_#t~mem4);havoc cstrcmp_#t~post2.base, cstrcmp_#t~post2.offset;havoc cstrcmp_#t~mem4;havoc cstrcmp_#t~mem3;cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset := cstrcmp_~s1.base, cstrcmp_~s1.offset;cstrcmp_~s1.base, cstrcmp_~s1.offset := cstrcmp_#t~post5.base, 1 + cstrcmp_#t~post5.offset;call cstrcmp_#t~mem6 := read~int(cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset, 1); {753#(and (= ULTIMATE.start_cstrcmp_~s1.base |ULTIMATE.start_main_#t~malloc12.base|) (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) 1) (+ ULTIMATE.start_cstrcmp_~s1.offset oldRank0)))} is VALID [2020-07-29 03:26:24,777 INFO L280 TraceCheckUtils]: 2: Hoare triple {753#(and (= ULTIMATE.start_cstrcmp_~s1.base |ULTIMATE.start_main_#t~malloc12.base|) (<= 1 oldRank0) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc12.base|) 1) (+ ULTIMATE.start_cstrcmp_~s1.offset oldRank0)))} assume !(0 == cstrcmp_#t~mem6);havoc cstrcmp_#t~mem6;havoc cstrcmp_#t~post5.base, cstrcmp_#t~post5.offset; {706#(and (= ULTIMATE.start_cstrcmp_~s1.base |ULTIMATE.start_main_#t~malloc12.base|) (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrcmp_~s1.offset) (select |#length| |ULTIMATE.start_main_#t~malloc12.base|))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 03:26:24,777 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:26:24,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:24,800 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:26:24,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:24,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,801 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 03:26:24,801 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-07-29 03:26:24,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 7. Second operand 5 states. Result 20 states and 24 transitions. Complement of second has 7 states. [2020-07-29 03:26:24,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:24,874 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:24,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:24,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:24,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:24,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:26:24,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:24,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:24,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:24,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2020-07-29 03:26:24,877 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:24,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:24,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 20 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:24,879 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:24,879 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:26:24,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:26:24,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:24,881 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:24,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:24,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:24,881 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:26:24,881 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:26:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:24,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:24,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:24,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,884 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:26:24,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:24,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:24,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,885 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:26:24,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:24,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:24,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:24,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:24,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:24,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,887 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:26:24,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:24,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:24,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,889 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:26:24,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:24,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:24,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,890 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:26:24,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:24,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:24,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 20 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:24,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:24,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:24,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,892 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:24,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:26:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 03:26:24,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:24,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:24,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:26:24,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:24,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. cyclomatic complexity: 7 [2020-07-29 03:26:24,896 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:24,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2020-07-29 03:26:24,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:26:24,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:26:24,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:26:24,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:24,897 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:24,897 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:24,897 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:24,897 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:26:24,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:26:24,898 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:24,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:24,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:26:24 BoogieIcfgContainer [2020-07-29 03:26:24,905 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:26:24,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:26:24,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:26:24,906 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:26:24,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:12" (3/4) ... [2020-07-29 03:26:24,910 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:26:24,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:26:24,913 INFO L168 Benchmark]: Toolchain (without parser) took 14275.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.4 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -202.5 MB). Peak memory consumption was 182.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:24,913 INFO L168 Benchmark]: CDTParser took 0.28 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:26:24,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:24,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:24,915 INFO L168 Benchmark]: Boogie Preprocessor took 67.27 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:26:24,916 INFO L168 Benchmark]: RCFGBuilder took 668.25 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: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:24,917 INFO L168 Benchmark]: BuchiAutomizer took 12734.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.0 MB). Peak memory consumption was 164.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:24,917 INFO L168 Benchmark]: Witness Printer took 5.23 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:26:24,920 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.28 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 703.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.27 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 668.25 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: 33.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12734.27 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.0 MB). Peak memory consumption was 164.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.23 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s1 + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 10.5s. Construction of modules took 0.3s. 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: 66 SDtfs, 117 SDslu, 106 SDs, 0 SdLazy, 109 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital199 mio100 ax110 hnf98 lsp84 ukn74 mio100 lsp51 div100 bol100 ite100 ukn100 eq175 hnf89 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms 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...