./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-recursive-malloc/rec_malloc_ex11B.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 18b42b65120149c30866fbc5b5479df029781f63 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:40:14,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:40:14,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:40:14,105 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:40:14,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:40:14,107 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:40:14,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:40:14,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:40:14,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:40:14,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:40:14,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:40:14,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:40:14,117 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:40:14,118 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:40:14,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:40:14,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:40:14,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:40:14,124 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:40:14,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:40:14,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:40:14,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:40:14,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:40:14,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:40:14,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:40:14,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:40:14,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:40:14,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:40:14,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:40:14,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:40:14,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:40:14,140 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:40:14,141 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:40:14,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:40:14,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:40:14,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:40:14,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:40:14,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:40:14,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:40:14,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:40:14,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:40:14,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:40:14,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:40:14,166 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:40:14,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:40:14,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:40:14,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:40:14,169 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:40:14,169 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:40:14,169 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:40:14,170 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:40:14,170 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:40:14,170 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:40:14,170 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:40:14,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:40:14,171 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:40:14,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:40:14,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:40:14,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:40:14,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:40:14,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:40:14,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:40:14,173 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:40:14,173 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:40:14,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:40:14,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:40:14,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:40:14,174 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:40:14,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:40:14,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:40:14,175 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:40:14,176 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:40:14,177 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:40:14,177 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 18b42b65120149c30866fbc5b5479df029781f63 [2020-07-29 01:40:14,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:40:14,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:40:14,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:40:14,548 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:40:14,549 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:40:14,550 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i [2020-07-29 01:40:14,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2c95194/cb5a189f550944d1a1f373b695b87bc6/FLAG86eb6f8fe [2020-07-29 01:40:15,073 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:40:15,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B.i [2020-07-29 01:40:15,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2c95194/cb5a189f550944d1a1f373b695b87bc6/FLAG86eb6f8fe [2020-07-29 01:40:15,457 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2c95194/cb5a189f550944d1a1f373b695b87bc6 [2020-07-29 01:40:15,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:40:15,463 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:40:15,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:40:15,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:40:15,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:40:15,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b27cb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15, skipping insertion in model container [2020-07-29 01:40:15,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,482 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:40:15,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:40:15,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:40:15,686 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:40:15,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:40:15,717 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:40:15,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15 WrapperNode [2020-07-29 01:40:15,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:40:15,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:40:15,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:40:15,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:40:15,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:40:15,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:40:15,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:40:15,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:40:15,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,823 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... [2020-07-29 01:40:15,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:40:15,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:40:15,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:40:15,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:40:15,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:15,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:40:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2020-07-29 01:40:15,904 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2020-07-29 01:40:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:40:15,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:40:15,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:40:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:40:15,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:40:16,296 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:40:16,296 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:40:16,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:40:16 BoogieIcfgContainer [2020-07-29 01:40:16,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:40:16,301 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:40:16,301 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:40:16,304 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:40:16,305 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:16,306 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:40:15" (1/3) ... [2020-07-29 01:40:16,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62bf5655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:40:16, skipping insertion in model container [2020-07-29 01:40:16,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:16,307 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:40:15" (2/3) ... [2020-07-29 01:40:16,307 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62bf5655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:40:16, skipping insertion in model container [2020-07-29 01:40:16,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:40:16,308 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:40:16" (3/3) ... [2020-07-29 01:40:16,310 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B.i [2020-07-29 01:40:16,364 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:40:16,364 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:40:16,365 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:40:16,365 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:40:16,365 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:40:16,365 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:40:16,365 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:40:16,365 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:40:16,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:40:16,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:40:16,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:16,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:16,424 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:40:16,424 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:16,424 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:40:16,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:40:16,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:40:16,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:16,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:16,430 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:40:16,430 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:16,438 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 19#L28-3true [2020-07-29 01:40:16,439 INFO L796 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 12#L33true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 7#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 15#recFINALtrue assume true; 13#recEXITtrue >#39#return; 10#L33-1true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 5#L33-3true call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 19#L28-3true [2020-07-29 01:40:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2020-07-29 01:40:16,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:16,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51431085] [2020-07-29 01:40:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:16,543 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:16,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:16,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:16,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:16,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1673639481, now seen corresponding path program 1 times [2020-07-29 01:40:16,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:16,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576844436] [2020-07-29 01:40:16,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:16,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:16,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:16,672 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:16,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash -508919995, now seen corresponding path program 1 times [2020-07-29 01:40:16,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:16,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305712736] [2020-07-29 01:40:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:16,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:16,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:16,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:17,523 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 91 [2020-07-29 01:40:17,899 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:17,900 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:17,900 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:17,901 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:17,901 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:17,901 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:17,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:17,902 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:17,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B.i_Iteration1_Lasso [2020-07-29 01:40:17,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:17,903 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:17,952 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 01:40:17,963 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 01:40:17,968 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 01:40:17,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:17,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:17,985 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 01:40:18,349 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2020-07-29 01:40:18,354 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:40:18,355 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:40:18,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:18,363 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 01:40:18,368 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 01:40:19,045 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:19,050 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:19,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:19,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:19,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:19,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:19,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:19,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:19,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:19,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:19,072 INFO L522 LassoAnalysis]: Proving 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 01:40:19,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:19,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:19,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:19,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:19,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:19,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:19,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:19,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:19,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:19,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:19,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:19,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:19,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:19,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:19,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:19,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:19,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:19,168 INFO L522 LassoAnalysis]: Proving 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 01:40:19,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:19,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:19,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:19,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:19,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:19,198 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:19,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:19,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:19,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:19,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:19,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:19,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:19,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:19,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:19,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:19,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:19,240 INFO L522 LassoAnalysis]: Proving 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 01:40:19,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:19,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:19,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:19,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:19,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:19,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:19,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:19,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 01:40:19,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:19,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:19,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:19,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:19,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:19,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:19,320 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:19,326 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:19,355 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:40:19,356 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:19,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:19,372 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:19,372 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:19,373 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2020-07-29 01:40:19,514 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:40:19,520 INFO L393 LassoCheck]: Loop: "call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);" "assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4);" "call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0;" "assume true;" >"#39#return;" "assume main_#t~ret11 <= -1;main_#t~ite12 := -1;" "call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13;" [2020-07-29 01:40:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:19,550 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:40:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:19,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:40:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:19,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:19,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#unseeded} is VALID [2020-07-29 01:40:19,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#unseeded} havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; {27#unseeded} is VALID [2020-07-29 01:40:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:19,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:40:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:19,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:19,832 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:19,833 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-07-29 01:40:19,855 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:40:19,866 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:40:19,882 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:19,893 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:19,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:40:19,911 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-29 01:40:19,930 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:19,938 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:19,945 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:19,945 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:7 [2020-07-29 01:40:19,950 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:19,950 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_54|, |ULTIMATE.start_main_#t~malloc9.base|, ULTIMATE.start_main_~pp~0.offset, |v_ULTIMATE.start_main_#t~nondet10_8|, |v_#valid_82|]. (let ((.cse0 (select (select |v_#memory_int_54| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset))) (and (<= 1 (select |v_#valid_82| ULTIMATE.start_main_~qq~0.base)) (<= (select |v_#valid_82| |ULTIMATE.start_main_#t~malloc9.base|) 0) (<= |ULTIMATE.start_main_#t~mem13| (select (select (store |v_#memory_int_54| |ULTIMATE.start_main_#t~malloc9.base| (store (select |v_#memory_int_54| |ULTIMATE.start_main_#t~malloc9.base|) ULTIMATE.start_main_~pp~0.offset |v_ULTIMATE.start_main_#t~nondet10_8|)) ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)) (<= .cse0 oldRank0) (<= 2 .cse0))) [2020-07-29 01:40:19,951 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= |ULTIMATE.start_main_#t~mem13| oldRank0) (<= 2 oldRank0)) [2020-07-29 01:40:20,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset))} call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {63#(and (<= 1 (select |#valid| ULTIMATE.start_main_~qq~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset) oldRank0) (<= |ULTIMATE.start_main_#t~mem8| (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)))} is VALID [2020-07-29 01:40:20,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {63#(and (<= 1 (select |#valid| ULTIMATE.start_main_~qq~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset) oldRank0) (<= |ULTIMATE.start_main_#t~mem8| (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)))} assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {67#(and (<= |ULTIMATE.start_main_#t~mem13| oldRank0) (<= 2 oldRank0))} is VALID [2020-07-29 01:40:20,135 INFO L263 TraceCheckUtils]: 2: Hoare triple {67#(and (<= |ULTIMATE.start_main_#t~mem13| oldRank0) (<= 2 oldRank0))} call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset); {71#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:40:20,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {71#(<= |old(oldRank0)| oldRank0)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {71#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:40:20,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {71#(<= |old(oldRank0)| oldRank0)} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {71#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:40:20,138 INFO L280 TraceCheckUtils]: 5: Hoare triple {71#(<= |old(oldRank0)| oldRank0)} assume true; {71#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:40:20,141 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {71#(<= |old(oldRank0)| oldRank0)} {67#(and (<= |ULTIMATE.start_main_#t~mem13| oldRank0) (<= 2 oldRank0))} #39#return; {67#(and (<= |ULTIMATE.start_main_#t~mem13| oldRank0) (<= 2 oldRank0))} is VALID [2020-07-29 01:40:20,142 INFO L280 TraceCheckUtils]: 7: Hoare triple {67#(and (<= |ULTIMATE.start_main_#t~mem13| oldRank0) (<= 2 oldRank0))} assume main_#t~ret11 <= -1;main_#t~ite12 := -1; {87#(and (<= |ULTIMATE.start_main_#t~mem13| oldRank0) (<= (+ |ULTIMATE.start_main_#t~ite12| 1) 0) (<= 2 oldRank0))} is VALID [2020-07-29 01:40:20,144 INFO L280 TraceCheckUtils]: 8: Hoare triple {87#(and (<= |ULTIMATE.start_main_#t~mem13| oldRank0) (<= (+ |ULTIMATE.start_main_#t~ite12| 1) 0) (<= 2 oldRank0))} call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; {55#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:40:20,145 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 01:40:20,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:40:20,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:20,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 9 letters. [2020-07-29 01:40:20,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,204 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:40:20,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 6 states. [2020-07-29 01:40:20,556 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 6 states. Result 65 states and 78 transitions. Complement of second has 18 states. [2020-07-29 01:40:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:20,557 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:20,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:40:20,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:40:20,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:20,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:20,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:40:20,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:20,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:20,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:20,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 78 transitions. [2020-07-29 01:40:20,586 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 01:40:20,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:20,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:20,592 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states. [2020-07-29 01:40:20,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:40:20,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 01:40:20,608 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:40:20,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:40:20,612 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:40:20,612 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 65 states and 78 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:20,624 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:40:20,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 2 letters. Loop has 9 letters. [2020-07-29 01:40:20,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 9 letters. [2020-07-29 01:40:20,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 9 letters. [2020-07-29 01:40:20,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:20,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:20,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:20,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:20,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:20,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:20,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 65 letters. Loop has 65 letters. [2020-07-29 01:40:20,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 65 letters. Loop has 65 letters. [2020-07-29 01:40:20,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 65 letters. Loop has 65 letters. [2020-07-29 01:40:20,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:40:20,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:40:20,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:40:20,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:40:20,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:40:20,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:40:20,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:40:20,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:40:20,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:40:20,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:20,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:20,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:20,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 2 letters. Loop has 9 letters. [2020-07-29 01:40:20,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 9 letters. [2020-07-29 01:40:20,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 9 letters. [2020-07-29 01:40:20,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:40:20,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:40:20,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 9 letters. [2020-07-29 01:40:20,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:20,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:20,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:20,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:40:20,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:40:20,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 9 letters. [2020-07-29 01:40:20,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:40:20,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:40:20,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:40:20,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:40:20,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:20,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:20,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:40:20,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:20,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:20,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:20,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:20,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:20,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:20,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:20,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:20,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:20,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:40:20,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:40:20,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:40:20,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:20,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:20,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:20,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:20,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:20,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:20,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:20,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:20,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:20,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 19 letters. Loop has 9 letters. [2020-07-29 01:40:20,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 19 letters. Loop has 9 letters. [2020-07-29 01:40:20,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 9 letters. [2020-07-29 01:40:20,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:20,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:20,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:20,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:20,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:20,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:20,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:20,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:20,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:20,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:20,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 78 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:20,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,697 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:40:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2020-07-29 01:40:20,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 9 letters. [2020-07-29 01:40:20,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:20,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 18 letters. [2020-07-29 01:40:20,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:20,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 78 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:20,716 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 01:40:20,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 58 transitions. [2020-07-29 01:40:20,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-29 01:40:20,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-29 01:40:20,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2020-07-29 01:40:20,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:20,739 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2020-07-29 01:40:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2020-07-29 01:40:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-07-29 01:40:20,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:20,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states and 58 transitions. Second operand 46 states. [2020-07-29 01:40:20,780 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states and 58 transitions. Second operand 46 states. [2020-07-29 01:40:20,782 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 46 states. [2020-07-29 01:40:20,786 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:20,800 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2020-07-29 01:40:20,801 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-29 01:40:20,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:20,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:20,803 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 47 states and 58 transitions. [2020-07-29 01:40:20,803 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 47 states and 58 transitions. [2020-07-29 01:40:20,803 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:20,820 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2020-07-29 01:40:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2020-07-29 01:40:20,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:20,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:20,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:20,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-29 01:40:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2020-07-29 01:40:20,834 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2020-07-29 01:40:20,835 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2020-07-29 01:40:20,835 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:40:20,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2020-07-29 01:40:20,836 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2020-07-29 01:40:20,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:20,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:20,837 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:20,837 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:20,837 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 201#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 202#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 217#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 197#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 209#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 196#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 183#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 182#recENTRY [2020-07-29 01:40:20,837 INFO L796 eck$LassoCheckResult]: Loop: 182#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 185#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 184#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 182#recENTRY [2020-07-29 01:40:20,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:20,838 INFO L82 PathProgramCache]: Analyzing trace with hash -15731550, now seen corresponding path program 1 times [2020-07-29 01:40:20,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:20,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728055066] [2020-07-29 01:40:20,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:20,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:20,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:20,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 1 times [2020-07-29 01:40:20,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:20,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724634769] [2020-07-29 01:40:20,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:20,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:20,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:20,962 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash -507170626, now seen corresponding path program 2 times [2020-07-29 01:40:20,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:20,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722287335] [2020-07-29 01:40:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:20,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:21,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:21,077 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:21,262 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2020-07-29 01:40:25,240 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2020-07-29 01:40:26,038 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2020-07-29 01:40:26,738 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2020-07-29 01:40:40,304 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:40,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:40,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:40,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:40,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:40,304 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:40,304 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:40,305 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:40,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B.i_Iteration2_Lasso [2020-07-29 01:40:40,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:40,305 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:40,373 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 01:40:40,385 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 01:40:40,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,395 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 01:40:40,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,415 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 01:40:40,421 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 01:40:40,425 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 01:40:40,429 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 01:40:40,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,447 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 01:40:40,451 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 01:40:40,455 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 01:40:40,459 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 01:40:40,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,476 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 01:40:40,480 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 01:40:40,488 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 01:40:40,492 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 01:40:40,497 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 01:40:40,503 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 01:40:40,507 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 01:40:40,511 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 01:40:40,515 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 01:40:40,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:40,521 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 01:40:40,524 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 01:40:40,690 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-07-29 01:40:40,748 WARN L257 bleTransFormulaUtils]: 5 quantified variables [2020-07-29 01:40:40,749 WARN L257 bleTransFormulaUtils]: 5 quantified variables [2020-07-29 01:40:41,581 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2020-07-29 01:40:41,752 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:41,752 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:40:41,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:41,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:41,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:41,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:41,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:41,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:41,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:41,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:41,766 INFO L522 LassoAnalysis]: Proving 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 01:40:41,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:41,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:41,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:41,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:41,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:41,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:41,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:41,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:41,796 INFO L522 LassoAnalysis]: Proving 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 01:40:41,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:41,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:41,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:41,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:41,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:41,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:41,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:41,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:41,823 INFO L522 LassoAnalysis]: Proving 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 01:40:41,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:41,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:41,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:41,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:41,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:41,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:41,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:41,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:41,851 INFO L522 LassoAnalysis]: Proving 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 01:40:41,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:41,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:41,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:41,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:41,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:41,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:41,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:41,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:41,878 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:41,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 01:40:41,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:41,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:41,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:41,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:41,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:41,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:41,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:41,909 INFO L522 LassoAnalysis]: Proving 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 01:40:41,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 01:40:41,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:41,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:41,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:41,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:41,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:41,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:41,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:41,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:41,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:41,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:41,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:41,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:41,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:41,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:41,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:41,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:41,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:42,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:42,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:40:42,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:42,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:42,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,223 INFO L522 LassoAnalysis]: Proving 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 01:40:42,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,249 INFO L522 LassoAnalysis]: Proving 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 01:40:42,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,279 INFO L522 LassoAnalysis]: Proving 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 01:40:42,301 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,327 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,330 INFO L522 LassoAnalysis]: Proving 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 01:40:42,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,356 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:42,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:42,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:40:42,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:42,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,400 INFO L522 LassoAnalysis]: Proving 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 01:40:42,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:42,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:42,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:42,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,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 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 01:40:42,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 01:40:42,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,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 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 01:40:42,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:42,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:42,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:42,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:42,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:42,686 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 01:40:42,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:42,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:42,717 INFO L522 LassoAnalysis]: Proving 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 01:40:42,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 01:40:42,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:42,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:42,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:42,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:42,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:42,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:42,752 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:42,771 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-07-29 01:40:42,771 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:42,774 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:42,777 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:42,778 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:42,778 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2020-07-29 01:40:42,805 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:40:42,809 INFO L393 LassoCheck]: Loop: "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset);" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< [2020-07-29 01:40:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:42,820 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:40:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:42,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:40:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:42,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:42,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {464#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {464#unseeded} is VALID [2020-07-29 01:40:42,889 INFO L280 TraceCheckUtils]: 1: Hoare triple {464#unseeded} havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; {464#unseeded} is VALID [2020-07-29 01:40:42,890 INFO L280 TraceCheckUtils]: 2: Hoare triple {464#unseeded} call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {464#unseeded} is VALID [2020-07-29 01:40:42,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {464#unseeded} assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {464#unseeded} is VALID [2020-07-29 01:40:42,891 INFO L263 TraceCheckUtils]: 4: Hoare triple {464#unseeded} call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset); {464#unseeded} is VALID [2020-07-29 01:40:42,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {464#unseeded} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {464#unseeded} is VALID [2020-07-29 01:40:42,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {464#unseeded} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {464#unseeded} is VALID [2020-07-29 01:40:42,894 INFO L263 TraceCheckUtils]: 7: Hoare triple {464#unseeded} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {464#unseeded} is VALID [2020-07-29 01:40:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:42,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-29 01:40:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:42,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:43,023 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:43,023 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2020-07-29 01:40:43,028 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:43,118 INFO L624 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2020-07-29 01:40:43,121 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:43,121 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2020-07-29 01:40:55,707 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:55,707 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_98|, rec_~op.base, rec_~op.offset]. (let ((.cse0 (select (select |v_#memory_int_98| rec_~op.base) rec_~op.offset))) (and (<= (+ (* 2 .cse0) 1) oldRank0) (= |#memory_int| (store |v_#memory_int_98| rec_~ip~0.base (store (select |v_#memory_int_98| rec_~ip~0.base) rec_~ip~0.offset (+ .cse0 (- 1))))) (<= 0 .cse0))) [2020-07-29 01:40:55,708 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset))) (and (<= (+ (* 2 .cse0) 3) oldRank0) (<= 0 (+ .cse0 1)))) [2020-07-29 01:40:55,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {467#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {508#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~op.base) rec_~op.offset)) 1) oldRank0))} is VALID [2020-07-29 01:40:55,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {508#(and (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~op.base) rec_~op.offset)) 1) oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {512#(and (<= (+ (* 2 (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset)) 3) oldRank0) (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)))} is VALID [2020-07-29 01:40:55,835 INFO L263 TraceCheckUtils]: 2: Hoare triple {512#(and (<= (+ (* 2 (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset)) 3) oldRank0) (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {482#(or (and (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:40:55,836 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 01:40:55,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:55,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:55,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:55,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:55,860 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:40:55,860 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-07-29 01:40:56,132 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 128 states and 165 transitions. Complement of second has 17 states. [2020-07-29 01:40:56,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:40:56,133 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:56,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. cyclomatic complexity: 16 [2020-07-29 01:40:56,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:56,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:56,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:56,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:56,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:56,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:56,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 165 transitions. [2020-07-29 01:40:56,142 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-07-29 01:40:56,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:56,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:56,145 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 57 transitions. cyclomatic complexity: 16 [2020-07-29 01:40:56,152 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:40:56,153 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:56,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:56,155 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:56,155 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 128 states and 165 transitions. cyclomatic complexity: 47 [2020-07-29 01:40:56,164 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2020-07-29 01:40:56,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:56,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:56,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:56,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:56,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:56,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:56,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:40:56,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:40:56,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:40:56,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:56,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:56,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 46 letters. Loop has 46 letters. [2020-07-29 01:40:56,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:40:56,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:40:56,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:40:56,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:56,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:56,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:56,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:56,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:56,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:56,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:56,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:56,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:56,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:56,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:56,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:56,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:40:56,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:40:56,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:40:56,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:56,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:56,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:56,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:56,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:56,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:56,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:56,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:56,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:56,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:56,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:56,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:56,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:56,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:56,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:40:56,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:40:56,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:40:56,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 23 letters. Loop has 3 letters. [2020-07-29 01:40:56,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:56,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:56,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 24 letters. Loop has 3 letters. [2020-07-29 01:40:56,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:56,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:56,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 25 letters. Loop has 3 letters. [2020-07-29 01:40:56,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:56,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:56,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:40:56,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:56,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:56,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 21 letters. Loop has 3 letters. [2020-07-29 01:40:56,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:56,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:56,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 22 letters. Loop has 3 letters. [2020-07-29 01:40:56,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 15 letters. [2020-07-29 01:40:56,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 15 letters. [2020-07-29 01:40:56,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 18 letters. Loop has 15 letters. [2020-07-29 01:40:56,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 15 letters. [2020-07-29 01:40:56,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 15 letters. [2020-07-29 01:40:56,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 24 letters. Loop has 15 letters. [2020-07-29 01:40:56,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 15 letters. [2020-07-29 01:40:56,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 15 letters. [2020-07-29 01:40:56,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 15 letters. [2020-07-29 01:40:56,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 15 letters. [2020-07-29 01:40:56,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 15 letters. [2020-07-29 01:40:56,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 19 letters. Loop has 15 letters. [2020-07-29 01:40:56,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 15 letters. [2020-07-29 01:40:56,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 15 letters. [2020-07-29 01:40:56,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 17 letters. Loop has 15 letters. [2020-07-29 01:40:56,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 15 letters. [2020-07-29 01:40:56,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 15 letters. [2020-07-29 01:40:56,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 24 letters. Loop has 15 letters. [2020-07-29 01:40:56,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:40:56,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:56,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:56,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:40:56,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:56,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:56,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:40:56,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:56,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:56,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:40:56,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 57 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 165 transitions. cyclomatic complexity: 47 Stem has 18 letters. Loop has 9 letters. [2020-07-29 01:40:56,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,235 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-29 01:40:56,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:40:56,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:40:56,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:56,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. cyclomatic complexity: 47 [2020-07-29 01:40:56,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-07-29 01:40:56,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 110 states and 147 transitions. [2020-07-29 01:40:56,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2020-07-29 01:40:56,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2020-07-29 01:40:56,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 147 transitions. [2020-07-29 01:40:56,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:56,269 INFO L688 BuchiCegarLoop]: Abstraction has 110 states and 147 transitions. [2020-07-29 01:40:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 147 transitions. [2020-07-29 01:40:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2020-07-29 01:40:56,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:56,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states and 147 transitions. Second operand 104 states. [2020-07-29 01:40:56,280 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states and 147 transitions. Second operand 104 states. [2020-07-29 01:40:56,280 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand 104 states. [2020-07-29 01:40:56,281 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:56,305 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2020-07-29 01:40:56,305 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 186 transitions. [2020-07-29 01:40:56,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:56,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:56,311 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 110 states and 147 transitions. [2020-07-29 01:40:56,311 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 110 states and 147 transitions. [2020-07-29 01:40:56,311 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:56,338 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2020-07-29 01:40:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2020-07-29 01:40:56,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:56,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:56,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:56,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-29 01:40:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2020-07-29 01:40:56,347 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2020-07-29 01:40:56,347 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2020-07-29 01:40:56,347 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:40:56,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 135 transitions. [2020-07-29 01:40:56,348 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2020-07-29 01:40:56,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:56,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:56,349 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:56,349 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:56,350 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 683#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 684#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 711#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 735#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 745#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 757#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 756#recFINAL assume true; 734#recEXIT >#39#return; 694#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 679#L33-3 [2020-07-29 01:40:56,350 INFO L796 eck$LassoCheckResult]: Loop: 679#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 680#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 726#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 717#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 738#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 730#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 731#recFINAL assume true; 716#recEXIT >#39#return; 713#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 679#L33-3 [2020-07-29 01:40:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:56,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2061793209, now seen corresponding path program 1 times [2020-07-29 01:40:56,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:56,351 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110309652] [2020-07-29 01:40:56,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:56,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 01:40:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:56,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {1346#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1347#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} is VALID [2020-07-29 01:40:56,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {1347#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1348#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:56,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {1348#(<= (+ |rec_#res| 1) 0)} assume true; {1348#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:56,494 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1348#(<= (+ |rec_#res| 1) 0)} {1339#true} #39#return; {1345#(<= (+ |ULTIMATE.start_main_#t~ret11| 1) 0)} is VALID [2020-07-29 01:40:56,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {1339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1339#true} is VALID [2020-07-29 01:40:56,495 INFO L280 TraceCheckUtils]: 1: Hoare triple {1339#true} havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; {1339#true} is VALID [2020-07-29 01:40:56,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {1339#true} call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {1339#true} is VALID [2020-07-29 01:40:56,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {1339#true} assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {1339#true} is VALID [2020-07-29 01:40:56,498 INFO L263 TraceCheckUtils]: 4: Hoare triple {1339#true} call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset); {1346#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:40:56,500 INFO L280 TraceCheckUtils]: 5: Hoare triple {1346#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1347#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} is VALID [2020-07-29 01:40:56,501 INFO L280 TraceCheckUtils]: 6: Hoare triple {1347#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1348#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:56,503 INFO L280 TraceCheckUtils]: 7: Hoare triple {1348#(<= (+ |rec_#res| 1) 0)} assume true; {1348#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:56,504 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {1348#(<= (+ |rec_#res| 1) 0)} {1339#true} #39#return; {1345#(<= (+ |ULTIMATE.start_main_#t~ret11| 1) 0)} is VALID [2020-07-29 01:40:56,505 INFO L280 TraceCheckUtils]: 9: Hoare triple {1345#(<= (+ |ULTIMATE.start_main_#t~ret11| 1) 0)} assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; {1340#false} is VALID [2020-07-29 01:40:56,506 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 01:40:56,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110309652] [2020-07-29 01:40:56,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:40:56,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:40:56,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235385097] [2020-07-29 01:40:56,512 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:40:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:56,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 2 times [2020-07-29 01:40:56,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:56,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145462457] [2020-07-29 01:40:56,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:56,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:56,536 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:56,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:57,092 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-07-29 01:40:57,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:40:57,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:40:57,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:40:57,210 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. cyclomatic complexity: 41 Second operand 6 states. [2020-07-29 01:40:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:57,408 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2020-07-29 01:40:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:40:57,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:40:57,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:57,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2020-07-29 01:40:57,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-29 01:40:57,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 117 transitions. [2020-07-29 01:40:57,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2020-07-29 01:40:57,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2020-07-29 01:40:57,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2020-07-29 01:40:57,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:57,454 INFO L688 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2020-07-29 01:40:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2020-07-29 01:40:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2020-07-29 01:40:57,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:57,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states and 117 transitions. Second operand 90 states. [2020-07-29 01:40:57,462 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states and 117 transitions. Second operand 90 states. [2020-07-29 01:40:57,463 INFO L87 Difference]: Start difference. First operand 92 states and 117 transitions. Second operand 90 states. [2020-07-29 01:40:57,463 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:57,479 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2020-07-29 01:40:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2020-07-29 01:40:57,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:57,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:57,480 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states and 117 transitions. [2020-07-29 01:40:57,480 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states and 117 transitions. [2020-07-29 01:40:57,480 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:57,497 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2020-07-29 01:40:57,497 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2020-07-29 01:40:57,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:57,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:57,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:57,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-29 01:40:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2020-07-29 01:40:57,505 INFO L711 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2020-07-29 01:40:57,505 INFO L591 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2020-07-29 01:40:57,505 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:40:57,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 115 transitions. [2020-07-29 01:40:57,507 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2020-07-29 01:40:57,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:57,507 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:57,508 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:57,508 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:57,508 INFO L794 eck$LassoCheckResult]: Stem: 1477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1471#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 1472#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1459#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1460#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 1511#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1510#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 1473#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1508#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1509#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 1528#recFINAL assume true; 1521#recEXIT >#37#return; 1519#L19-1 #res := #t~ret5;havoc #t~ret5; 1518#recFINAL assume true; 1515#recEXIT >#39#return; 1475#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 1463#L33-3 [2020-07-29 01:40:57,508 INFO L796 eck$LassoCheckResult]: Loop: 1463#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 1464#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1495#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 1480#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 1503#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1506#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 1505#recFINAL assume true; 1504#recEXIT >#39#return; 1498#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 1463#L33-3 [2020-07-29 01:40:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:57,509 INFO L82 PathProgramCache]: Analyzing trace with hash 970657719, now seen corresponding path program 1 times [2020-07-29 01:40:57,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:57,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366778865] [2020-07-29 01:40:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:57,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 01:40:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:57,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:40:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:57,642 INFO L280 TraceCheckUtils]: 0: Hoare triple {2012#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2019#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} is VALID [2020-07-29 01:40:57,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {2019#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {2018#(<= (+ |rec_#res| 1) 0)} assume true; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,647 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2018#(<= (+ |rec_#res| 1) 0)} {1999#true} #37#return; {2017#(<= (+ |rec_#t~ret5| 1) 0)} is VALID [2020-07-29 01:40:57,647 INFO L280 TraceCheckUtils]: 0: Hoare triple {2012#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1999#true} is VALID [2020-07-29 01:40:57,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {1999#true} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {1999#true} is VALID [2020-07-29 01:40:57,649 INFO L263 TraceCheckUtils]: 2: Hoare triple {1999#true} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2012#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:40:57,650 INFO L280 TraceCheckUtils]: 3: Hoare triple {2012#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2019#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} is VALID [2020-07-29 01:40:57,652 INFO L280 TraceCheckUtils]: 4: Hoare triple {2019#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,653 INFO L280 TraceCheckUtils]: 5: Hoare triple {2018#(<= (+ |rec_#res| 1) 0)} assume true; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,655 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2018#(<= (+ |rec_#res| 1) 0)} {1999#true} #37#return; {2017#(<= (+ |rec_#t~ret5| 1) 0)} is VALID [2020-07-29 01:40:57,656 INFO L280 TraceCheckUtils]: 7: Hoare triple {2017#(<= (+ |rec_#t~ret5| 1) 0)} #res := #t~ret5;havoc #t~ret5; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {2018#(<= (+ |rec_#res| 1) 0)} assume true; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,658 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2018#(<= (+ |rec_#res| 1) 0)} {1999#true} #39#return; {2011#(<= (+ |ULTIMATE.start_main_#t~ret11| 1) 0)} is VALID [2020-07-29 01:40:57,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {1999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1999#true} is VALID [2020-07-29 01:40:57,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {1999#true} havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; {1999#true} is VALID [2020-07-29 01:40:57,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {1999#true} call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {1999#true} is VALID [2020-07-29 01:40:57,660 INFO L280 TraceCheckUtils]: 3: Hoare triple {1999#true} assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); {1999#true} is VALID [2020-07-29 01:40:57,661 INFO L263 TraceCheckUtils]: 4: Hoare triple {1999#true} call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset); {2012#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:40:57,662 INFO L280 TraceCheckUtils]: 5: Hoare triple {2012#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1999#true} is VALID [2020-07-29 01:40:57,662 INFO L280 TraceCheckUtils]: 6: Hoare triple {1999#true} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); {1999#true} is VALID [2020-07-29 01:40:57,663 INFO L263 TraceCheckUtils]: 7: Hoare triple {1999#true} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2012#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} is VALID [2020-07-29 01:40:57,664 INFO L280 TraceCheckUtils]: 8: Hoare triple {2012#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |old(#length)| |#length|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2019#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} is VALID [2020-07-29 01:40:57,666 INFO L280 TraceCheckUtils]: 9: Hoare triple {2019#(= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,667 INFO L280 TraceCheckUtils]: 10: Hoare triple {2018#(<= (+ |rec_#res| 1) 0)} assume true; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,668 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2018#(<= (+ |rec_#res| 1) 0)} {1999#true} #37#return; {2017#(<= (+ |rec_#t~ret5| 1) 0)} is VALID [2020-07-29 01:40:57,670 INFO L280 TraceCheckUtils]: 12: Hoare triple {2017#(<= (+ |rec_#t~ret5| 1) 0)} #res := #t~ret5;havoc #t~ret5; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,671 INFO L280 TraceCheckUtils]: 13: Hoare triple {2018#(<= (+ |rec_#res| 1) 0)} assume true; {2018#(<= (+ |rec_#res| 1) 0)} is VALID [2020-07-29 01:40:57,672 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {2018#(<= (+ |rec_#res| 1) 0)} {1999#true} #39#return; {2011#(<= (+ |ULTIMATE.start_main_#t~ret11| 1) 0)} is VALID [2020-07-29 01:40:57,673 INFO L280 TraceCheckUtils]: 15: Hoare triple {2011#(<= (+ |ULTIMATE.start_main_#t~ret11| 1) 0)} assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; {2000#false} is VALID [2020-07-29 01:40:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-29 01:40:57,674 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366778865] [2020-07-29 01:40:57,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:40:57,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:40:57,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805366877] [2020-07-29 01:40:57,675 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:40:57,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 3 times [2020-07-29 01:40:57,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:57,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941712] [2020-07-29 01:40:57,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:57,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:57,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:57,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:58,249 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2020-07-29 01:40:58,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:40:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:40:58,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:40:58,439 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. cyclomatic complexity: 33 Second operand 7 states. [2020-07-29 01:40:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:58,682 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2020-07-29 01:40:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:40:58,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:40:58,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:58,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 96 transitions. [2020-07-29 01:40:58,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:58,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 52 states and 63 transitions. [2020-07-29 01:40:58,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:40:58,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:40:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2020-07-29 01:40:58,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:58,730 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2020-07-29 01:40:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2020-07-29 01:40:58,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-07-29 01:40:58,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:58,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states and 63 transitions. Second operand 49 states. [2020-07-29 01:40:58,734 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states and 63 transitions. Second operand 49 states. [2020-07-29 01:40:58,734 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 49 states. [2020-07-29 01:40:58,735 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:58,739 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2020-07-29 01:40:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2020-07-29 01:40:58,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:58,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:58,741 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states and 63 transitions. [2020-07-29 01:40:58,741 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states and 63 transitions. [2020-07-29 01:40:58,742 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:58,746 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2020-07-29 01:40:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2020-07-29 01:40:58,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:58,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:58,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:58,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-29 01:40:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2020-07-29 01:40:58,750 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2020-07-29 01:40:58,751 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2020-07-29 01:40:58,751 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:40:58,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2020-07-29 01:40:58,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:58,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:58,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:58,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:58,753 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:58,753 INFO L794 eck$LassoCheckResult]: Stem: 2120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2114#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 2115#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2109#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2110#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 2134#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 2141#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 2123#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 2143#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 2147#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 2145#recFINAL assume true; 2126#recEXIT >#37#return; 2127#L19-1 #res := #t~ret5;havoc #t~ret5; 2139#recFINAL assume true; 2135#recEXIT >#39#return; 2119#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 2111#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret11;havoc main_#t~ite12;havoc main_#t~mem13; 2112#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2108#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 2101#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 2100#recENTRY [2020-07-29 01:40:58,753 INFO L796 eck$LassoCheckResult]: Loop: 2100#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 2102#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;call ULTIMATE.dealloc(~op.base, ~op.offset); 2103#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 2100#recENTRY [2020-07-29 01:40:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:58,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1312873862, now seen corresponding path program 1 times [2020-07-29 01:40:58,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:58,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410655184] [2020-07-29 01:40:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:58,779 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:58,801 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:58,808 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 2 times [2020-07-29 01:40:58,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:58,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937837207] [2020-07-29 01:40:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:58,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:58,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:58,824 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:58,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1853025306, now seen corresponding path program 2 times [2020-07-29 01:40:58,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:58,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956421581] [2020-07-29 01:40:58,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:58,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:58,880 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:58,887 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:59,058 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2020-07-29 01:41:04,845 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2020-07-29 01:41:04,846 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.predicateBasedResultCheck(TransFormulaUtils.java:692) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialCompositionWithPendingCall(TransFormulaUtils.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.SequentialComposition.getInterproceduralTransFormula(SequentialComposition.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeTF(LassoCheck.java:362) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.computeLoopTF(LassoCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:850) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 29 more [2020-07-29 01:41:04,852 INFO L168 Benchmark]: Toolchain (without parser) took 49390.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 350.7 MB). Free memory was 961.6 MB in the beginning and 845.1 MB in the end (delta: 116.5 MB). Peak memory consumption was 467.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:04,852 INFO L168 Benchmark]: CDTParser took 0.27 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 01:41:04,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.72 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:04,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 950.9 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:04,854 INFO L168 Benchmark]: Boogie Preprocessor took 25.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:41:04,855 INFO L168 Benchmark]: RCFGBuilder took 460.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:04,856 INFO L168 Benchmark]: BuchiAutomizer took 48547.88 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 254.8 MB). Free memory was 1.1 GB in the beginning and 845.1 MB in the end (delta: 213.1 MB). Peak memory consumption was 467.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:04,861 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.27 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 253.72 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 950.9 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 460.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 48547.88 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 254.8 MB). Free memory was 1.1 GB in the beginning and 845.1 MB in the end (delta: 213.1 MB). Peak memory consumption was 467.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...