./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/sum01_bug02.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/sum01_bug02.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5465a084053aead702161d951dd339bfa1665d5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 02:05:36,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:05:36,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:05:36,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:05:36,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:05:36,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:05:36,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:05:36,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:05:36,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:05:36,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:05:36,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:05:36,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:05:36,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:05:36,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:05:36,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:05:36,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:05:36,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:05:36,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:05:36,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:05:36,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:05:36,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:05:36,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:05:36,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:05:36,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:05:36,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:05:36,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:05:36,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:05:36,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:05:36,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:05:36,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:05:36,195 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:05:36,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:05:36,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:05:36,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:05:36,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:05:36,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:05:36,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:05:36,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:05:36,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:05:36,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:05:36,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:05:36,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:05:36,220 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:05:36,220 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:05:36,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:05:36,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:05:36,222 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:05:36,222 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:05:36,223 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:05:36,223 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:05:36,223 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:05:36,223 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:05:36,223 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:05:36,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:05:36,224 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:05:36,224 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:05:36,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:05:36,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:05:36,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:05:36,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:05:36,225 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:05:36,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:05:36,226 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:05:36,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:05:36,226 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:05:36,226 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:05:36,227 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:05:36,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:05:36,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:05:36,227 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:05:36,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:05:36,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:05:36,228 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:05:36,228 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:05:36,229 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:05:36,229 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c5465a084053aead702161d951dd339bfa1665d5 [2020-07-29 02:05:36,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:05:36,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:05:36,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:05:36,621 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:05:36,622 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:05:36,623 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/sum01_bug02.i [2020-07-29 02:05:36,697 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52857a67b/5fb6d80a550c498abc814f9554b096e5/FLAG9ffbc1fad [2020-07-29 02:05:37,158 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:05:37,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/sum01_bug02.i [2020-07-29 02:05:37,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52857a67b/5fb6d80a550c498abc814f9554b096e5/FLAG9ffbc1fad [2020-07-29 02:05:37,579 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52857a67b/5fb6d80a550c498abc814f9554b096e5 [2020-07-29 02:05:37,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:05:37,587 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:05:37,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:05:37,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:05:37,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:05:37,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6902d293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37, skipping insertion in model container [2020-07-29 02:05:37,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:05:37,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:05:37,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:05:37,838 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:05:37,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:05:37,870 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:05:37,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37 WrapperNode [2020-07-29 02:05:37,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:05:37,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:05:37,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:05:37,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:05:37,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:05:37,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:05:37,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:05:37,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:05:37,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (1/1) ... [2020-07-29 02:05:37,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:05:37,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:05:37,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:05:37,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:05:37,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (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 02:05:38,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:05:38,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:05:38,246 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:05:38,246 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 02:05:38,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:05:38 BoogieIcfgContainer [2020-07-29 02:05:38,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:05:38,250 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:05:38,250 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:05:38,253 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:05:38,254 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:38,254 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:05:37" (1/3) ... [2020-07-29 02:05:38,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bb2a4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:05:38, skipping insertion in model container [2020-07-29 02:05:38,255 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:38,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:37" (2/3) ... [2020-07-29 02:05:38,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5bb2a4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:05:38, skipping insertion in model container [2020-07-29 02:05:38,256 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:38,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:05:38" (3/3) ... [2020-07-29 02:05:38,258 INFO L371 chiAutomizerObserver]: Analyzing ICFG sum01_bug02.i [2020-07-29 02:05:38,314 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:05:38,315 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:05:38,315 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:05:38,315 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:05:38,315 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:05:38,315 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:05:38,315 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:05:38,316 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:05:38,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 02:05:38,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:38,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:38,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:38,376 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:05:38,376 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:05:38,376 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:05:38,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 02:05:38,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:38,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:38,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:38,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:05:38,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:05:38,391 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; 3#L13-3true [2020-07-29 02:05:38,392 INFO L796 eck$LassoCheckResult]: Loop: 3#L13-3true assume !!(main_~i~0 <= main_~n~0); 11#L14true assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; 7#L14-2true main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; 6#L13-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 3#L13-3true [2020-07-29 02:05:38,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 02:05:38,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:38,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286548558] [2020-07-29 02:05:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:38,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:38,546 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:38,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:38,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1203686, now seen corresponding path program 1 times [2020-07-29 02:05:38,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:38,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112827793] [2020-07-29 02:05:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:38,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:38,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:38,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:38,585 INFO L82 PathProgramCache]: Analyzing trace with hash 29832837, now seen corresponding path program 1 times [2020-07-29 02:05:38,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:38,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170214214] [2020-07-29 02:05:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:38,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:38,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:38,677 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:38,813 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:05:38,814 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:05:38,814 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:05:38,814 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:05:38,814 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:05:38,815 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:38,815 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:05:38,815 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:05:38,815 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum01_bug02.i_Iteration1_Loop [2020-07-29 02:05:38,815 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:05:38,816 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:05:38,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:38,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:38,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:38,895 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 02:05:39,064 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:05:39,065 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:39,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:05:39,080 INFO L160 nArgumentSynthesizer]: Using integer mode. 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 02:05:39,131 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:05:39,131 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:05:39,160 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:05:39,160 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~sn~0=0} Honda state: {ULTIMATE.start_main_~sn~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~sn~0=5}, {ULTIMATE.start_main_~sn~0=-4}, {ULTIMATE.start_main_~sn~0=1}] Lambdas: [1, 1, 1] Nus: [0, 0] 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 02:05:39,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:05:39,209 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:39,254 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:05:39,254 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:05:39,352 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:05:39,354 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:05:39,354 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:05:39,354 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:05:39,355 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:05:39,355 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:05:39,355 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:39,355 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:05:39,355 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:05:39,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum01_bug02.i_Iteration1_Loop [2020-07-29 02:05:39,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:05:39,357 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:05:39,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:39,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:39,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 02:05:39,406 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 02:05:39,553 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:05:39,559 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:05:39,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:39,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:39,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:39,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:39,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:39,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:39,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:39,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:39,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:39,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:39,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:39,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:39,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:39,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:39,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:39,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:39,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:39,628 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:05:39,650 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:05:39,651 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2020-07-29 02:05:39,667 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:05:39,667 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:05:39,668 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:05:39,670 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:39,709 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:05:39,715 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 <= main_~n~0);" "assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0;" "main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2;" "main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1;" [2020-07-29 02:05:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:39,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:05:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:39,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:39,780 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {21#unseeded} is VALID [2020-07-29 02:05:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:39,786 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 02:05:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:39,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:39,946 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ ULTIMATE.start_main_~j~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 <= main_~n~0); {24#(>= oldRank0 (+ ULTIMATE.start_main_~j~0 (* (- 1) ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:05:39,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#(>= oldRank0 (+ ULTIMATE.start_main_~j~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume main_~i~0 < main_~j~0;main_~sn~0 := 2 + main_~sn~0; {42#(and (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~j~0 (+ oldRank0 ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:05:39,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#(and (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~j~0 (+ oldRank0 ULTIMATE.start_main_~i~0)))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {46#(and (<= (+ ULTIMATE.start_main_~j~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= 1 oldRank0))} is VALID [2020-07-29 02:05:39,951 INFO L280 TraceCheckUtils]: 3: Hoare triple {46#(and (<= (+ ULTIMATE.start_main_~j~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= 1 oldRank0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {34#(or (and (> oldRank0 (+ ULTIMATE.start_main_~j~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:05:39,952 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 02:05:39,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 02:05:39,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:39,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:05:39,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:39,999 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 02:05:40,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2020-07-29 02:05:40,153 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 34 states and 44 transitions. Complement of second has 7 states. [2020-07-29 02:05:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:05:40,154 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:40,154 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 02:05:40,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:40,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:40,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:40,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 02:05:40,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 02:05:40,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:40,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:40,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-07-29 02:05:40,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:40,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:40,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:40,177 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 02:05:40,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:40,184 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:05:40,184 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 02:05:40,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 02:05:40,197 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:05:40,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 44 transitions. cyclomatic complexity: 12 [2020-07-29 02:05:40,199 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:05:40,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:05:40,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:05:40,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:05:40,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:40,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:40,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:40,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 02:05:40,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 02:05:40,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 34 letters. Loop has 34 letters. [2020-07-29 02:05:40,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:05:40,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:05:40,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:05:40,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:05:40,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:05:40,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:05:40,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:05:40,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:05:40,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:05:40,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:40,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:40,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:40,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:40,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:40,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:40,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:05:40,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:05:40,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:05:40,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:40,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:40,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:40,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:40,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:40,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:40,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:05:40,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:05:40,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:05:40,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:40,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:05:40,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:05:40,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 12 Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:05:40,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,223 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 02:05:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 02:05:40,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 02:05:40,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:05:40,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 1 letters. Loop has 8 letters. [2020-07-29 02:05:40,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:40,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. cyclomatic complexity: 12 [2020-07-29 02:05:40,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:40,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 14 states and 17 transitions. [2020-07-29 02:05:40,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 02:05:40,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 02:05:40,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2020-07-29 02:05:40,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:05:40,244 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 02:05:40,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2020-07-29 02:05:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-07-29 02:05:40,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:40,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 17 transitions. Second operand 12 states. [2020-07-29 02:05:40,274 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 17 transitions. Second operand 12 states. [2020-07-29 02:05:40,277 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 12 states. [2020-07-29 02:05:40,280 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:40,283 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2020-07-29 02:05:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2020-07-29 02:05:40,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:40,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:40,285 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 14 states and 17 transitions. [2020-07-29 02:05:40,285 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 14 states and 17 transitions. [2020-07-29 02:05:40,286 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:40,288 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 02:05:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 02:05:40,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:40,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:40,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:40,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 02:05:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-29 02:05:40,292 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 02:05:40,292 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 02:05:40,292 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:05:40,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2020-07-29 02:05:40,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:40,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:40,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:40,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:05:40,293 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:05:40,294 INFO L794 eck$LassoCheckResult]: Stem: 98#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; 99#L13-3 assume !!(main_~i~0 <= main_~n~0); 95#L14 [2020-07-29 02:05:40,294 INFO L796 eck$LassoCheckResult]: Loop: 95#L14 assume !(main_~i~0 < main_~j~0); 102#L14-2 main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; 100#L13-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 94#L13-3 assume !!(main_~i~0 <= main_~n~0); 95#L14 [2020-07-29 02:05:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1001, now seen corresponding path program 1 times [2020-07-29 02:05:40,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:40,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997690953] [2020-07-29 02:05:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:40,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:40,324 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:40,327 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:40,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:40,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1356538, now seen corresponding path program 1 times [2020-07-29 02:05:40,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:40,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113640665] [2020-07-29 02:05:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:40,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:40,336 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:40,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 924877538, now seen corresponding path program 1 times [2020-07-29 02:05:40,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:40,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145793140] [2020-07-29 02:05:40,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:40,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {169#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {171#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:05:40,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume !!(main_~i~0 <= main_~n~0); {171#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 02:05:40,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#(<= (+ ULTIMATE.start_main_~i~0 9) ULTIMATE.start_main_~j~0)} assume !(main_~i~0 < main_~j~0); {170#false} is VALID [2020-07-29 02:05:40,395 INFO L280 TraceCheckUtils]: 3: Hoare triple {170#false} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {170#false} is VALID [2020-07-29 02:05:40,395 INFO L280 TraceCheckUtils]: 4: Hoare triple {170#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {170#false} is VALID [2020-07-29 02:05:40,396 INFO L280 TraceCheckUtils]: 5: Hoare triple {170#false} assume !!(main_~i~0 <= main_~n~0); {170#false} is VALID [2020-07-29 02:05:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:40,397 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145793140] [2020-07-29 02:05:40,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:05:40,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 02:05:40,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955355767] [2020-07-29 02:05:40,430 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:05:40,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:05:40,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:05:40,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:05:40,431 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:05:40,431 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:40,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:05:40,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:05:40,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum01_bug02.i_Iteration2_Loop [2020-07-29 02:05:40,432 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:05:40,433 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:05:40,440 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 02:05:40,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:40,461 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 02:05:40,547 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:05:40,547 INFO L404 LassoAnalysis]: Checking for nontermination... 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 02:05:40,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:05:40,551 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:40,556 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:05:40,556 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 02:05:40,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:05:40,601 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:40,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:05:40,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:05:41,096 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:05:41,099 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:05:41,099 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:05:41,099 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:05:41,099 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:05:41,099 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:05:41,100 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:41,100 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:05:41,100 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:05:41,100 INFO L133 ssoRankerPreferences]: Filename of dumped script: sum01_bug02.i_Iteration2_Loop [2020-07-29 02:05:41,100 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:05:41,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:05:41,111 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 02:05:41,115 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 02:05:41,126 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 02:05:41,207 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:05:41,208 INFO L489 LassoAnalysis]: Using template 'affine'. 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 02:05:41,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:05:41,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:41,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:41,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:41,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:41,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:41,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:41,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:41,217 INFO L522 LassoAnalysis]: Proving 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 02:05:41,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 02:05:41,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:41,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:41,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:41,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:41,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:41,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:41,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:41,263 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:05:41,269 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 02:05:41,269 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. 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) [2020-07-29 02:05:41,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:05:41,281 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:05:41,281 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:05:41,281 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:41,313 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:05:41,317 INFO L393 LassoCheck]: Loop: "assume !(main_~i~0 < main_~j~0);" "main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2;" "main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1;" "assume !!(main_~i~0 <= main_~n~0);" [2020-07-29 02:05:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:41,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:05:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:41,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:41,347 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~post2, main_#t~post1, main_~i~0, main_~j~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~j~0 := 10;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; {172#unseeded} is VALID [2020-07-29 02:05:41,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#unseeded} assume !!(main_~i~0 <= main_~n~0); {172#unseeded} is VALID [2020-07-29 02:05:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:41,354 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:05:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:41,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:41,412 INFO L280 TraceCheckUtils]: 0: Hoare triple {175#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !(main_~i~0 < main_~j~0); {175#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:05:41,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {175#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} main_#t~post2 := main_~j~0;main_~j~0 := main_#t~post2 - 1;havoc main_#t~post2; {175#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 02:05:41,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {175#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {199#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 02:05:41,416 INFO L280 TraceCheckUtils]: 3: Hoare triple {199#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 <= main_~n~0); {185#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:05:41,416 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 02:05:41,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:05:41,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:41,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:41,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 02:05:41,425 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 02:05:41,469 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 22 states and 28 transitions. Complement of second has 6 states. [2020-07-29 02:05:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:05:41,470 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:41,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 02:05:41,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:41,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:41,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:05:41,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:05:41,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:41,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:41,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-07-29 02:05:41,473 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:05:41,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:05:41,473 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 02:05:41,474 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:05:41,474 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:05:41,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:05:41,476 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:05:41,476 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 02:05:41,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 02:05:41,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:05:41,477 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:05:41,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:41,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:41,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:41,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:41,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:41,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:41,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 22 letters. [2020-07-29 02:05:41,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 02:05:41,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 22 letters. Loop has 22 letters. [2020-07-29 02:05:41,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 02:05:41,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 02:05:41,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 02:05:41,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:41,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:41,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:41,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:41,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:41,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:41,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:41,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:41,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 4 letters. [2020-07-29 02:05:41,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:05:41,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:05:41,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:05:41,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:41,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:41,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:41,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:41,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:41,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:05:41,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,492 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:41,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:05:41,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2020-07-29 02:05:41,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 02:05:41,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:05:41,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 02:05:41,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:41,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 02:05:41,497 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:05:41,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2020-07-29 02:05:41,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:05:41,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:05:41,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:05:41,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:05:41,499 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:05:41,499 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:05:41,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:05:41,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 02:05:41,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 02:05:41,504 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 02:05:41,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:41,504 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 02:05:41,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 02:05:41,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:05:41,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:41,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 02:05:41,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:05:41,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 02:05:41,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:05:41,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:05:41,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:05:41,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:05:41,515 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:05:41,515 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:05:41,516 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:05:41,516 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:05:41,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 02:05:41,516 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:05:41,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:05:41,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:05:41 BoogieIcfgContainer [2020-07-29 02:05:41,523 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:05:41,524 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:05:41,524 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:05:41,524 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:05:41,524 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:05:38" (3/4) ... [2020-07-29 02:05:41,528 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 02:05:41,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:05:41,531 INFO L168 Benchmark]: Toolchain (without parser) took 3946.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 960.2 MB in the beginning and 791.0 MB in the end (delta: 169.2 MB). Peak memory consumption was 272.5 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:41,532 INFO L168 Benchmark]: CDTParser took 1.04 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 02:05:41,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.86 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:41,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:41,535 INFO L168 Benchmark]: Boogie Preprocessor took 19.01 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:41,536 INFO L168 Benchmark]: RCFGBuilder took 268.76 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:41,536 INFO L168 Benchmark]: BuchiAutomizer took 3273.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 791.0 MB in the end (delta: 282.2 MB). Peak memory consumption was 282.2 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:41,537 INFO L168 Benchmark]: Witness Printer took 4.77 ms. Allocated memory is still 1.1 GB. Free memory is still 791.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:05:41,542 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 1.04 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 283.86 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 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 89.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.3 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.01 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 268.76 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: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3273.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 791.0 MB in the end (delta: 282.2 MB). Peak memory consumption was 282.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.77 ms. Allocated memory is still 1.1 GB. Free memory is still 791.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function j + -1 * i and consists of 5 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 14 SDslu, 12 SDs, 0 SdLazy, 26 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf97 lsp89 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq166 hnf93 smp100 dnf100 smp100 tf107 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...