./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 446a3f39420f718ff3d1f0852398f1e5da972fdc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 01:31:37,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 01:31:37,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 01:31:37,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 01:31:37,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 01:31:37,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 01:31:37,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 01:31:37,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 01:31:37,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 01:31:37,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 01:31:37,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 01:31:37,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 01:31:37,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 01:31:37,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 01:31:37,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 01:31:37,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 01:31:37,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 01:31:37,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 01:31:37,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 01:31:37,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 01:31:37,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 01:31:37,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 01:31:37,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 01:31:37,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 01:31:37,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 01:31:37,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 01:31:37,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 01:31:37,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 01:31:37,598 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 01:31:37,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 01:31:37,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 01:31:37,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 01:31:37,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 01:31:37,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 01:31:37,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 01:31:37,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 01:31:37,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 01:31:37,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 01:31:37,604 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 01:31:37,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 01:31:37,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 01:31:37,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-08-31 01:31:37,641 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 01:31:37,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 01:31:37,643 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 01:31:37,643 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 01:31:37,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 01:31:37,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 01:31:37,645 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 01:31:37,645 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 01:31:37,645 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 01:31:37,645 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 01:31:37,646 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 01:31:37,646 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 01:31:37,646 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 01:31:37,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 01:31:37,647 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 01:31:37,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 01:31:37,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 01:31:37,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 01:31:37,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 01:31:37,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 01:31:37,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 01:31:37,648 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 01:31:37,648 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 01:31:37,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 01:31:37,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 01:31:37,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 01:31:37,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 01:31:37,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 01:31:37,649 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 01:31:37,650 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 01:31:37,650 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 446a3f39420f718ff3d1f0852398f1e5da972fdc [2021-08-31 01:31:37,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 01:31:37,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 01:31:37,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 01:31:37,948 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 01:31:37,949 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 01:31:37,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2021-08-31 01:31:38,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f8ad837/710ed93741f044618f731dfa0b0aa57c/FLAGae745215d [2021-08-31 01:31:38,383 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 01:31:38,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2021-08-31 01:31:38,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f8ad837/710ed93741f044618f731dfa0b0aa57c/FLAGae745215d [2021-08-31 01:31:38,404 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46f8ad837/710ed93741f044618f731dfa0b0aa57c [2021-08-31 01:31:38,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 01:31:38,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 01:31:38,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 01:31:38,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 01:31:38,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 01:31:38,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@452b3700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38, skipping insertion in model container [2021-08-31 01:31:38,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 01:31:38,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 01:31:38,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 01:31:38,559 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 01:31:38,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 01:31:38,582 INFO L208 MainTranslator]: Completed translation [2021-08-31 01:31:38,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38 WrapperNode [2021-08-31 01:31:38,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 01:31:38,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 01:31:38,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 01:31:38,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 01:31:38,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 01:31:38,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 01:31:38,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 01:31:38,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 01:31:38,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 01:31:38,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 01:31:38,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 01:31:38,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 01:31:38,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (1/1) ... [2021-08-31 01:31:38,678 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:38,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:38,698 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:38,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 01:31:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 01:31:38,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 01:31:38,832 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 01:31:38,833 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-31 01:31:38,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:31:38 BoogieIcfgContainer [2021-08-31 01:31:38,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 01:31:38,835 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 01:31:38,835 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 01:31:38,838 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 01:31:38,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:31:38,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 01:31:38" (1/3) ... [2021-08-31 01:31:38,839 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c4f5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 01:31:38, skipping insertion in model container [2021-08-31 01:31:38,840 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:31:38,840 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 01:31:38" (2/3) ... [2021-08-31 01:31:38,840 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68c4f5a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 01:31:38, skipping insertion in model container [2021-08-31 01:31:38,841 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 01:31:38,841 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 01:31:38" (3/3) ... [2021-08-31 01:31:38,842 INFO L389 chiAutomizerObserver]: Analyzing ICFG NarrowKonv.c [2021-08-31 01:31:38,898 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 01:31:38,898 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 01:31:38,899 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 01:31:38,899 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 01:31:38,899 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 01:31:38,899 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 01:31:38,900 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 01:31:38,900 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 01:31:38,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:38,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:31:38,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:38,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:38,927 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1] [2021-08-31 01:31:38,928 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:38,928 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 01:31:38,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:38,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:31:38,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:38,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:38,930 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1] [2021-08-31 01:31:38,930 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:38,935 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 4#L12-1true [2021-08-31 01:31:38,935 INFO L793 eck$LassoCheckResult]: Loop: 4#L12-1true assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9#L12true assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 4#L12-1true [2021-08-31 01:31:38,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2021-08-31 01:31:38,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:38,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394613108] [2021-08-31 01:31:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:38,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,011 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,030 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:39,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 1 times [2021-08-31 01:31:39,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:39,034 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820111110] [2021-08-31 01:31:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:39,034 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,046 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,070 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:39,072 INFO L82 PathProgramCache]: Analyzing trace with hash 31083, now seen corresponding path program 1 times [2021-08-31 01:31:39,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:39,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31006375] [2021-08-31 01:31:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:39,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:39,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:39,153 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31006375] [2021-08-31 01:31:39,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31006375] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:31:39,153 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:31:39,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-31 01:31:39,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964710655] [2021-08-31 01:31:39,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 01:31:39,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 01:31:39,213 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:39,256 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2021-08-31 01:31:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 01:31:39,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2021-08-31 01:31:39,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-31 01:31:39,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 7 states and 10 transitions. [2021-08-31 01:31:39,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-08-31 01:31:39,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-31 01:31:39,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2021-08-31 01:31:39,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 01:31:39,267 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2021-08-31 01:31:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2021-08-31 01:31:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-08-31 01:31:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2021-08-31 01:31:39,287 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2021-08-31 01:31:39,288 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2021-08-31 01:31:39,288 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 01:31:39,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2021-08-31 01:31:39,289 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-31 01:31:39,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:39,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:39,291 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1] [2021-08-31 01:31:39,291 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:31:39,291 INFO L791 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 37#L12-1 [2021-08-31 01:31:39,291 INFO L793 eck$LassoCheckResult]: Loop: 37#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 39#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 40#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 37#L12-1 [2021-08-31 01:31:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:39,293 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2021-08-31 01:31:39,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:39,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783456830] [2021-08-31 01:31:39,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:39,295 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,302 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,306 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:39,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:39,308 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 1 times [2021-08-31 01:31:39,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:39,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20784369] [2021-08-31 01:31:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:39,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,321 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,334 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:39,336 INFO L82 PathProgramCache]: Analyzing trace with hash 963343, now seen corresponding path program 1 times [2021-08-31 01:31:39,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:39,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609882452] [2021-08-31 01:31:39,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:39,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,343 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:39,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:39,439 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:31:39,440 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:31:39,440 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:31:39,440 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:31:39,440 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:31:39,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:31:39,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:31:39,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2021-08-31 01:31:39,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:31:39,441 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:31:39,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:39,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:39,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:39,529 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:31:39,529 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:31:39,531 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:39,532 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:39,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:39,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:39,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-31 01:31:39,567 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 01:31:39,567 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 01:31:39,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-08-31 01:31:39,587 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:39,588 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:39,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-31 01:31:39,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:39,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:39,612 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 01:31:39,613 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 01:31:39,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:39,638 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:39,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:39,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-31 01:31:39,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:39,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:39,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:39,672 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:39,682 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:39,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:31:39,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:39,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-31 01:31:39,743 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:31:39,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-08-31 01:31:39,748 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:31:39,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:31:39,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:31:39,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:31:39,748 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:31:39,748 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,748 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:31:39,749 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:31:39,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2021-08-31 01:31:39,749 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:31:39,749 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:31:39,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:39,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:39,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:39,832 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:31:39,836 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:31:39,837 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:39,838 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:39,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-31 01:31:39,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:39,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:39,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:39,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:39,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:39,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:31:39,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:31:39,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:31:39,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:39,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:39,901 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:39,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-31 01:31:39,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:39,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:39,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:39,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:39,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:39,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:31:39,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:31:39,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:31:39,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:39,958 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:39,958 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:39,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-31 01:31:39,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:39,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:39,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:31:39,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:39,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:39,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:39,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:31:39,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:31:39,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 01:31:39,988 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 01:31:39,989 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 01:31:39,990 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:39,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:39,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:39,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-31 01:31:39,995 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 01:31:39,995 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 01:31:39,995 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 01:31:39,996 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2021-08-31 01:31:40,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:40,014 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 01:31:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:40,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 01:31:40,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:40,068 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-31 01:31:40,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:40,108 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 [2021-08-31 01:31:40,109 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:40,142 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10 states and 14 transitions. Complement of second has 5 states. [2021-08-31 01:31:40,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 01:31:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2021-08-31 01:31:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 1 letters. Loop has 3 letters. [2021-08-31 01:31:40,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 3 letters. [2021-08-31 01:31:40,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:40,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 1 letters. Loop has 6 letters. [2021-08-31 01:31:40,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:40,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 14 transitions. [2021-08-31 01:31:40,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:31:40,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 14 transitions. [2021-08-31 01:31:40,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-08-31 01:31:40,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2021-08-31 01:31:40,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2021-08-31 01:31:40,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:40,148 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2021-08-31 01:31:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2021-08-31 01:31:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-08-31 01:31:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2021-08-31 01:31:40,150 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2021-08-31 01:31:40,150 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2021-08-31 01:31:40,150 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 01:31:40,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2021-08-31 01:31:40,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2021-08-31 01:31:40,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:40,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:40,151 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-31 01:31:40,151 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:40,151 INFO L791 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 90#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 88#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 91#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 84#L12-1 [2021-08-31 01:31:40,152 INFO L793 eck$LassoCheckResult]: Loop: 84#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 85#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 84#L12-1 [2021-08-31 01:31:40,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash 963341, now seen corresponding path program 1 times [2021-08-31 01:31:40,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:40,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090675714] [2021-08-31 01:31:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:40,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,159 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,167 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:40,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:40,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 2 times [2021-08-31 01:31:40,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:40,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623874386] [2021-08-31 01:31:40,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:40,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,172 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,176 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:40,178 INFO L82 PathProgramCache]: Analyzing trace with hash 925771032, now seen corresponding path program 1 times [2021-08-31 01:31:40,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:40,178 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158872271] [2021-08-31 01:31:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:40,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:40,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:40,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:40,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158872271] [2021-08-31 01:31:40,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158872271] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:40,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972142090] [2021-08-31 01:31:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:40,212 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:40,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,229 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-08-31 01:31:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:40,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 01:31:40,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:40,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:40,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:40,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:40,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972142090] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:40,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:40,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2021-08-31 01:31:40,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448923334] [2021-08-31 01:31:40,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-31 01:31:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-31 01:31:40,361 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 6 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:40,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:40,413 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2021-08-31 01:31:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-31 01:31:40,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2021-08-31 01:31:40,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-31 01:31:40,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2021-08-31 01:31:40,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-31 01:31:40,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-31 01:31:40,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2021-08-31 01:31:40,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:40,416 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-31 01:31:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2021-08-31 01:31:40,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-08-31 01:31:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-08-31 01:31:40,418 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-31 01:31:40,418 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-08-31 01:31:40,419 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 01:31:40,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-08-31 01:31:40,419 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-31 01:31:40,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:40,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:40,420 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1] [2021-08-31 01:31:40,420 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:31:40,420 INFO L791 eck$LassoCheckResult]: Stem: 165#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 166#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 164#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 170#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 160#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 161#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 167#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 168#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 181#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 180#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 173#L12-1 [2021-08-31 01:31:40,420 INFO L793 eck$LassoCheckResult]: Loop: 173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 179#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 173#L12-1 [2021-08-31 01:31:40,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash -92441875, now seen corresponding path program 1 times [2021-08-31 01:31:40,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:40,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184188535] [2021-08-31 01:31:40,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:40,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,428 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,434 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:40,434 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 2 times [2021-08-31 01:31:40,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:40,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100166668] [2021-08-31 01:31:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:40,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,438 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,440 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash -861851358, now seen corresponding path program 2 times [2021-08-31 01:31:40,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:40,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954942286] [2021-08-31 01:31:40,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:40,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,448 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:40,454 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:40,489 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:31:40,490 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:31:40,490 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:31:40,490 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:31:40,490 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:31:40,490 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,490 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:31:40,490 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:31:40,491 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration4_Loop [2021-08-31 01:31:40,491 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:31:40,491 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:31:40,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:40,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:40,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:40,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:40,585 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:31:40,586 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:31:40,586 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,587 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,592 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:40,592 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:40,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-31 01:31:40,613 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 01:31:40,613 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 01:31:40,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:40,638 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,641 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-31 01:31:40,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:40,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:40,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 01:31:40,665 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 01:31:40,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:40,690 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,691 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-31 01:31:40,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:40,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:40,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:40,738 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,738 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-31 01:31:40,740 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:31:40,740 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:40,781 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:31:40,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:40,784 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:31:40,784 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:31:40,784 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:31:40,784 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:31:40,784 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:31:40,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:31:40,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:31:40,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration4_Loop [2021-08-31 01:31:40,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:31:40,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:31:40,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:40,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:40,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:40,848 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:31:40,848 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:31:40,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,849 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:40,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:40,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:40,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:40,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:40,870 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:31:40,870 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:31:40,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-31 01:31:40,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:31:40,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:40,909 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,910 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-31 01:31:40,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:40,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:40,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:40,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:40,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:40,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:31:40,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:31:40,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:31:40,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:40,955 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,956 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-31 01:31:40,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:40,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:40,965 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:31:40,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:40,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:40,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:40,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:31:40,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:31:40,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 01:31:40,975 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-08-31 01:31:40,975 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-08-31 01:31:40,975 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:40,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:40,985 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:40,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 01:31:40,991 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 01:31:40,991 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 01:31:40,991 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~range~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2021-08-31 01:31:40,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-31 01:31:41,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:41,014 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 01:31:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,075 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:41,099 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 [2021-08-31 01:31:41,100 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 49 transitions. Complement of second has 5 states. [2021-08-31 01:31:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 01:31:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-08-31 01:31:41,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 3 letters. [2021-08-31 01:31:41,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 13 letters. Loop has 3 letters. [2021-08-31 01:31:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 6 letters. [2021-08-31 01:31:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:41,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 49 transitions. [2021-08-31 01:31:41,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-31 01:31:41,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 43 transitions. [2021-08-31 01:31:41,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-31 01:31:41,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-08-31 01:31:41,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2021-08-31 01:31:41,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:41,133 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2021-08-31 01:31:41,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2021-08-31 01:31:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2021-08-31 01:31:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2021-08-31 01:31:41,136 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-08-31 01:31:41,136 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2021-08-31 01:31:41,136 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 01:31:41,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2021-08-31 01:31:41,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-08-31 01:31:41,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:41,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:41,138 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1] [2021-08-31 01:31:41,138 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-08-31 01:31:41,138 INFO L791 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 294#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 288#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 292#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 287#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 303#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 285#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 286#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 290#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 291#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 306#L12-1 [2021-08-31 01:31:41,138 INFO L793 eck$LassoCheckResult]: Loop: 306#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 312#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 304#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 306#L12-1 [2021-08-31 01:31:41,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:41,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1265081566, now seen corresponding path program 3 times [2021-08-31 01:31:41,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:41,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173188156] [2021-08-31 01:31:41,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:41,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:41,145 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:41,152 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:41,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:41,153 INFO L82 PathProgramCache]: Analyzing trace with hash 39822, now seen corresponding path program 3 times [2021-08-31 01:31:41,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:41,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192044281] [2021-08-31 01:31:41,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:41,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:41,156 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:41,158 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash -293079663, now seen corresponding path program 4 times [2021-08-31 01:31:41,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:41,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869833740] [2021-08-31 01:31:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:41,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:41,165 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:41,173 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:41,195 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:31:41,195 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:31:41,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:31:41,195 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:31:41,195 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:31:41,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:41,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:31:41,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:31:41,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2021-08-31 01:31:41,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:31:41,196 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:31:41,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:41,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:41,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:41,236 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:31:41,236 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:31:41,237 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:41,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:41,241 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:41,251 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:41,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:41,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-31 01:31:41,281 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 01:31:41,281 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 01:31:41,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:41,302 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:41,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:41,303 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:41,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-31 01:31:41,307 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:41,307 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:41,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-08-31 01:31:41,341 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:41,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:41,342 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:41,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-31 01:31:41,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:31:41,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:41,384 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:31:41,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:41,388 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:31:41,388 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:31:41,388 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:31:41,388 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:31:41,388 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:31:41,388 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:41,388 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:31:41,388 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:31:41,388 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2021-08-31 01:31:41,388 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:31:41,388 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:31:41,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:41,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:41,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:41,441 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:31:41,441 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:31:41,441 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:41,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:41,442 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:41,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:41,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:41,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:41,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:41,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:41,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-31 01:31:41,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-31 01:31:41,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-31 01:31:41,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-31 01:31:41,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-08-31 01:31:41,500 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:41,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:41,501 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:41,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-31 01:31:41,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:41,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:41,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:31:41,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:41,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:41,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:41,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:31:41,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:31:41,511 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 01:31:41,514 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-08-31 01:31:41,514 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-08-31 01:31:41,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:41,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:41,516 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:41,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-08-31 01:31:41,517 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 01:31:41,520 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 01:31:41,520 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 01:31:41,520 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~range~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2021-08-31 01:31:41,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:41,540 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 01:31:41,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,589 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:41,608 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 [2021-08-31 01:31:41,608 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,649 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 50 transitions. Complement of second has 5 states. [2021-08-31 01:31:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 01:31:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-08-31 01:31:41,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 13 letters. Loop has 3 letters. [2021-08-31 01:31:41,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:41,651 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 01:31:41,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:41,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,718 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:41,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:41,743 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 01:31:41,743 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 50 transitions. Complement of second has 5 states. [2021-08-31 01:31:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 01:31:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-08-31 01:31:41,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 13 letters. Loop has 3 letters. [2021-08-31 01:31:41,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:41,764 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-08-31 01:31:41,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,813 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:41,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:41,834 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 01:31:41,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 39 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 56 states and 68 transitions. Complement of second has 4 states. [2021-08-31 01:31:41,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 01:31:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2021-08-31 01:31:41,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 13 letters. Loop has 3 letters. [2021-08-31 01:31:41,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:41,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 16 letters. Loop has 3 letters. [2021-08-31 01:31:41,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:41,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 13 letters. Loop has 6 letters. [2021-08-31 01:31:41,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:41,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 68 transitions. [2021-08-31 01:31:41,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-08-31 01:31:41,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 46 states and 57 transitions. [2021-08-31 01:31:41,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-31 01:31:41,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-31 01:31:41,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 57 transitions. [2021-08-31 01:31:41,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:41,866 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2021-08-31 01:31:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 57 transitions. [2021-08-31 01:31:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2021-08-31 01:31:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.3) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2021-08-31 01:31:41,875 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-08-31 01:31:41,876 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2021-08-31 01:31:41,876 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-31 01:31:41,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2021-08-31 01:31:41,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2021-08-31 01:31:41,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:41,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:41,878 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1] [2021-08-31 01:31:41,878 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2021-08-31 01:31:41,878 INFO L791 eck$LassoCheckResult]: Stem: 644#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 645#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 640#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 665#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 664#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 646#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 641#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 636#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 637#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 642#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 643#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 662#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 656#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 655#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 654#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 652#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 650#L12-1 [2021-08-31 01:31:41,878 INFO L793 eck$LassoCheckResult]: Loop: 650#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 651#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 660#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 659#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 657#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 650#L12-1 [2021-08-31 01:31:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash -99360241, now seen corresponding path program 5 times [2021-08-31 01:31:41,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:41,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881702659] [2021-08-31 01:31:41,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:41,879 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:41,915 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:41,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881702659] [2021-08-31 01:31:41,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881702659] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:41,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421789449] [2021-08-31 01:31:41,915 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-31 01:31:41,915 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:41,923 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:41,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-08-31 01:31:41,946 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-08-31 01:31:41,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:31:41,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-31 01:31:41,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:42,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:42,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421789449] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:42,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:42,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2021-08-31 01:31:42,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872970446] [2021-08-31 01:31:42,097 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:42,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:42,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1186287651, now seen corresponding path program 1 times [2021-08-31 01:31:42,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:42,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753367891] [2021-08-31 01:31:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:42,098 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:42,102 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:42,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:42,139 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:31:42,139 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:31:42,139 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:31:42,139 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:31:42,139 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 01:31:42,139 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:42,140 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:31:42,140 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:31:42,140 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration6_Loop [2021-08-31 01:31:42,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:31:42,140 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:31:42,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:42,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:42,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:42,202 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:31:42,202 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 01:31:42,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:42,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:42,203 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:42,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:42,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:42,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-08-31 01:31:42,231 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-31 01:31:42,231 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-31 01:31:42,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:42,252 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:42,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:42,253 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:42,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-08-31 01:31:42,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 01:31:42,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:42,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:42,282 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:42,282 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:42,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-08-31 01:31:42,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 01:31:42,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 01:31:42,374 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 01:31:42,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:42,378 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 01:31:42,378 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 01:31:42,378 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 01:31:42,378 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 01:31:42,378 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 01:31:42,378 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:42,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 01:31:42,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 01:31:42,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration6_Loop [2021-08-31 01:31:42,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 01:31:42,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 01:31:42,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:42,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:42,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 01:31:42,462 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 01:31:42,462 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 01:31:42,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:42,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:42,463 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:42,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 01:31:42,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 01:31:42,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 01:31:42,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 01:31:42,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 01:31:42,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 01:31:42,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-08-31 01:31:42,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 01:31:42,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 01:31:42,485 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 01:31:42,487 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 01:31:42,487 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-08-31 01:31:42,487 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 01:31:42,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:42,487 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 01:31:42,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-08-31 01:31:42,489 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 01:31:42,489 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 01:31:42,489 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 01:31:42,489 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0) = 1*ULTIMATE.start_main_~range~0 Supporting invariants [] [2021-08-31 01:31:42,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:42,504 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 01:31:42,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:42,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 01:31:42,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:42,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-31 01:31:42,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 01:31:42,606 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 [2021-08-31 01:31:42,606 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:42,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 71 states and 95 transitions. Complement of second has 6 states. [2021-08-31 01:31:42,629 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 [2021-08-31 01:31:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2021-08-31 01:31:42,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2021-08-31 01:31:42,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:42,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 22 letters. Loop has 6 letters. [2021-08-31 01:31:42,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:42,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 16 letters. Loop has 12 letters. [2021-08-31 01:31:42,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 01:31:42,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 95 transitions. [2021-08-31 01:31:42,631 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-31 01:31:42,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 54 states and 72 transitions. [2021-08-31 01:31:42,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2021-08-31 01:31:42,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-08-31 01:31:42,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 72 transitions. [2021-08-31 01:31:42,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:42,632 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 72 transitions. [2021-08-31 01:31:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 72 transitions. [2021-08-31 01:31:42,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2021-08-31 01:31:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 45 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2021-08-31 01:31:42,638 INFO L704 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2021-08-31 01:31:42,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:42,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-31 01:31:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2021-08-31 01:31:42,640 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:42,706 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2021-08-31 01:31:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-31 01:31:42,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 104 transitions. [2021-08-31 01:31:42,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-31 01:31:42,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 74 states and 90 transitions. [2021-08-31 01:31:42,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-31 01:31:42,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-31 01:31:42,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 90 transitions. [2021-08-31 01:31:42,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:42,709 INFO L681 BuchiCegarLoop]: Abstraction has 74 states and 90 transitions. [2021-08-31 01:31:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 90 transitions. [2021-08-31 01:31:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2021-08-31 01:31:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 69 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2021-08-31 01:31:42,713 INFO L704 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2021-08-31 01:31:42,713 INFO L587 BuchiCegarLoop]: Abstraction has 70 states and 86 transitions. [2021-08-31 01:31:42,713 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-31 01:31:42,713 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 86 transitions. [2021-08-31 01:31:42,714 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-31 01:31:42,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:42,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:42,715 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 9, 2, 1] [2021-08-31 01:31:42,715 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:42,715 INFO L791 eck$LassoCheckResult]: Stem: 1073#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1107#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1105#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1080#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1120#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1119#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1118#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1117#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1116#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1115#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1114#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1113#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1112#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1111#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1110#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1109#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1108#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1103#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1102#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1100#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1098#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1070#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1066#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1127#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1126#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1099#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1084#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1083#L12 [2021-08-31 01:31:42,715 INFO L793 eck$LassoCheckResult]: Loop: 1083#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1083#L12 [2021-08-31 01:31:42,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash 845710779, now seen corresponding path program 6 times [2021-08-31 01:31:42,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:42,716 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376047266] [2021-08-31 01:31:42,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:42,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-31 01:31:42,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:42,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376047266] [2021-08-31 01:31:42,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376047266] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:42,788 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670554765] [2021-08-31 01:31:42,789 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-31 01:31:42,789 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:42,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:42,801 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:42,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2021-08-31 01:31:42,836 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2021-08-31 01:31:42,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:31:42,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-31 01:31:42,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:43,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-08-31 01:31:43,032 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-31 01:31:43,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:43,189 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-08-31 01:31:43,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670554765] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:43,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:43,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2021-08-31 01:31:43,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552849090] [2021-08-31 01:31:43,190 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:43,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:43,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 3 times [2021-08-31 01:31:43,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:43,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606541072] [2021-08-31 01:31:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:43,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:43,195 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:43,198 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:43,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:43,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-31 01:31:43,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=356, Unknown=0, NotChecked=0, Total=600 [2021-08-31 01:31:43,211 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. cyclomatic complexity: 22 Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 24 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:43,377 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2021-08-31 01:31:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-31 01:31:43,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 166 transitions. [2021-08-31 01:31:43,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-31 01:31:43,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 122 states and 138 transitions. [2021-08-31 01:31:43,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-31 01:31:43,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-31 01:31:43,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 138 transitions. [2021-08-31 01:31:43,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:43,381 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 138 transitions. [2021-08-31 01:31:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 138 transitions. [2021-08-31 01:31:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2021-08-31 01:31:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.1355932203389831) internal successors, (134), 117 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 134 transitions. [2021-08-31 01:31:43,385 INFO L704 BuchiCegarLoop]: Abstraction has 118 states and 134 transitions. [2021-08-31 01:31:43,386 INFO L587 BuchiCegarLoop]: Abstraction has 118 states and 134 transitions. [2021-08-31 01:31:43,386 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-31 01:31:43,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 134 transitions. [2021-08-31 01:31:43,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-31 01:31:43,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:43,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:43,393 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [24, 23, 21, 2, 1] [2021-08-31 01:31:43,393 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:43,393 INFO L791 eck$LassoCheckResult]: Stem: 1536#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 1537#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1571#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1569#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1544#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1608#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1607#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1606#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1603#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1602#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1594#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1581#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1580#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1579#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1576#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1575#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1574#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1573#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1567#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1566#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1565#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1564#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 1562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1545#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1538#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1533#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1629#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1628#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1627#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1626#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1624#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1622#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1621#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1620#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1619#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1618#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1616#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1615#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1614#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 1563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 1548#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1547#L12 [2021-08-31 01:31:43,395 INFO L793 eck$LassoCheckResult]: Loop: 1547#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 1546#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 1547#L12 [2021-08-31 01:31:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1251972741, now seen corresponding path program 7 times [2021-08-31 01:31:43,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:43,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14115578] [2021-08-31 01:31:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:43,396 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 352 proven. 360 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-08-31 01:31:43,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:43,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14115578] [2021-08-31 01:31:43,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14115578] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:43,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665763616] [2021-08-31 01:31:43,649 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-08-31 01:31:43,649 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:43,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:43,651 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:43,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-31 01:31:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:43,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjunts are in the unsatisfiable core [2021-08-31 01:31:43,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 352 proven. 360 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-08-31 01:31:44,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 352 proven. 360 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-08-31 01:31:44,356 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665763616] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:44,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:44,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2021-08-31 01:31:44,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320609453] [2021-08-31 01:31:44,357 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:44,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 4 times [2021-08-31 01:31:44,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:44,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450055783] [2021-08-31 01:31:44,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:44,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:44,360 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:44,362 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:44,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-08-31 01:31:44,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=545, Invalid=861, Unknown=0, NotChecked=0, Total=1406 [2021-08-31 01:31:44,375 INFO L87 Difference]: Start difference. First operand 118 states and 134 transitions. cyclomatic complexity: 22 Second operand has 38 states, 38 states have (on average 3.026315789473684) internal successors, (115), 37 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:44,562 INFO L93 Difference]: Finished difference Result 219 states and 235 transitions. [2021-08-31 01:31:44,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-08-31 01:31:44,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 235 transitions. [2021-08-31 01:31:44,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-31 01:31:44,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 185 states and 201 transitions. [2021-08-31 01:31:44,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-08-31 01:31:44,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2021-08-31 01:31:44,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 185 states and 201 transitions. [2021-08-31 01:31:44,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:44,566 INFO L681 BuchiCegarLoop]: Abstraction has 185 states and 201 transitions. [2021-08-31 01:31:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 201 transitions. [2021-08-31 01:31:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2021-08-31 01:31:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 181 states have (on average 1.0883977900552486) internal successors, (197), 180 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2021-08-31 01:31:44,572 INFO L704 BuchiCegarLoop]: Abstraction has 181 states and 197 transitions. [2021-08-31 01:31:44,572 INFO L587 BuchiCegarLoop]: Abstraction has 181 states and 197 transitions. [2021-08-31 01:31:44,572 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-31 01:31:44,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 197 transitions. [2021-08-31 01:31:44,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-08-31 01:31:44,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:44,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:44,575 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [37, 36, 34, 2, 1] [2021-08-31 01:31:44,575 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:44,575 INFO L791 eck$LassoCheckResult]: Stem: 2344#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 2345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2379#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2373#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2349#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2350#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2430#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2429#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2428#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2427#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2426#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2425#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2424#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2423#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2422#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2421#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2420#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2419#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2418#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2417#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2416#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2415#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2412#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2411#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2410#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2409#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2408#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2407#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2406#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2405#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2404#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2403#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2402#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2401#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2400#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2399#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2398#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2396#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2395#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2394#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2393#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2392#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2391#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2390#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2389#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2388#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2387#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2386#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2383#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2382#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2381#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2380#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2375#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2377#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2374#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2372#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2371#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2370#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2342#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2338#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2339#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2475#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2474#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2473#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2472#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2471#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2470#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2469#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2468#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2467#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2466#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2465#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2464#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2463#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2462#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2461#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2460#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2459#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2458#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2457#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2456#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2455#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2454#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2453#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2452#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2451#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2450#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2449#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2447#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2446#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2445#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2444#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2443#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2442#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2441#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2440#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2438#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2437#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2436#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2369#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2355#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2354#L12 [2021-08-31 01:31:44,575 INFO L793 eck$LassoCheckResult]: Loop: 2354#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 2353#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2354#L12 [2021-08-31 01:31:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:44,575 INFO L82 PathProgramCache]: Analyzing trace with hash -458333018, now seen corresponding path program 8 times [2021-08-31 01:31:44,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:44,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082072041] [2021-08-31 01:31:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:44,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:44,597 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:44,622 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1622, now seen corresponding path program 5 times [2021-08-31 01:31:44,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:44,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71263477] [2021-08-31 01:31:44,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:44,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:44,625 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:44,626 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:44,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:44,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1923601851, now seen corresponding path program 1 times [2021-08-31 01:31:44,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:44,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604494146] [2021-08-31 01:31:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:44,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2021-08-31 01:31:44,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:44,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604494146] [2021-08-31 01:31:44,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604494146] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 01:31:44,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 01:31:44,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-31 01:31:44,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720622511] [2021-08-31 01:31:44,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-31 01:31:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-31 01:31:44,683 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. cyclomatic complexity: 22 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:44,694 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2021-08-31 01:31:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-31 01:31:44,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 191 transitions. [2021-08-31 01:31:44,696 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:44,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 131 states and 139 transitions. [2021-08-31 01:31:44,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-31 01:31:44,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-31 01:31:44,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 139 transitions. [2021-08-31 01:31:44,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:44,697 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 139 transitions. [2021-08-31 01:31:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 139 transitions. [2021-08-31 01:31:44,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2021-08-31 01:31:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.0625) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:44,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2021-08-31 01:31:44,700 INFO L704 BuchiCegarLoop]: Abstraction has 128 states and 136 transitions. [2021-08-31 01:31:44,700 INFO L587 BuchiCegarLoop]: Abstraction has 128 states and 136 transitions. [2021-08-31 01:31:44,700 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-31 01:31:44,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 136 transitions. [2021-08-31 01:31:44,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:44,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:44,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:44,702 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [38, 37, 34, 3, 1, 1] [2021-08-31 01:31:44,703 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:44,703 INFO L791 eck$LassoCheckResult]: Stem: 2713#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 2714#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2718#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2710#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2711#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2730#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2731#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2707#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2708#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2833#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2832#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2831#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2830#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2829#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2828#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2827#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2826#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2825#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2824#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2823#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2822#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2821#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2820#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2818#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2817#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2816#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2815#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2814#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2812#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2811#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2810#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2809#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2808#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2807#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2806#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2805#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2804#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2803#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2802#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2800#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2799#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2798#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2797#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2796#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2795#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2794#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2793#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2792#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2791#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2790#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2789#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2788#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2787#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2786#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2785#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2784#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2782#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2783#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2781#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2780#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2779#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2778#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2777#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2775#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2774#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2773#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2772#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2771#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2770#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2769#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2768#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2767#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2766#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2764#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2763#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2762#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2761#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2760#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2759#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2758#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2757#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2756#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2755#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2754#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2753#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2752#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2751#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2750#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2749#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2748#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2747#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2746#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2745#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2744#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2743#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2742#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2741#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2740#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2739#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2738#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2737#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2736#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2733#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2734#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 2732#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2729#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 2728#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 2727#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2724#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 2721#L12-1 [2021-08-31 01:31:44,703 INFO L793 eck$LassoCheckResult]: Loop: 2721#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 2722#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 2721#L12-1 [2021-08-31 01:31:44,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1745209300, now seen corresponding path program 2 times [2021-08-31 01:31:44,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:44,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906903530] [2021-08-31 01:31:44,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:44,704 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 74 proven. 1428 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2021-08-31 01:31:44,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:44,945 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906903530] [2021-08-31 01:31:44,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906903530] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:44,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912459188] [2021-08-31 01:31:44,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-31 01:31:44,946 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:44,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:44,955 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:44,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2021-08-31 01:31:44,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-31 01:31:44,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:31:44,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 20 conjunts are in the unsatisfiable core [2021-08-31 01:31:45,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 74 proven. 1428 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2021-08-31 01:31:45,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 74 proven. 1428 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2021-08-31 01:31:45,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912459188] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:45,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:45,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 39 [2021-08-31 01:31:45,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425561930] [2021-08-31 01:31:45,863 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:45,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 6 times [2021-08-31 01:31:45,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:45,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762052650] [2021-08-31 01:31:45,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:45,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:45,866 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:45,867 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:45,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-08-31 01:31:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=1004, Unknown=0, NotChecked=0, Total=1560 [2021-08-31 01:31:45,879 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. cyclomatic complexity: 12 Second operand has 40 states, 40 states have (on average 3.05) internal successors, (122), 39 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:46,637 INFO L93 Difference]: Finished difference Result 318 states and 328 transitions. [2021-08-31 01:31:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2021-08-31 01:31:46,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 318 states and 328 transitions. [2021-08-31 01:31:46,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:46,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 318 states to 250 states and 260 transitions. [2021-08-31 01:31:46,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-08-31 01:31:46,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-08-31 01:31:46,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 250 states and 260 transitions. [2021-08-31 01:31:46,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:46,642 INFO L681 BuchiCegarLoop]: Abstraction has 250 states and 260 transitions. [2021-08-31 01:31:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states and 260 transitions. [2021-08-31 01:31:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2021-08-31 01:31:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.0413223140495869) internal successors, (252), 241 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 252 transitions. [2021-08-31 01:31:46,647 INFO L704 BuchiCegarLoop]: Abstraction has 242 states and 252 transitions. [2021-08-31 01:31:46,647 INFO L587 BuchiCegarLoop]: Abstraction has 242 states and 252 transitions. [2021-08-31 01:31:46,647 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-31 01:31:46,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 252 transitions. [2021-08-31 01:31:46,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:46,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:46,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:46,651 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [76, 75, 70, 5, 1, 1] [2021-08-31 01:31:46,651 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:46,651 INFO L791 eck$LassoCheckResult]: Stem: 3956#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 3957#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3960#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3961#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3973#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3974#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3951#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4190#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4189#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4188#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4187#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4184#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4183#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4182#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4181#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4180#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4179#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4178#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4177#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4176#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4175#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4174#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4173#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4172#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4171#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4170#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4169#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4168#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4167#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4166#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4165#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4164#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4163#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4162#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4161#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4160#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4159#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4158#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4157#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4156#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4155#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4154#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4153#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4152#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4151#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4150#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4149#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4148#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4147#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4146#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4145#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4144#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4143#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4142#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4141#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4138#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4137#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4136#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4135#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4134#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4133#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4132#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4131#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4130#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4129#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4128#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4127#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4126#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4125#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4124#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4123#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4122#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4121#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4120#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4119#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4118#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4117#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4116#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4115#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4114#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4113#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4112#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4111#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4110#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4109#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4108#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4107#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4106#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4105#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4104#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4103#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4102#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4100#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4099#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4098#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4097#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4096#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4095#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4094#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4093#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4092#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4091#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4090#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4089#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4088#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4087#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4086#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4085#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4084#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4082#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4081#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4080#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4079#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4078#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4077#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4076#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4074#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4073#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4072#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4070#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4069#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4068#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4067#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4066#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4065#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4064#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4063#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4062#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4061#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4060#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4059#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4058#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4057#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4056#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4055#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4054#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4053#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4052#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4051#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4050#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4049#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4048#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4047#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4046#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4045#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4044#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4043#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4042#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4041#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4040#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4039#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4038#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4037#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4036#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4035#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4034#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4033#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4032#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4031#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4030#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4028#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4027#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4025#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 4024#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4023#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4022#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4021#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4020#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4019#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4018#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4017#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4016#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4015#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4014#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4013#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4012#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4011#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4010#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4008#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4007#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4006#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4005#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4004#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4003#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 4002#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 4001#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 4000#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3998#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3997#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3996#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3995#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3994#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3993#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3992#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3991#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3990#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3989#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3988#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3987#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3986#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3985#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3984#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3983#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3982#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3981#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3980#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3979#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3977#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 3975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3972#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 3971#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 3970#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3966#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 3962#L12-1 [2021-08-31 01:31:46,652 INFO L793 eck$LassoCheckResult]: Loop: 3962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 3963#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 3962#L12-1 [2021-08-31 01:31:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 551651832, now seen corresponding path program 3 times [2021-08-31 01:31:46,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:46,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081791902] [2021-08-31 01:31:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:46,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 6525 refuted. 0 times theorem prover too weak. 1950 trivial. 0 not checked. [2021-08-31 01:31:46,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:46,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081791902] [2021-08-31 01:31:46,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081791902] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:46,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589232546] [2021-08-31 01:31:46,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-31 01:31:46,755 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:46,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:46,760 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:46,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2021-08-31 01:31:46,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-08-31 01:31:46,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:31:46,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-31 01:31:46,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 730 proven. 5 refuted. 0 times theorem prover too weak. 7740 trivial. 0 not checked. [2021-08-31 01:31:47,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 730 proven. 5 refuted. 0 times theorem prover too weak. 7740 trivial. 0 not checked. [2021-08-31 01:31:47,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589232546] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:47,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:47,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2021-08-31 01:31:47,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684488162] [2021-08-31 01:31:47,441 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 7 times [2021-08-31 01:31:47,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:47,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735811651] [2021-08-31 01:31:47,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:47,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:47,444 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:47,445 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:47,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:47,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-31 01:31:47,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-08-31 01:31:47,458 INFO L87 Difference]: Start difference. First operand 242 states and 252 transitions. cyclomatic complexity: 16 Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:47,656 INFO L93 Difference]: Finished difference Result 266 states and 281 transitions. [2021-08-31 01:31:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-31 01:31:47,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 281 transitions. [2021-08-31 01:31:47,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:47,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 266 states and 281 transitions. [2021-08-31 01:31:47,659 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-08-31 01:31:47,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-08-31 01:31:47,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 266 states and 281 transitions. [2021-08-31 01:31:47,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:47,659 INFO L681 BuchiCegarLoop]: Abstraction has 266 states and 281 transitions. [2021-08-31 01:31:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states and 281 transitions. [2021-08-31 01:31:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 255. [2021-08-31 01:31:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 255 states have (on average 1.0470588235294118) internal successors, (267), 254 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 267 transitions. [2021-08-31 01:31:47,663 INFO L704 BuchiCegarLoop]: Abstraction has 255 states and 267 transitions. [2021-08-31 01:31:47,663 INFO L587 BuchiCegarLoop]: Abstraction has 255 states and 267 transitions. [2021-08-31 01:31:47,663 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-31 01:31:47,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 267 transitions. [2021-08-31 01:31:47,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:47,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:47,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:47,667 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [78, 77, 71, 6, 1, 1] [2021-08-31 01:31:47,667 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:47,667 INFO L791 eck$LassoCheckResult]: Stem: 5879#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 5880#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5890#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5885#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5884#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5877#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5873#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5874#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6124#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6123#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6122#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6121#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6119#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6114#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6113#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6112#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6108#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6107#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6106#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6104#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6101#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6100#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6099#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6098#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6097#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6095#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6092#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6091#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6090#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6089#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6088#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6086#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6085#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6084#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6083#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6082#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6081#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6080#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6079#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6074#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6075#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6073#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6072#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6071#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6070#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6069#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6068#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6067#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6063#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6059#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6048#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6046#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6041#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6032#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6027#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6026#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6024#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6023#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6022#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6020#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6017#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6018#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6016#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6015#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6014#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 6013#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6011#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6010#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6009#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6008#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6007#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6006#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6005#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6004#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6003#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 6002#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 6001#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 6000#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5999#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5998#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5997#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5996#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5995#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5994#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5993#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5992#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5991#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5990#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5989#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5988#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5987#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5986#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5985#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5984#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5981#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5980#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5978#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5977#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5976#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5975#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5974#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5972#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5971#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5970#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5969#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5968#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5967#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5966#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5965#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5963#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5964#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5962#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5961#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5960#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5959#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5958#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5957#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5956#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5955#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5954#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5953#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5952#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5951#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5950#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5949#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5948#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5947#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5946#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5945#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5944#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5943#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5942#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5941#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5940#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5939#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5937#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5936#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5935#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5934#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5933#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5931#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5930#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5929#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5928#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5927#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5925#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5924#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5923#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5922#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5920#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5919#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5918#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5917#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5916#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5915#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5914#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5912#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5913#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5911#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5910#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5909#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5908#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5907#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 5901#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5905#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 5896#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 5895#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5892#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 5886#L12-1 [2021-08-31 01:31:47,667 INFO L793 eck$LassoCheckResult]: Loop: 5886#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 5887#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 5886#L12-1 [2021-08-31 01:31:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:47,668 INFO L82 PathProgramCache]: Analyzing trace with hash 553165398, now seen corresponding path program 4 times [2021-08-31 01:31:47,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:47,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833128673] [2021-08-31 01:31:47,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:47,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 154 proven. 6828 refuted. 0 times theorem prover too weak. 1950 trivial. 0 not checked. [2021-08-31 01:31:47,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:47,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833128673] [2021-08-31 01:31:47,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833128673] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:47,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095255099] [2021-08-31 01:31:47,775 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-31 01:31:47,775 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:47,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:47,805 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:47,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-08-31 01:31:47,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-31 01:31:47,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:31:47,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-31 01:31:47,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 895 proven. 6657 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2021-08-31 01:31:48,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 861 proven. 6691 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2021-08-31 01:31:49,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095255099] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:49,391 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:49,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 28, 28] total 51 [2021-08-31 01:31:49,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968544154] [2021-08-31 01:31:49,394 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 8 times [2021-08-31 01:31:49,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:49,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041400485] [2021-08-31 01:31:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:49,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:49,396 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:49,397 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:49,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-08-31 01:31:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1849, Unknown=0, NotChecked=0, Total=2550 [2021-08-31 01:31:49,413 INFO L87 Difference]: Start difference. First operand 255 states and 267 transitions. cyclomatic complexity: 19 Second operand has 51 states, 51 states have (on average 3.1372549019607843) internal successors, (160), 51 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:51,783 INFO L93 Difference]: Finished difference Result 1030 states and 1142 transitions. [2021-08-31 01:31:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2021-08-31 01:31:51,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1030 states and 1142 transitions. [2021-08-31 01:31:51,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:51,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1030 states to 982 states and 1094 transitions. [2021-08-31 01:31:51,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-08-31 01:31:51,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-08-31 01:31:51,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 982 states and 1094 transitions. [2021-08-31 01:31:51,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:51,798 INFO L681 BuchiCegarLoop]: Abstraction has 982 states and 1094 transitions. [2021-08-31 01:31:51,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states and 1094 transitions. [2021-08-31 01:31:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 694. [2021-08-31 01:31:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 694 states have (on average 1.1123919308357348) internal successors, (772), 693 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 772 transitions. [2021-08-31 01:31:51,807 INFO L704 BuchiCegarLoop]: Abstraction has 694 states and 772 transitions. [2021-08-31 01:31:51,808 INFO L587 BuchiCegarLoop]: Abstraction has 694 states and 772 transitions. [2021-08-31 01:31:51,808 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-31 01:31:51,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 694 states and 772 transitions. [2021-08-31 01:31:51,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:51,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:51,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:51,813 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [95, 94, 83, 11, 1, 1] [2021-08-31 01:31:51,813 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:51,814 INFO L791 eck$LassoCheckResult]: Stem: 9037#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 9038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9044#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9033#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9043#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9029#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9448#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9447#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9446#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9445#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9444#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9443#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9442#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9441#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9440#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9439#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9438#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9437#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9436#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9435#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9434#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9433#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9431#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9430#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9429#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9428#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9427#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9426#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9425#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9424#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9423#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9422#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9421#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9420#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9419#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9418#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9417#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9416#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9415#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9414#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9413#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9412#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9411#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9410#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9409#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9408#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9407#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9406#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9405#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9404#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9403#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9402#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9401#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9400#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9399#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9398#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9396#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9395#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9394#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9393#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9392#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9391#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9390#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9389#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9388#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9387#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9386#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9385#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9384#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9383#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9382#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9381#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9380#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9379#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9378#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9377#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9376#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9375#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9374#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9373#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9372#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9371#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9370#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9369#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9368#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9367#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9366#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9365#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9364#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9363#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9362#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9361#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9360#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9359#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9358#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9357#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9356#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9355#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9354#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9353#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9352#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9351#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9350#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9349#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9348#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9347#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9346#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9345#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9344#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9343#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9342#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9341#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9340#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9338#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9337#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9336#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9335#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9334#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9333#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9332#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9331#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9330#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9329#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9328#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9327#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9326#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9325#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9324#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9323#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9322#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9321#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9320#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9319#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9318#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9317#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9316#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9315#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9314#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9313#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9312#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9311#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9310#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9309#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9308#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9305#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9304#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9303#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9302#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9301#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9300#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9299#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9298#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9297#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9296#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9295#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9294#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9293#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9292#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9291#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9290#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9289#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9288#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9287#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9286#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9285#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9283#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9282#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9281#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9278#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9261#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9259#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9255#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9253#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9249#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9247#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9241#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9239#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9237#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9235#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9233#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9229#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9227#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9206#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9223#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9221#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9219#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9199#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9197#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9193#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9194#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9156#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9209#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9186#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9185#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9147#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9143#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9140#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9139#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9138#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9136#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9135#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9133#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9131#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9129#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9115#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9110#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9109#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9107#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9106#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9105#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9103#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9097#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9095#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9094#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9093#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9092#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9089#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9087#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9088#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9090#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9082#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9081#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9077#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9075#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9078#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9076#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9069#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9068#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9066#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9065#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9058#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9064#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9061#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9060#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9059#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9054#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 9055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 9051#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 9050#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9045#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 9047#L12-1 [2021-08-31 01:31:51,814 INFO L793 eck$LassoCheckResult]: Loop: 9047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 9049#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 9047#L12-1 [2021-08-31 01:31:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash -298579703, now seen corresponding path program 5 times [2021-08-31 01:31:51,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:51,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436314987] [2021-08-31 01:31:51,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:51,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:52,069 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 5787 proven. 5686 refuted. 0 times theorem prover too weak. 1828 trivial. 0 not checked. [2021-08-31 01:31:52,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:52,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436314987] [2021-08-31 01:31:52,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436314987] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:52,069 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355011384] [2021-08-31 01:31:52,069 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-08-31 01:31:52,069 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:52,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:52,075 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:52,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-08-31 01:31:52,210 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 73 check-sat command(s) [2021-08-31 01:31:52,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:31:52,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 25 conjunts are in the unsatisfiable core [2021-08-31 01:31:52,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 7724 proven. 317 refuted. 0 times theorem prover too weak. 5260 trivial. 0 not checked. [2021-08-31 01:31:52,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 7724 proven. 317 refuted. 0 times theorem prover too weak. 5260 trivial. 0 not checked. [2021-08-31 01:31:53,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355011384] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:53,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:53,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 25] total 44 [2021-08-31 01:31:53,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035793518] [2021-08-31 01:31:53,419 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 9 times [2021-08-31 01:31:53,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:53,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700825708] [2021-08-31 01:31:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:53,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:53,421 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:53,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:53,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:53,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-31 01:31:53,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=1381, Unknown=0, NotChecked=0, Total=1892 [2021-08-31 01:31:53,442 INFO L87 Difference]: Start difference. First operand 694 states and 772 transitions. cyclomatic complexity: 84 Second operand has 44 states, 44 states have (on average 3.227272727272727) internal successors, (142), 44 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:54,562 INFO L93 Difference]: Finished difference Result 1421 states and 1532 transitions. [2021-08-31 01:31:54,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2021-08-31 01:31:54,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1421 states and 1532 transitions. [2021-08-31 01:31:54,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:54,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1421 states to 1303 states and 1414 transitions. [2021-08-31 01:31:54,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-08-31 01:31:54,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-08-31 01:31:54,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1303 states and 1414 transitions. [2021-08-31 01:31:54,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:54,574 INFO L681 BuchiCegarLoop]: Abstraction has 1303 states and 1414 transitions. [2021-08-31 01:31:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states and 1414 transitions. [2021-08-31 01:31:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 607. [2021-08-31 01:31:54,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 607 states have (on average 1.0922570016474464) internal successors, (663), 606 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 663 transitions. [2021-08-31 01:31:54,593 INFO L704 BuchiCegarLoop]: Abstraction has 607 states and 663 transitions. [2021-08-31 01:31:54,593 INFO L587 BuchiCegarLoop]: Abstraction has 607 states and 663 transitions. [2021-08-31 01:31:54,593 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-31 01:31:54,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 663 transitions. [2021-08-31 01:31:54,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:54,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:54,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:54,601 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [131, 130, 115, 15, 1, 1] [2021-08-31 01:31:54,601 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:54,601 INFO L791 eck$LassoCheckResult]: Stem: 13074#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 13075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13083#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13070#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13080#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13066#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13626#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13624#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13623#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13622#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13621#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13620#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13619#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13618#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13617#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13616#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13615#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13614#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13613#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13612#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13611#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13610#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13609#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13608#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13607#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13605#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13604#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13603#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13602#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13601#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13600#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13599#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13598#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13597#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13596#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13595#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13594#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13593#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13592#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13591#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13590#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13589#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13588#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13587#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13586#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13585#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13584#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13583#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13582#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13581#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13580#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13579#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13578#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13577#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13575#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13576#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13574#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13573#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13572#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13571#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13570#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13569#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13568#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13567#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13566#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13565#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13564#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13563#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13562#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13561#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13560#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13559#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13558#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13557#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13556#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13555#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13554#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13553#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13552#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13551#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13550#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13549#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13548#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13547#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13546#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13545#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13544#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13543#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13542#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13541#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13540#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13539#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13538#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13537#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13536#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13535#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13534#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13533#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13532#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13531#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13530#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13529#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13528#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13527#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13526#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13525#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13524#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13523#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13522#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13521#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13520#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13518#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13519#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13517#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13516#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13515#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13514#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13513#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13512#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13511#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13510#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13509#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13508#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13507#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13506#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13505#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13504#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13503#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13502#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13501#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13500#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13499#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13498#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13497#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13496#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13495#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13494#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13493#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13492#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13491#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13490#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13489#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13488#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13487#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13486#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13485#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13484#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13483#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13482#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13481#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13480#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13479#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13478#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13477#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13476#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13475#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13474#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13473#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13472#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13471#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13470#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13469#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13468#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13467#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13466#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13464#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13465#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13462#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13463#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13668#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13667#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13666#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13665#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13664#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13663#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13662#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13661#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13660#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13659#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13657#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13656#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13655#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13654#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13653#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13652#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13651#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13650#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13649#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13648#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13647#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13646#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13645#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13644#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13643#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13642#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13641#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13640#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13639#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13637#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13430#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13429#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13428#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13427#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13426#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13425#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13424#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13423#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13422#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13421#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13420#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13419#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13418#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13417#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13416#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13415#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13355#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13407#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13461#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13460#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13459#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13458#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13457#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13456#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13455#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13454#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13453#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13452#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13451#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13450#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13449#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13448#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13447#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13446#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13445#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13444#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13443#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13442#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13441#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13440#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13439#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13438#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13437#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13436#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13435#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13434#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13433#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13307#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13431#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13432#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13078#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13079#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13350#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13324#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13321#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13320#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13319#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13318#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13317#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13315#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13316#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13332#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13309#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13305#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13304#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13303#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13302#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13301#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13300#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13299#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13298#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13297#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13296#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13295#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13289#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13288#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13286#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13284#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13283#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13281#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13282#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13278#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13277#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13276#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13275#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13274#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13273#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13272#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13271#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13270#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13269#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13268#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13267#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13266#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13265#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13261#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13259#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13258#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13254#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13253#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13252#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13251#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13250#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13249#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13248#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13247#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13246#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13245#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13244#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13243#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13242#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13241#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13239#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13238#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13236#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13237#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13231#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13229#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13226#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13186#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13182#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13180#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13178#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13176#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13174#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13172#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13169#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13167#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13165#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13127#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13153#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13151#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13150#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13149#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13147#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13146#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13144#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13143#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13142#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13141#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13132#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13130#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13111#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13128#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13126#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13125#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13124#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13123#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13122#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13121#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13120#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13119#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13118#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13117#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13102#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13109#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13108#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13107#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13105#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13096#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13103#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13101#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13100#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13099#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13098#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13097#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13094#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 13093#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13091#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 13090#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 13089#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13084#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 13086#L12-1 [2021-08-31 01:31:54,602 INFO L793 eck$LassoCheckResult]: Loop: 13086#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 13088#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 13086#L12-1 [2021-08-31 01:31:54,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:54,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1976719553, now seen corresponding path program 6 times [2021-08-31 01:31:54,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:54,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508294345] [2021-08-31 01:31:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:54,603 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 25415 backedges. 12928 proven. 8663 refuted. 0 times theorem prover too weak. 3824 trivial. 0 not checked. [2021-08-31 01:31:54,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:54,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508294345] [2021-08-31 01:31:54,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508294345] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:54,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792095119] [2021-08-31 01:31:54,948 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-08-31 01:31:54,948 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:54,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:54,950 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:54,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2021-08-31 01:31:55,067 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 81 check-sat command(s) [2021-08-31 01:31:55,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:31:55,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-31 01:31:55,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:55,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25415 backedges. 8831 proven. 411 refuted. 0 times theorem prover too weak. 16173 trivial. 0 not checked. [2021-08-31 01:31:55,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 25415 backedges. 8831 proven. 411 refuted. 0 times theorem prover too weak. 16173 trivial. 0 not checked. [2021-08-31 01:31:56,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792095119] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:56,228 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:56,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 14] total 37 [2021-08-31 01:31:56,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710802587] [2021-08-31 01:31:56,229 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:56,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 10 times [2021-08-31 01:31:56,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:56,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80646583] [2021-08-31 01:31:56,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:56,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:56,232 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:56,233 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:56,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:56,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-31 01:31:56,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2021-08-31 01:31:56,251 INFO L87 Difference]: Start difference. First operand 607 states and 663 transitions. cyclomatic complexity: 62 Second operand has 37 states, 37 states have (on average 3.2972972972972974) internal successors, (122), 37 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:31:57,774 INFO L93 Difference]: Finished difference Result 686 states and 727 transitions. [2021-08-31 01:31:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-08-31 01:31:57,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 686 states and 727 transitions. [2021-08-31 01:31:57,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:57,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 686 states to 638 states and 678 transitions. [2021-08-31 01:31:57,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-08-31 01:31:57,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2021-08-31 01:31:57,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 638 states and 678 transitions. [2021-08-31 01:31:57,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:31:57,780 INFO L681 BuchiCegarLoop]: Abstraction has 638 states and 678 transitions. [2021-08-31 01:31:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states and 678 transitions. [2021-08-31 01:31:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 432. [2021-08-31 01:31:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 432 states have (on average 1.0277777777777777) internal successors, (444), 431 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:31:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 444 transitions. [2021-08-31 01:31:57,785 INFO L704 BuchiCegarLoop]: Abstraction has 432 states and 444 transitions. [2021-08-31 01:31:57,785 INFO L587 BuchiCegarLoop]: Abstraction has 432 states and 444 transitions. [2021-08-31 01:31:57,785 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-31 01:31:57,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 432 states and 444 transitions. [2021-08-31 01:31:57,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:31:57,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:31:57,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:31:57,792 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [140, 140, 125, 15, 1] [2021-08-31 01:31:57,792 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:31:57,793 INFO L791 eck$LassoCheckResult]: Stem: 16931#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 16932#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16936#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16937#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16938#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16982#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16929#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16926#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16927#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17356#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17355#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17354#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17353#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17352#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17351#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17350#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17349#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17348#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17347#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17346#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17345#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17344#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17343#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17342#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17341#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17340#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17339#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17338#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17337#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17336#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17335#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17334#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17333#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17332#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17331#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17330#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17329#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17328#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17327#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17326#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17325#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17324#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17323#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17322#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17321#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17320#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17319#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17318#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17317#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17316#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17315#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17314#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17313#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17312#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17311#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17310#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17309#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17308#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17307#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17305#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17306#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17304#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17303#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17302#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17301#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17300#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17299#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17298#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17297#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17296#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17295#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17294#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17293#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17292#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17291#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17290#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17289#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17288#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17287#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17286#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17285#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17284#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17283#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17282#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17281#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17280#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17279#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17278#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17277#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17276#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17275#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17272#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17258#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17255#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17254#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17253#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17252#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17248#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17249#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17247#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17245#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17244#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17243#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17242#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17241#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17240#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17239#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17238#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17237#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17236#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17235#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17234#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17233#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17232#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17231#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17230#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17229#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17228#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17227#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17226#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17225#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17224#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17223#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17222#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17221#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17220#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17219#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17218#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17217#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17216#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17215#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17212#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17211#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17210#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17209#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17208#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17207#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17206#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17204#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17203#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17201#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17200#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17199#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17197#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17196#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17194#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17195#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17191#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17178#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17177#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17176#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17175#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17174#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17173#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17172#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17171#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17170#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17169#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17168#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17167#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17166#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17165#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17164#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17163#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17162#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17161#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17160#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17159#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17158#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17157#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17156#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17155#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17154#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17153#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17152#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17151#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17150#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17149#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17148#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17147#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17146#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17145#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17109#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17141#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17140#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17139#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17138#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17137#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17136#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17135#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17134#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17133#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17132#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17131#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17130#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17129#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17128#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17127#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17126#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17125#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17124#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17123#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17122#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17121#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17120#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17119#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17118#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17117#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17116#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17115#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17114#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17113#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17112#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17111#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17110#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17108#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17107#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17106#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17105#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17104#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17103#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17102#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17100#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17099#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17098#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17097#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17096#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17095#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17094#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17093#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17092#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17091#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17090#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17089#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17088#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17087#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17086#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17085#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17084#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17083#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17082#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17081#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17080#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17078#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17077#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17076#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17074#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17073#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17072#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17071#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17070#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17069#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17068#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17067#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17066#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17065#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17064#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17063#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17062#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17061#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17060#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17059#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17058#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17057#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17056#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17055#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17054#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17028#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17053#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17051#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17050#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17049#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17048#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17047#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17046#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17045#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17044#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17043#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17042#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17041#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17040#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17039#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17038#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17037#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17036#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17035#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17034#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17033#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17032#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17031#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17030#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17007#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17027#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17026#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17025#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17024#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17023#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17022#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17021#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17020#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17019#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17018#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17017#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17016#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17015#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17014#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17013#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17012#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17011#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17010#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17009#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16987#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17008#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17006#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17005#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17004#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 17003#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 17002#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 17001#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 17000#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16999#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16998#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16997#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16996#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16995#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16994#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16993#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16992#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16991#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16990#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16989#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16986#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16985#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16984#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16983#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16981#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16980#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16979#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16978#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16977#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16976#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16975#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16974#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16973#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16972#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16971#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16970#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16969#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16968#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16967#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16966#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16965#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16964#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16963#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16962#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16961#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16960#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16959#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16958#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16957#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16956#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16955#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16954#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16953#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16952#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16951#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16950#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16949#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16948#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16947#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16946#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16945#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16944#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 16943#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16942#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 16941#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 16940#L12-1 [2021-08-31 01:31:57,793 INFO L793 eck$LassoCheckResult]: Loop: 16940#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 16939#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 16940#L12-1 [2021-08-31 01:31:57,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:57,793 INFO L82 PathProgramCache]: Analyzing trace with hash -843670626, now seen corresponding path program 9 times [2021-08-31 01:31:57,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:57,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71157093] [2021-08-31 01:31:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:57,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:31:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 29190 backedges. 13932 proven. 9015 refuted. 0 times theorem prover too weak. 6243 trivial. 0 not checked. [2021-08-31 01:31:58,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:31:58,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71157093] [2021-08-31 01:31:58,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71157093] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:31:58,020 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886236176] [2021-08-31 01:31:58,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-31 01:31:58,020 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:31:58,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:31:58,022 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:31:58,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2021-08-31 01:31:58,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 117 check-sat command(s) [2021-08-31 01:31:58,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:31:58,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 27 conjunts are in the unsatisfiable core [2021-08-31 01:31:58,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:31:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 29190 backedges. 14745 proven. 8053 refuted. 0 times theorem prover too weak. 6392 trivial. 0 not checked. [2021-08-31 01:31:59,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:31:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 29190 backedges. 14745 proven. 8053 refuted. 0 times theorem prover too weak. 6392 trivial. 0 not checked. [2021-08-31 01:31:59,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886236176] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:31:59,771 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:31:59,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 25] total 44 [2021-08-31 01:31:59,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752677733] [2021-08-31 01:31:59,772 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:31:59,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:31:59,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 11 times [2021-08-31 01:31:59,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:31:59,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132692750] [2021-08-31 01:31:59,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:31:59,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:31:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:59,774 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:31:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:31:59,775 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:31:59,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:31:59,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-08-31 01:31:59,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=1556, Unknown=0, NotChecked=0, Total=1892 [2021-08-31 01:31:59,799 INFO L87 Difference]: Start difference. First operand 432 states and 444 transitions. cyclomatic complexity: 18 Second operand has 44 states, 44 states have (on average 3.409090909090909) internal successors, (150), 44 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:32:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:32:03,555 INFO L93 Difference]: Finished difference Result 744 states and 780 transitions. [2021-08-31 01:32:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2021-08-31 01:32:03,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 744 states and 780 transitions. [2021-08-31 01:32:03,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:32:03,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 744 states to 709 states and 745 transitions. [2021-08-31 01:32:03,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-08-31 01:32:03,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-08-31 01:32:03,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 709 states and 745 transitions. [2021-08-31 01:32:03,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:32:03,561 INFO L681 BuchiCegarLoop]: Abstraction has 709 states and 745 transitions. [2021-08-31 01:32:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states and 745 transitions. [2021-08-31 01:32:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 612. [2021-08-31 01:32:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 612 states have (on average 1.0310457516339868) internal successors, (631), 611 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:32:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 631 transitions. [2021-08-31 01:32:03,568 INFO L704 BuchiCegarLoop]: Abstraction has 612 states and 631 transitions. [2021-08-31 01:32:03,568 INFO L587 BuchiCegarLoop]: Abstraction has 612 states and 631 transitions. [2021-08-31 01:32:03,569 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-31 01:32:03,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 612 states and 631 transitions. [2021-08-31 01:32:03,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:32:03,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:32:03,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:32:03,573 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [161, 161, 144, 17, 1] [2021-08-31 01:32:03,573 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:32:03,574 INFO L791 eck$LassoCheckResult]: Stem: 21018#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 21019#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21021#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21022#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21067#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21016#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21012#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21618#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21617#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21616#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21615#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21614#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21613#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21612#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21611#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21610#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21609#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21608#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21607#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21606#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21605#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21603#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21602#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21600#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21599#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21598#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21597#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21595#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21594#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21593#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21592#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21591#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21589#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21588#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21587#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21586#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21585#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21584#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21583#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21582#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21581#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21580#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21579#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21578#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21577#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21576#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21575#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21574#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21573#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21572#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21571#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21570#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21569#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21567#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21568#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21566#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21565#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21564#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21563#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21562#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21561#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21560#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21559#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21558#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21557#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21556#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21555#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21554#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21553#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21552#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21551#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21550#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21549#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21548#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21547#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21546#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21545#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21544#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21543#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21542#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21541#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21540#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21539#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21538#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21537#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21536#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21535#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21534#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21533#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21532#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21531#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21530#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21529#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21528#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21527#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21526#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21525#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21524#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21523#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21522#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21521#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21520#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21519#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21518#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21517#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21516#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21515#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21514#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21513#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21512#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21510#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21511#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21509#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21508#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21507#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21506#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21505#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21504#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21503#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21502#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21501#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21500#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21499#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21498#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21497#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21496#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21495#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21494#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21493#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21492#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21491#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21490#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21489#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21488#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21487#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21486#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21485#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21484#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21483#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21482#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21481#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21480#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21479#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21478#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21477#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21476#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21475#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21474#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21473#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21472#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21471#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21470#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21469#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21468#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21467#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21466#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21465#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21464#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21463#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21462#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21461#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21460#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21459#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21458#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21456#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21457#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21455#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21454#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21453#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21452#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21451#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21450#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21449#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21448#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21447#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21446#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21445#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21444#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21443#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21442#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21441#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21440#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21439#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21438#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21437#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21436#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21435#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21434#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21433#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21432#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21431#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21430#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21429#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21428#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21427#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21426#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21425#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21424#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21423#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21422#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21421#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21420#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21419#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21418#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21417#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21416#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21415#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21414#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21413#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21412#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21411#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21410#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21409#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21408#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21407#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21405#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21406#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21404#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21403#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21402#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21401#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21400#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21399#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21398#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21397#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21396#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21395#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21394#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21393#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21392#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21391#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21390#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21389#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21388#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21387#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21386#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21385#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21384#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21383#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21382#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21381#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21380#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21379#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21378#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21377#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21376#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21375#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21374#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21373#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21372#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21371#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21370#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21369#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21368#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21367#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21366#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21365#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21275#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21276#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21274#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21273#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21272#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21271#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21270#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21269#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21268#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21267#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21266#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21265#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21264#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21263#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21262#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21261#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21260#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21259#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21258#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21257#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21256#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21255#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21254#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21253#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21252#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21251#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21250#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21249#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21248#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21247#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21246#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21245#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21244#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21243#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21242#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21240#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21239#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21238#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21237#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21236#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21235#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21234#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21233#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21232#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21231#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21230#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21229#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21228#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21227#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21226#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21225#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21224#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21223#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21222#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21221#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21220#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21219#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21218#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21217#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21216#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21215#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21214#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21213#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21212#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21211#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21209#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21208#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21207#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21206#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21205#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21204#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21203#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21202#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21201#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21200#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21199#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21198#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21197#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21196#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21195#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21194#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21193#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21192#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21191#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21190#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21189#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21188#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21187#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21186#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21185#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21184#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21183#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21182#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21181#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21180#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21179#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21178#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21177#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21176#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21174#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21172#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21170#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21169#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21168#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21166#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21165#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21164#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21163#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21162#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21159#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21157#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21155#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21153#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21151#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21149#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21147#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21145#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21143#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21141#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21137#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21135#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21133#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21131#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21129#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21127#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21125#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21123#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21121#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21119#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21118#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21117#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21116#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21115#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21110#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21109#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21108#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21107#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21106#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21105#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21104#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21103#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21102#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21101#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21100#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21099#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21098#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21097#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21096#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21095#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21094#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21093#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21072#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21092#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21090#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21089#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21088#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21087#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21086#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21085#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21084#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21083#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21082#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21081#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21080#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21079#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21078#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21077#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21076#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21075#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21074#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21073#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21069#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21068#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21065#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21064#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21063#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21062#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21061#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21060#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21059#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21058#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21057#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21056#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21055#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21054#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21053#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21052#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21051#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21050#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21049#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21048#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21047#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21046#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21045#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21044#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21043#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21042#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21041#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21040#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21039#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21038#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21037#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21036#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21035#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21034#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21033#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21032#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21031#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21030#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21029#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 21028#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21027#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 21026#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 21025#L12-1 [2021-08-31 01:32:03,574 INFO L793 eck$LassoCheckResult]: Loop: 21025#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 21024#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 21025#L12-1 [2021-08-31 01:32:03,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:32:03,575 INFO L82 PathProgramCache]: Analyzing trace with hash -2045019703, now seen corresponding path program 10 times [2021-08-31 01:32:03,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:32:03,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746286335] [2021-08-31 01:32:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:32:03,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:32:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 01:32:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 38640 backedges. 18300 proven. 12627 refuted. 0 times theorem prover too weak. 7713 trivial. 0 not checked. [2021-08-31 01:32:03,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 01:32:03,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746286335] [2021-08-31 01:32:03,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746286335] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-31 01:32:03,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94186665] [2021-08-31 01:32:03,848 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-31 01:32:03,848 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-31 01:32:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 01:32:03,853 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-31 01:32:03,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2021-08-31 01:32:03,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-31 01:32:03,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-31 01:32:03,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 1019 conjuncts, 40 conjunts are in the unsatisfiable core [2021-08-31 01:32:03,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 01:32:05,334 INFO L134 CoverageAnalysis]: Checked inductivity of 38640 backedges. 20001 proven. 9591 refuted. 0 times theorem prover too weak. 9048 trivial. 0 not checked. [2021-08-31 01:32:05,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-31 01:32:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 38640 backedges. 19967 proven. 9625 refuted. 0 times theorem prover too weak. 9048 trivial. 0 not checked. [2021-08-31 01:32:06,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94186665] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-31 01:32:06,235 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-08-31 01:32:06,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 40, 40] total 58 [2021-08-31 01:32:06,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62634900] [2021-08-31 01:32:06,235 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 01:32:06,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:32:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 12 times [2021-08-31 01:32:06,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:32:06,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153182293] [2021-08-31 01:32:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:32:06,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:32:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:32:06,237 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:32:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:32:06,238 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:32:06,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 01:32:06,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2021-08-31 01:32:06,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=2646, Unknown=0, NotChecked=0, Total=3306 [2021-08-31 01:32:06,249 INFO L87 Difference]: Start difference. First operand 612 states and 631 transitions. cyclomatic complexity: 26 Second operand has 58 states, 58 states have (on average 3.1379310344827585) internal successors, (182), 58 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:32:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 01:32:11,434 INFO L93 Difference]: Finished difference Result 1359 states and 1411 transitions. [2021-08-31 01:32:11,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2021-08-31 01:32:11,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1359 states and 1411 transitions. [2021-08-31 01:32:11,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:32:11,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1359 states to 1279 states and 1331 transitions. [2021-08-31 01:32:11,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2021-08-31 01:32:11,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2021-08-31 01:32:11,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1331 transitions. [2021-08-31 01:32:11,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-08-31 01:32:11,444 INFO L681 BuchiCegarLoop]: Abstraction has 1279 states and 1331 transitions. [2021-08-31 01:32:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1331 transitions. [2021-08-31 01:32:11,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 642. [2021-08-31 01:32:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 642 states have (on average 1.0264797507788161) internal successors, (659), 641 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 01:32:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 659 transitions. [2021-08-31 01:32:11,452 INFO L704 BuchiCegarLoop]: Abstraction has 642 states and 659 transitions. [2021-08-31 01:32:11,453 INFO L587 BuchiCegarLoop]: Abstraction has 642 states and 659 transitions. [2021-08-31 01:32:11,453 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-31 01:32:11,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 642 states and 659 transitions. [2021-08-31 01:32:11,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-08-31 01:32:11,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 01:32:11,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 01:32:11,458 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [210, 210, 190, 20, 1] [2021-08-31 01:32:11,458 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-31 01:32:11,459 INFO L791 eck$LassoCheckResult]: Stem: 26595#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~range~0;havoc main_~i~0;havoc main_~range~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~range~0 := 20; 26596#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26980#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26978#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26976#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26974#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26971#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26590#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26591#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27227#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27226#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27225#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27224#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27223#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27222#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27221#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27220#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27219#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27218#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27217#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27216#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27215#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27214#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27213#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27212#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27211#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27210#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27209#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27208#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27207#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27206#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27205#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27204#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27203#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27202#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27201#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27200#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27199#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27198#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27197#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27196#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27195#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27194#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27193#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27192#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27191#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27190#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27189#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27188#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27187#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27186#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27185#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27184#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27183#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27182#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27181#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27180#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27179#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27178#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27120#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27177#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27176#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27175#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27174#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 27173#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27172#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27171#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27170#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27169#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27168#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27167#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27166#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27165#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27164#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27163#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27162#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27161#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27160#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27159#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27158#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27157#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27156#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27155#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27154#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27153#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27152#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27151#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27150#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27149#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27148#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27147#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27146#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27145#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27144#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27143#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27142#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27141#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27140#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27139#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27138#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27137#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27136#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27135#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27134#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27133#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27132#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27131#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27130#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27129#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27128#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27127#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27126#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27125#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27124#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27123#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27122#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27066#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27121#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27119#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27118#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27117#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 27116#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27115#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27114#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27113#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27112#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27111#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27110#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27109#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27108#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27107#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27106#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27105#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27104#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27103#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27102#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27101#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27100#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27099#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27098#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27097#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27096#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27095#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27094#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27093#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27092#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27091#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27090#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27089#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27088#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27087#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27086#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27085#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27084#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27083#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27082#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27081#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27080#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27079#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27078#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27077#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27076#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27075#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27074#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27073#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27072#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27071#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27070#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27069#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27068#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26968#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27067#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27065#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27064#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27063#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 27062#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27061#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27060#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27059#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27058#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27057#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27056#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27055#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27054#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27053#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27052#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27051#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27050#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27049#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27048#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27047#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27046#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27045#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27044#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27043#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27042#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27041#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27040#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27039#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27038#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27037#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27036#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27035#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27034#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27033#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27032#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27031#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27030#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27029#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27028#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27027#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27026#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27025#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27024#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27023#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27022#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27021#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27020#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27019#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27018#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27017#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26920#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27016#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26967#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26966#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26965#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26964#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26963#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26962#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26961#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26960#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26959#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26958#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26957#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26956#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26955#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26954#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26953#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26952#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26951#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26950#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26949#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26948#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26947#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26946#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26945#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26944#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26943#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26942#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26941#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26940#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26939#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26938#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26937#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26936#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26935#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26934#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26933#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26932#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26931#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26930#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26929#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26928#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26927#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26926#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26925#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26924#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26923#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26922#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26875#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26921#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26919#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26918#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26917#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26916#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26915#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26914#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26913#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26912#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26911#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26910#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26909#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26908#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26907#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26906#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26905#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26904#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26903#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26902#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26901#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26900#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26899#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26898#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26897#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26896#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26895#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26894#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26893#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26892#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26891#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26890#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26889#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26888#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26887#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26886#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26885#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26884#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26883#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26882#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26881#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26880#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26879#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26878#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26877#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26833#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26876#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26874#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26873#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26872#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26871#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26870#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26869#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26868#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26867#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26866#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26865#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26864#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26863#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26862#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26861#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26860#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26859#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26858#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26857#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26856#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26855#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26854#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26853#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26852#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26851#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26850#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26849#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26848#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26847#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26846#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26845#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26844#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26843#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26842#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26841#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26840#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26839#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26838#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26837#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26836#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26835#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26794#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26834#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26832#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26831#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26830#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26829#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26828#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26827#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26826#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26825#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26824#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26823#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26822#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26821#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26820#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26819#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26818#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26817#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26816#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26815#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26814#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26813#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26812#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26811#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26810#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26809#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26808#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26807#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26806#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26805#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26804#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26803#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26802#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26801#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26800#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26799#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26798#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26797#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26796#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26758#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26795#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26793#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26792#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26791#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26790#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26789#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26788#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26787#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26786#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26785#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26784#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26783#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26782#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26781#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26780#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26779#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26778#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26777#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26776#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26775#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26774#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26773#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26772#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26771#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26770#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26769#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26768#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26767#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26766#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26765#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26764#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26763#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26762#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26761#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26760#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26725#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26759#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26757#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26756#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26755#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26754#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26753#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26752#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26751#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26750#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26749#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26748#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26747#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26746#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26745#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26744#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26743#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26742#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26741#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26740#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26739#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26738#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26737#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26736#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26735#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26734#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26733#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26732#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26731#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26730#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26729#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26728#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26727#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26695#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26726#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26724#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26723#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26722#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26721#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26720#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26719#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26718#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26717#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26716#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26715#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26714#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26713#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26712#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26711#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26710#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26709#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26708#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26707#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26706#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26705#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26704#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26703#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26702#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26701#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26700#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26699#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26698#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26697#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26668#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26696#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26694#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26693#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26692#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26691#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26690#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26689#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26688#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26687#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26686#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26685#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26684#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26683#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26682#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26681#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26680#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26679#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26678#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26677#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26676#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26675#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26674#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26673#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26672#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26671#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26670#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26644#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26669#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26667#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26666#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26665#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26664#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26663#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26662#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26661#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26660#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26659#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26658#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26657#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26656#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26655#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26654#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26653#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26652#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26651#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26650#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26649#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26648#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26647#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26646#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26623#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26645#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26643#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26642#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26641#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26640#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26639#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26638#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26637#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26636#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26635#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26634#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26633#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26632#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26631#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26630#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26629#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26628#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26627#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26626#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26625#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26604#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26624#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26622#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26621#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26620#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26619#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26618#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26617#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26616#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26615#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26614#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26613#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26612#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26611#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26610#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26609#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26608#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26607#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26606#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26605#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26603#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26601#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26597#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26598#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26602#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27015#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27014#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27013#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27012#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27011#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27010#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27009#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27008#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27007#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27006#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 27005#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27004#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27003#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 27002#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 27001#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 27000#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26999#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26998#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26997#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26996#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26995#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26994#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26993#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26992#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26991#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26990#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26989#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26988#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26987#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26986#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26985#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26984#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26983#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26982#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26981#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26979#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26977#L13 assume !(main_~i~0 == main_~range~0);main_~i~0 := 1 + main_~i~0; 26975#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26973#L12 assume !(0 == main_~i~0 && main_~i~0 == main_~range~0); 26969#L13 assume main_~i~0 == main_~range~0;main_~i~0 := 0;main_~range~0 := main_~range~0 - 1; 26970#L12-1 [2021-08-31 01:32:11,459 INFO L793 eck$LassoCheckResult]: Loop: 26970#L12-1 assume !!(0 <= main_~i~0 && main_~i~0 <= main_~range~0); 26972#L12 assume !!(0 == main_~i~0 && main_~i~0 == main_~range~0); 26970#L12-1 [2021-08-31 01:32:11,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:32:11,460 INFO L82 PathProgramCache]: Analyzing trace with hash -397192768, now seen corresponding path program 11 times [2021-08-31 01:32:11,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:32:11,460 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799713086] [2021-08-31 01:32:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:32:11,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:32:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:32:11,616 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:32:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:32:11,779 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:32:11,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:32:11,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1292, now seen corresponding path program 13 times [2021-08-31 01:32:11,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:32:11,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963490419] [2021-08-31 01:32:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:32:11,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:32:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:32:11,782 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:32:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:32:11,783 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:32:11,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 01:32:11,784 INFO L82 PathProgramCache]: Analyzing trace with hash 549839627, now seen corresponding path program 7 times [2021-08-31 01:32:11,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 01:32:11,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186417009] [2021-08-31 01:32:11,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 01:32:11,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 01:32:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:32:11,924 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 01:32:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 01:32:12,046 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 01:32:46,762 WARN L210 SmtUtils]: Spent 34.52s on a formula simplification. DAG size of input: 2131 DAG size of output: 669 [2021-08-31 01:32:46,854 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 01:32:46,855 INFO L158 Benchmark]: Toolchain (without parser) took 68445.95ms. Allocated memory was 65.0MB in the beginning and 339.7MB in the end (delta: 274.7MB). Free memory was 45.5MB in the beginning and 197.9MB in the end (delta: -152.5MB). Peak memory consumption was 247.5MB. Max. memory is 16.1GB. [2021-08-31 01:32:46,856 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory was 45.9MB in the beginning and 45.9MB in the end (delta: 32.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 01:32:46,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.87ms. Allocated memory is still 65.0MB. Free memory was 45.3MB in the beginning and 36.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-08-31 01:32:46,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.87ms. Allocated memory is still 65.0MB. Free memory was 36.8MB in the beginning and 48.2MB in the end (delta: -11.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 01:32:46,856 INFO L158 Benchmark]: Boogie Preprocessor took 14.67ms. Allocated memory is still 65.0MB. Free memory was 48.2MB in the beginning and 47.4MB in the end (delta: 780.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 01:32:46,857 INFO L158 Benchmark]: RCFGBuilder took 164.18ms. Allocated memory is still 65.0MB. Free memory was 47.4MB in the beginning and 40.0MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-08-31 01:32:46,857 INFO L158 Benchmark]: BuchiAutomizer took 68019.72ms. Allocated memory was 65.0MB in the beginning and 339.7MB in the end (delta: 274.7MB). Free memory was 40.0MB in the beginning and 197.9MB in the end (delta: -157.9MB). Peak memory consumption was 244.8MB. Max. memory is 16.1GB. [2021-08-31 01:32:46,858 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 65.0MB. Free memory was 45.9MB in the beginning and 45.9MB in the end (delta: 32.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.87ms. Allocated memory is still 65.0MB. Free memory was 45.3MB in the beginning and 36.8MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.87ms. Allocated memory is still 65.0MB. Free memory was 36.8MB in the beginning and 48.2MB in the end (delta: -11.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.67ms. Allocated memory is still 65.0MB. Free memory was 48.2MB in the beginning and 47.4MB in the end (delta: 780.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 164.18ms. Allocated memory is still 65.0MB. Free memory was 47.4MB in the beginning and 40.0MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 68019.72ms. Allocated memory was 65.0MB in the beginning and 339.7MB in the end (delta: 274.7MB). Free memory was 40.0MB in the beginning and 197.9MB in the end (delta: -157.9MB). Peak memory consumption was 244.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (13 trivial, 3 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function range + -1 * i and consists of 3 locations. One deterministic module has affine ranking function range + -1 * i and consists of 3 locations. One deterministic module has affine ranking function range and consists of 4 locations. One nondeterministic module has affine ranking function range + -1 * i and consists of 3 locations. 13 modules have a trivial ranking function, the largest among these consists of 58 locations. The remainder module has 642 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 01:32:46,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2021-08-31 01:32:47,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2021-08-31 01:32:47,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2021-08-31 01:32:47,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2021-08-31 01:32:47,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-08-31 01:32:47,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2021-08-31 01:32:48,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2021-08-31 01:32:48,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2021-08-31 01:32:48,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2021-08-31 01:32:48,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-08-31 01:32:48,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-08-31 01:32:49,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...