./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 26d01a9c 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 2c8d79b985e49ac5d6f27b4e25f4e3597dadc4ec57e262caec7782b796e874b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 08:58:22,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 08:58:22,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 08:58:22,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 08:58:22,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 08:58:22,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 08:58:22,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 08:58:22,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 08:58:22,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 08:58:22,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 08:58:22,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 08:58:22,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 08:58:22,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 08:58:22,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 08:58:22,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 08:58:22,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 08:58:22,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 08:58:22,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 08:58:22,913 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 08:58:22,915 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 08:58:22,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 08:58:22,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 08:58:22,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 08:58:22,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 08:58:22,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 08:58:22,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 08:58:22,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 08:58:22,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 08:58:22,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 08:58:22,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 08:58:22,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 08:58:22,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 08:58:22,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 08:58:22,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 08:58:22,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 08:58:22,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 08:58:22,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 08:58:22,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 08:58:22,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 08:58:22,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 08:58:22,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 08:58:22,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-18 08:58:22,960 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 08:58:22,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 08:58:22,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 08:58:22,961 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 08:58:22,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 08:58:22,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 08:58:22,963 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 08:58:22,963 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-18 08:58:22,963 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-18 08:58:22,964 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-18 08:58:22,964 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-18 08:58:22,965 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-18 08:58:22,965 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-18 08:58:22,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 08:58:22,965 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 08:58:22,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 08:58:22,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 08:58:22,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-18 08:58:22,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-18 08:58:22,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-18 08:58:22,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 08:58:22,966 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-18 08:58:22,967 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 08:58:22,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-18 08:58:22,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 08:58:22,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 08:58:22,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 08:58:22,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 08:58:22,969 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-18 08:58:22,969 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 -> 2c8d79b985e49ac5d6f27b4e25f4e3597dadc4ec57e262caec7782b796e874b7 [2023-02-18 08:58:23,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 08:58:23,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 08:58:23,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 08:58:23,263 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 08:58:23,263 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 08:58:23,265 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2023-02-18 08:58:24,438 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 08:58:24,642 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 08:58:24,642 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NarrowKonv.c [2023-02-18 08:58:24,647 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d790b57/1d9313d0e17543c5aa75c41287cf0521/FLAG3c8d158e2 [2023-02-18 08:58:24,662 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55d790b57/1d9313d0e17543c5aa75c41287cf0521 [2023-02-18 08:58:24,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 08:58:24,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 08:58:24,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 08:58:24,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 08:58:24,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 08:58:24,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41a9d4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24, skipping insertion in model container [2023-02-18 08:58:24,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,681 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 08:58:24,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 08:58:24,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 08:58:24,840 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 08:58:24,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 08:58:24,863 INFO L208 MainTranslator]: Completed translation [2023-02-18 08:58:24,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24 WrapperNode [2023-02-18 08:58:24,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 08:58:24,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 08:58:24,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 08:58:24,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 08:58:24,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,890 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2023-02-18 08:58:24,890 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 08:58:24,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 08:58:24,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 08:58:24,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 08:58:24,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,907 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 08:58:24,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 08:58:24,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 08:58:24,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 08:58:24,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (1/1) ... [2023-02-18 08:58:24,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:24,940 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) [2023-02-18 08:58:24,959 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 [2023-02-18 08:58:24,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 08:58:24,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 08:58:25,038 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 08:58:25,040 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 08:58:25,108 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 08:58:25,113 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 08:58:25,113 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-18 08:58:25,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:58:25 BoogieIcfgContainer [2023-02-18 08:58:25,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 08:58:25,116 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-18 08:58:25,116 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-18 08:58:25,119 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-18 08:58:25,120 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-18 08:58:25,120 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.02 08:58:24" (1/3) ... [2023-02-18 08:58:25,121 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d751fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.02 08:58:25, skipping insertion in model container [2023-02-18 08:58:25,121 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-18 08:58:25,121 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 08:58:24" (2/3) ... [2023-02-18 08:58:25,121 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d751fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.02 08:58:25, skipping insertion in model container [2023-02-18 08:58:25,122 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-18 08:58:25,122 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:58:25" (3/3) ... [2023-02-18 08:58:25,123 INFO L332 chiAutomizerObserver]: Analyzing ICFG NarrowKonv.c [2023-02-18 08:58:25,165 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-18 08:58:25,165 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-18 08:58:25,165 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-18 08:58:25,165 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-18 08:58:25,166 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-18 08:58:25,166 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-18 08:58:25,166 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-18 08:58:25,166 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-18 08:58:25,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2023-02-18 08:58:25,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-18 08:58:25,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:25,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:25,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-18 08:58:25,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-18 08:58:25,188 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-18 08:58:25,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2023-02-18 08:58:25,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-18 08:58:25,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:25,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:25,189 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-18 08:58:25,190 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-18 08:58:25,195 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 3#L12-1true [2023-02-18 08:58:25,196 INFO L750 eck$LassoCheckResult]: Loop: 3#L12-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9#L12true assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 3#L12-1true [2023-02-18 08:58:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-18 08:58:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:25,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377600906] [2023-02-18 08:58:25,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:25,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,262 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,276 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 1 times [2023-02-18 08:58:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:25,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597617366] [2023-02-18 08:58:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:25,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:25,291 INFO L85 PathProgramCache]: Analyzing trace with hash 925806, now seen corresponding path program 1 times [2023-02-18 08:58:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:25,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801792995] [2023-02-18 08:58:25,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:25,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:25,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:58:25,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801792995] [2023-02-18 08:58:25,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801792995] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 08:58:25,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 08:58:25,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 08:58:25,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433022172] [2023-02-18 08:58:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 08:58:25,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:58:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 08:58:25,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 08:58:25,456 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2023-02-18 08:58:25,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:58:25,509 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2023-02-18 08:58:25,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2023-02-18 08:58:25,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-18 08:58:25,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 8 states and 11 transitions. [2023-02-18 08:58:25,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-18 08:58:25,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-18 08:58:25,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2023-02-18 08:58:25,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-18 08:58:25,515 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-18 08:58:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2023-02-18 08:58:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-18 08:58:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) 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) [2023-02-18 08:58:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2023-02-18 08:58:25,561 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-18 08:58:25,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 08:58:25,564 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2023-02-18 08:58:25,565 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-18 08:58:25,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2023-02-18 08:58:25,565 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-18 08:58:25,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:25,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:25,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-18 08:58:25,566 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-18 08:58:25,581 INFO L748 eck$LassoCheckResult]: Stem: 39#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 40#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 41#L12-1 [2023-02-18 08:58:25,581 INFO L750 eck$LassoCheckResult]: Loop: 41#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 42#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 43#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 41#L12-1 [2023-02-18 08:58:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-18 08:58:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:25,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710070062] [2023-02-18 08:58:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:25,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 1 times [2023-02-18 08:58:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:25,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986955618] [2023-02-18 08:58:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:25,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash 28699757, now seen corresponding path program 1 times [2023-02-18 08:58:25,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:25,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110131547] [2023-02-18 08:58:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:25,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:25,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:25,660 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:25,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:25,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:25,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:25,667 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:58:25,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:25,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:25,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:25,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2023-02-18 08:58:25,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:25,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:25,706 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:25,719 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:25,726 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:25,744 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:25,745 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:58:25,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:25,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:25,750 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) [2023-02-18 08:58:25,752 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 [2023-02-18 08:58:25,753 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:25,753 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:25,776 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:58:25,776 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: [] [2023-02-18 08:58:25,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-18 08:58:25,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:25,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:25,789 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) [2023-02-18 08:58:25,791 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 [2023-02-18 08:58:25,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:25,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:25,811 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:58:25,811 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: [] [2023-02-18 08:58:25,817 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 [2023-02-18 08:58:25,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:25,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:25,820 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) [2023-02-18 08:58:25,822 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 [2023-02-18 08:58:25,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:25,824 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:25,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-02-18 08:58:25,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:25,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:25,857 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) [2023-02-18 08:58:25,858 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 [2023-02-18 08:58:25,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:58:25,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:25,916 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-18 08:58:25,919 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 [2023-02-18 08:58:25,920 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:25,920 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:25,920 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:25,920 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:25,920 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:58:25,920 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:25,921 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:25,921 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:25,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration2_Loop [2023-02-18 08:58:25,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:25,921 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:25,923 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:25,924 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:25,925 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:25,929 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:25,936 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:58:25,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:25,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:25,938 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) [2023-02-18 08:58:25,945 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 [2023-02-18 08:58:25,946 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 [2023-02-18 08:58:25,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:25,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:25,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:25,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:25,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:58:25,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:58:25,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:58:25,975 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 [2023-02-18 08:58:25,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:25,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:25,976 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) [2023-02-18 08:58:25,978 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 [2023-02-18 08:58:25,980 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 [2023-02-18 08:58:25,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:25,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:25,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:25,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:25,989 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:58:25,989 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:58:26,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:58:26,013 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 [2023-02-18 08:58:26,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,015 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) [2023-02-18 08:58:26,016 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 [2023-02-18 08:58:26,018 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 [2023-02-18 08:58:26,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:26,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:58:26,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:26,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:26,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:26,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:58:26,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:58:26,041 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:58:26,045 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-18 08:58:26,045 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-18 08:58:26,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,057 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) [2023-02-18 08:58:26,062 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 [2023-02-18 08:58:26,063 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:58:26,063 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-18 08:58:26,063 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:58:26,064 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-18 08:58:26,068 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 [2023-02-18 08:58:26,070 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-18 08:58:26,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:26,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:26,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:26,121 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 08:58:26,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:26,136 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-18 08:58:26,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-02-18 08:58:26,176 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11 states and 15 transitions. Complement of second has 5 states. [2023-02-18 08:58:26,179 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 [2023-02-18 08:58:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-02-18 08:58:26,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2023-02-18 08:58:26,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 3 letters. [2023-02-18 08:58:26,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:26,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 3 letters. [2023-02-18 08:58:26,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:26,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2023-02-18 08:58:26,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:26,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 15 transitions. [2023-02-18 08:58:26,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-18 08:58:26,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 15 transitions. [2023-02-18 08:58:26,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-18 08:58:26,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-18 08:58:26,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2023-02-18 08:58:26,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:26,187 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-18 08:58:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2023-02-18 08:58:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-02-18 08:58:26,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 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) [2023-02-18 08:58:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2023-02-18 08:58:26,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-18 08:58:26,191 INFO L428 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2023-02-18 08:58:26,191 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-18 08:58:26,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2023-02-18 08:58:26,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2023-02-18 08:58:26,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:26,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:26,193 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-18 08:58:26,193 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-18 08:58:26,194 INFO L748 eck$LassoCheckResult]: Stem: 97#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 98#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 99#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 93#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 95#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 90#L12-1 [2023-02-18 08:58:26,194 INFO L750 eck$LassoCheckResult]: Loop: 90#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 91#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 90#L12-1 [2023-02-18 08:58:26,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash 28699755, now seen corresponding path program 1 times [2023-02-18 08:58:26,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605947520] [2023-02-18 08:58:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:26,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 2 times [2023-02-18 08:58:26,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892878116] [2023-02-18 08:58:26,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1810661142, now seen corresponding path program 1 times [2023-02-18 08:58:26,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212711369] [2023-02-18 08:58:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:26,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:58:26,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212711369] [2023-02-18 08:58:26,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212711369] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:58:26,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81588043] [2023-02-18 08:58:26,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:58:26,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,260 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) [2023-02-18 08:58:26,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 08:58:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:26,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 08:58:26,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:26,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:58:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:26,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81588043] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:58:26,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:58:26,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-02-18 08:58:26,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011669714] [2023-02-18 08:58:26,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:58:26,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:58:26,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 08:58:26,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-02-18 08:58:26,326 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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) [2023-02-18 08:58:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:58:26,362 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-02-18 08:58:26,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2023-02-18 08:58:26,363 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-18 08:58:26,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 28 transitions. [2023-02-18 08:58:26,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-18 08:58:26,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-18 08:58:26,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2023-02-18 08:58:26,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:26,364 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-18 08:58:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2023-02-18 08:58:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-18 08:58:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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) [2023-02-18 08:58:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-02-18 08:58:26,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-18 08:58:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 08:58:26,368 INFO L428 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-02-18 08:58:26,368 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-18 08:58:26,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2023-02-18 08:58:26,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-18 08:58:26,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:26,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:26,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1] [2023-02-18 08:58:26,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-18 08:58:26,369 INFO L748 eck$LassoCheckResult]: Stem: 182#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 183#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 184#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 177#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 185#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 174#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 175#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 179#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 180#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 196#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 195#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 188#L12-1 [2023-02-18 08:58:26,370 INFO L750 eck$LassoCheckResult]: Loop: 188#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 193#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 186#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 188#L12-1 [2023-02-18 08:58:26,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1805445589, now seen corresponding path program 1 times [2023-02-18 08:58:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001658476] [2023-02-18 08:58:26,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 2 times [2023-02-18 08:58:26,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299037886] [2023-02-18 08:58:26,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,390 INFO L85 PathProgramCache]: Analyzing trace with hash -154083067, now seen corresponding path program 2 times [2023-02-18 08:58:26,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398426855] [2023-02-18 08:58:26,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:26,407 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:26,407 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:26,407 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:26,407 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:26,407 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:58:26,407 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,407 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:26,407 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:26,408 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration4_Loop [2023-02-18 08:58:26,408 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:26,408 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:26,409 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,411 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,414 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:26,414 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:58:26,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,417 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) [2023-02-18 08:58:26,422 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 [2023-02-18 08:58:26,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:26,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:26,437 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:58:26,437 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: [] [2023-02-18 08:58:26,445 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 [2023-02-18 08:58:26,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,446 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) [2023-02-18 08:58:26,448 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 [2023-02-18 08:58:26,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:26,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:26,461 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:58:26,462 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: [] [2023-02-18 08:58:26,464 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 [2023-02-18 08:58:26,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,467 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) [2023-02-18 08:58:26,471 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 [2023-02-18 08:58:26,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:26,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:26,489 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 [2023-02-18 08:58:26,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,491 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) [2023-02-18 08:58:26,492 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 [2023-02-18 08:58:26,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:58:26,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:26,529 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-18 08:58:26,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-02-18 08:58:26,533 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:26,533 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:26,533 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:26,533 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:26,533 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:58:26,533 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,533 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:26,533 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:26,533 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration4_Loop [2023-02-18 08:58:26,533 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:26,533 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:26,534 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,538 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,542 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:26,542 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:58:26,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,544 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) [2023-02-18 08:58:26,560 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 [2023-02-18 08:58:26,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:26,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:26,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:26,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:26,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:58:26,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:58:26,597 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 [2023-02-18 08:58:26,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:58:26,609 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 [2023-02-18 08:58:26,613 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 [2023-02-18 08:58:26,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,614 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) [2023-02-18 08:58:26,632 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 [2023-02-18 08:58:26,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:26,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:26,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:26,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:26,642 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:58:26,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:58:26,646 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 [2023-02-18 08:58:26,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:58:26,668 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 [2023-02-18 08:58:26,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,669 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) [2023-02-18 08:58:26,671 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 [2023-02-18 08:58:26,673 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 [2023-02-18 08:58:26,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:26,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:58:26,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:26,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:26,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:26,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:58:26,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:58:26,700 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:58:26,722 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-18 08:58:26,723 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-18 08:58:26,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,727 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) [2023-02-18 08:58:26,733 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 [2023-02-18 08:58:26,734 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:58:26,734 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-18 08:58:26,734 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:58:26,734 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-02-18 08:58:26,743 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 [2023-02-18 08:58:26,744 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-18 08:58:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:26,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:26,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:26,772 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 08:58:26,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:26,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:26,779 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-18 08:58:26,779 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-18 08:58:26,791 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 44 states and 50 transitions. Complement of second has 5 states. [2023-02-18 08:58:26,791 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 [2023-02-18 08:58:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-18 08:58:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-18 08:58:26,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2023-02-18 08:58:26,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:26,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-18 08:58:26,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:26,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 6 letters. [2023-02-18 08:58:26,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:26,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2023-02-18 08:58:26,796 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-18 08:58:26,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 44 transitions. [2023-02-18 08:58:26,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-02-18 08:58:26,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-02-18 08:58:26,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 44 transitions. [2023-02-18 08:58:26,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:26,797 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-02-18 08:58:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 44 transitions. [2023-02-18 08:58:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2023-02-18 08:58:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 33 states have internal predecessors, (40), 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) [2023-02-18 08:58:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-02-18 08:58:26,801 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-02-18 08:58:26,801 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-02-18 08:58:26,801 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-18 08:58:26,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 40 transitions. [2023-02-18 08:58:26,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2023-02-18 08:58:26,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:26,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:26,803 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1] [2023-02-18 08:58:26,803 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2023-02-18 08:58:26,804 INFO L748 eck$LassoCheckResult]: Stem: 311#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 312#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 313#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 307#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 310#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 305#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 306#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 322#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 303#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 304#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 308#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 309#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 335#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 333#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 325#L12-1 [2023-02-18 08:58:26,804 INFO L750 eck$LassoCheckResult]: Loop: 325#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 331#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 323#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 325#L12-1 [2023-02-18 08:58:26,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1972849857, now seen corresponding path program 3 times [2023-02-18 08:58:26,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673960292] [2023-02-18 08:58:26,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:26,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,820 INFO L85 PathProgramCache]: Analyzing trace with hash 40815, now seen corresponding path program 3 times [2023-02-18 08:58:26,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249537579] [2023-02-18 08:58:26,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash 837622447, now seen corresponding path program 4 times [2023-02-18 08:58:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:26,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911074615] [2023-02-18 08:58:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:26,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:26,843 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:26,843 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:26,843 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:26,843 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:26,843 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:58:26,843 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,844 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:26,844 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:26,844 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2023-02-18 08:58:26,844 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:26,844 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:26,845 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,846 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,847 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,850 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:26,850 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:58:26,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,852 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) [2023-02-18 08:58:26,868 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 [2023-02-18 08:58:26,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:26,869 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:26,881 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:58:26,881 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: [] [2023-02-18 08:58:26,885 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 [2023-02-18 08:58:26,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,887 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) [2023-02-18 08:58:26,889 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 [2023-02-18 08:58:26,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:26,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:26,913 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-18 08:58:26,914 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-18 08:58:26,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-18 08:58:26,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,917 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) [2023-02-18 08:58:26,919 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 [2023-02-18 08:58:26,920 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:26,920 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:26,929 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 [2023-02-18 08:58:26,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,931 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) [2023-02-18 08:58:26,933 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 [2023-02-18 08:58:26,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:58:26,934 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:26,969 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-18 08:58:26,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-18 08:58:26,973 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:26,973 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:26,973 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:26,973 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:26,973 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:58:26,974 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,974 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:26,974 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:26,974 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration5_Loop [2023-02-18 08:58:26,974 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:26,974 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:26,975 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,977 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,977 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:26,980 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:26,981 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:58:26,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:26,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:26,982 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) [2023-02-18 08:58:26,992 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 [2023-02-18 08:58:26,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:26,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:26,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:26,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:27,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:58:27,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:58:27,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:58:27,007 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 [2023-02-18 08:58:27,012 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 [2023-02-18 08:58:27,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:27,014 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) [2023-02-18 08:58:27,030 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 [2023-02-18 08:58:27,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:27,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:27,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:27,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:27,041 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 [2023-02-18 08:58:27,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-18 08:58:27,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-18 08:58:27,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-18 08:58:27,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-02-18 08:58:27,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:27,057 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2023-02-18 08:58:27,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-18 08:58:27,065 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 [2023-02-18 08:58:27,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:27,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:58:27,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:27,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-18 08:58:27,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:27,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-18 08:58:27,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:58:27,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:58:27,095 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-02-18 08:58:27,095 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-18 08:58:27,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:27,110 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) [2023-02-18 08:58:27,113 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 [2023-02-18 08:58:27,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:58:27,114 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-18 08:58:27,114 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:58:27,114 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2023-02-18 08:58:27,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-18 08:58:27,124 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-18 08:58:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,151 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,158 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-18 08:58:27,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-18 08:58:27,176 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 44 states and 51 transitions. Complement of second has 5 states. [2023-02-18 08:58:27,181 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 [2023-02-18 08:58:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-18 08:58:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-18 08:58:27,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-18 08:58:27,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:27,184 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,210 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,216 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-18 08:58:27,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-18 08:58:27,229 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 44 states and 51 transitions. Complement of second has 5 states. [2023-02-18 08:58:27,229 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 [2023-02-18 08:58:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-18 08:58:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2023-02-18 08:58:27,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-18 08:58:27,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:27,231 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,259 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,277 INFO L141 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 [2023-02-18 08:58:27,278 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-18 08:58:27,304 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 40 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) Result 57 states and 69 transitions. Complement of second has 4 states. [2023-02-18 08:58:27,305 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 [2023-02-18 08:58:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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) [2023-02-18 08:58:27,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2023-02-18 08:58:27,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 3 letters. [2023-02-18 08:58:27,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:27,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 17 letters. Loop has 3 letters. [2023-02-18 08:58:27,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:27,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 14 letters. Loop has 6 letters. [2023-02-18 08:58:27,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:27,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 69 transitions. [2023-02-18 08:58:27,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-18 08:58:27,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 47 states and 58 transitions. [2023-02-18 08:58:27,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2023-02-18 08:58:27,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-18 08:58:27,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2023-02-18 08:58:27,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:27,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 58 transitions. [2023-02-18 08:58:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2023-02-18 08:58:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2023-02-18 08:58:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 30 states have internal predecessors, (40), 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) [2023-02-18 08:58:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2023-02-18 08:58:27,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-02-18 08:58:27,329 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-02-18 08:58:27,329 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-18 08:58:27,329 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2023-02-18 08:58:27,330 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2023-02-18 08:58:27,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:27,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:27,331 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 1, 1] [2023-02-18 08:58:27,331 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2023-02-18 08:58:27,331 INFO L748 eck$LassoCheckResult]: Stem: 673#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 674#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 675#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 667#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 694#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 664#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 665#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 669#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 670#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 676#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 671#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 672#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 692#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 686#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 685#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 684#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 682#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 680#L12-1 [2023-02-18 08:58:27,331 INFO L750 eck$LassoCheckResult]: Loop: 680#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 681#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 690#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 688#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 689#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 687#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 680#L12-1 [2023-02-18 08:58:27,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1031341869, now seen corresponding path program 5 times [2023-02-18 08:58:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:27,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533724585] [2023-02-18 08:58:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:58:27,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533724585] [2023-02-18 08:58:27,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533724585] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:58:27,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205868490] [2023-02-18 08:58:27,449 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-18 08:58:27,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:58:27,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:27,450 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:58:27,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-02-18 08:58:27,480 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-02-18 08:58:27,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:58:27,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:58:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205868490] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:58:27,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:58:27,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-18 08:58:27,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919833324] [2023-02-18 08:58:27,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:58:27,570 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:58:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:27,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1215871107, now seen corresponding path program 1 times [2023-02-18 08:58:27,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:27,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953231407] [2023-02-18 08:58:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:27,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:27,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:27,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:27,593 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:27,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:27,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:27,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:27,593 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:58:27,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:27,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:27,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration6_Loop [2023-02-18 08:58:27,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:27,594 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:27,595 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:27,596 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:27,597 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:27,604 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:27,604 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:58:27,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:27,616 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) [2023-02-18 08:58:27,618 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:27,618 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:27,628 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 [2023-02-18 08:58:27,644 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 [2023-02-18 08:58:27,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:27,646 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) [2023-02-18 08:58:27,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:58:27,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:27,680 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 [2023-02-18 08:58:27,695 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-18 08:58:27,698 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 [2023-02-18 08:58:27,699 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:27,699 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:27,699 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:27,699 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:27,699 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:58:27,699 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,699 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:27,699 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:27,699 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration6_Loop [2023-02-18 08:58:27,699 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:27,699 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:27,700 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:27,703 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:27,704 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:27,707 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:27,707 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:58:27,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:27,710 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) [2023-02-18 08:58:27,717 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 [2023-02-18 08:58:27,718 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 [2023-02-18 08:58:27,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:27,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:58:27,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:27,725 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-02-18 08:58:27,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:27,730 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2023-02-18 08:58:27,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:58:27,753 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 [2023-02-18 08:58:27,756 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:58:27,760 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 [2023-02-18 08:58:27,761 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-18 08:58:27,761 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-18 08:58:27,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:27,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:27,765 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2023-02-18 08:58:27,774 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:58:27,774 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-18 08:58:27,774 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:58:27,774 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-18 08:58:27,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-18 08:58:27,780 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 [2023-02-18 08:58:27,781 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-18 08:58:27,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,832 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-18 08:58:27,832 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-18 08:58:27,856 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 57 states and 67 transitions. Complement of second has 7 states. [2023-02-18 08:58:27,856 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 [2023-02-18 08:58:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-18 08:58:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2023-02-18 08:58:27,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-18 08:58:27,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:27,861 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:27,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,909 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-18 08:58:27,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-18 08:58:27,942 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 59 states and 70 transitions. Complement of second has 9 states. [2023-02-18 08:58:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2023-02-18 08:58:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-18 08:58:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2023-02-18 08:58:27,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-18 08:58:27,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:27,944 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:27,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:27,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:27,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:27,987 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-18 08:58:27,987 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-18 08:58:28,009 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 73 states and 94 transitions. Complement of second has 6 states. [2023-02-18 08:58:28,010 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 [2023-02-18 08:58:28,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-18 08:58:28,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-18 08:58:28,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-18 08:58:28,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:28,012 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:28,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:28,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:28,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:28,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:28,064 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2023-02-18 08:58:28,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-18 08:58:28,098 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 40 transitions. cyclomatic complexity: 12. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 75 states and 94 transitions. Complement of second has 10 states. [2023-02-18 08:58:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2023-02-18 08:58:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-18 08:58:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2023-02-18 08:58:28,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 17 letters. Loop has 6 letters. [2023-02-18 08:58:28,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:28,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 23 letters. Loop has 6 letters. [2023-02-18 08:58:28,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:28,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 17 letters. Loop has 12 letters. [2023-02-18 08:58:28,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:28,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 94 transitions. [2023-02-18 08:58:28,104 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2023-02-18 08:58:28,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 53 states and 69 transitions. [2023-02-18 08:58:28,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-18 08:58:28,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-02-18 08:58:28,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 69 transitions. [2023-02-18 08:58:28,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:28,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 69 transitions. [2023-02-18 08:58:28,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 69 transitions. [2023-02-18 08:58:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2023-02-18 08:58:28,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 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) [2023-02-18 08:58:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-02-18 08:58:28,109 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-02-18 08:58:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:58:28,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 08:58:28,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2023-02-18 08:58:28,110 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 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) [2023-02-18 08:58:28,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:58:28,171 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2023-02-18 08:58:28,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 90 transitions. [2023-02-18 08:58:28,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-18 08:58:28,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 61 states and 74 transitions. [2023-02-18 08:58:28,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2023-02-18 08:58:28,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2023-02-18 08:58:28,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 74 transitions. [2023-02-18 08:58:28,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:28,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 61 states and 74 transitions. [2023-02-18 08:58:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 74 transitions. [2023-02-18 08:58:28,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2023-02-18 08:58:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 57 states have internal predecessors, (71), 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) [2023-02-18 08:58:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2023-02-18 08:58:28,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-02-18 08:58:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 08:58:28,190 INFO L428 stractBuchiCegarLoop]: Abstraction has 58 states and 71 transitions. [2023-02-18 08:58:28,190 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-18 08:58:28,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 71 transitions. [2023-02-18 08:58:28,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-18 08:58:28,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:28,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:28,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 11, 9, 2, 1, 1] [2023-02-18 08:58:28,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2023-02-18 08:58:28,193 INFO L748 eck$LassoCheckResult]: Stem: 1529#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1530#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 1531#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1552#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1550#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1549#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1547#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1544#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1523#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1524#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1579#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1578#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1577#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1576#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1575#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1574#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1573#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1572#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1571#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1570#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1569#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1543#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1556#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1541#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1542#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1566#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1565#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1564#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1563#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1562#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1561#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1559#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1558#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1557#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1555#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1539#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1540#L12 [2023-02-18 08:58:28,193 INFO L750 eck$LassoCheckResult]: Loop: 1540#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1551#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 1546#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1548#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1545#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1536#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1537#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 1555#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 1539#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1540#L12 [2023-02-18 08:58:28,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:28,193 INFO L85 PathProgramCache]: Analyzing trace with hash -566648130, now seen corresponding path program 6 times [2023-02-18 08:58:28,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:28,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024620702] [2023-02-18 08:58:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 08:58:28,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:58:28,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024620702] [2023-02-18 08:58:28,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024620702] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:58:28,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324474457] [2023-02-18 08:58:28,407 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-18 08:58:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:58:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:28,409 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) [2023-02-18 08:58:28,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-02-18 08:58:28,439 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2023-02-18 08:58:28,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:58:28,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 08:58:28,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 08:58:28,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:58:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 08:58:28,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324474457] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:58:28,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:58:28,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-18 08:58:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721591096] [2023-02-18 08:58:28,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:58:28,616 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:58:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1423235079, now seen corresponding path program 2 times [2023-02-18 08:58:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:28,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123039893] [2023-02-18 08:58:28,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:28,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:28,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:28,639 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:28,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:28,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:28,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:28,640 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-18 08:58:28,640 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:28,640 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:28,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:28,640 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration7_Loop [2023-02-18 08:58:28,640 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:28,640 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:28,641 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:28,644 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:28,644 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:28,645 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:28,657 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:28,658 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-18 08:58:28,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:28,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:28,661 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2023-02-18 08:58:28,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-18 08:58:28,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:28,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-18 08:58:28,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-18 08:58:28,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:28,700 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2023-02-18 08:58:28,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-18 08:58:28,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-18 08:58:28,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-18 08:58:28,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-18 08:58:28,826 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-18 08:58:28,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-02-18 08:58:28,830 INFO L210 LassoAnalysis]: Preferences: [2023-02-18 08:58:28,830 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-18 08:58:28,830 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-18 08:58:28,830 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-18 08:58:28,830 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-18 08:58:28,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:28,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-18 08:58:28,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-18 08:58:28,830 INFO L133 ssoRankerPreferences]: Filename of dumped script: NarrowKonv.c_Iteration7_Loop [2023-02-18 08:58:28,830 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-18 08:58:28,830 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-18 08:58:28,831 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:28,833 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:28,834 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:28,834 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-18 08:58:28,838 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-18 08:58:28,839 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-18 08:58:28,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:28,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:28,844 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2023-02-18 08:58:28,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 [2023-02-18 08:58:28,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-18 08:58:28,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-18 08:58:28,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-18 08:58:28,853 INFO L204 nArgumentSynthesizer]: 8 loop disjuncts [2023-02-18 08:58:28,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-18 08:58:28,867 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-18 08:58:28,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-18 08:58:28,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-18 08:58:28,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-18 08:58:28,908 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-18 08:58:28,908 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-18 08:58:28,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-18 08:58:28,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:28,912 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2023-02-18 08:58:28,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-18 08:58:28,915 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-18 08:58:28,915 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-18 08:58:28,916 INFO L513 LassoAnalysis]: Proved termination. [2023-02-18 08:58:28,916 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-18 08:58:28,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-18 08:58:28,919 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-18 08:58:28,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:28,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:28,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:28,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:28,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:28,984 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-18 08:58:28,984 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:28,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 64 states and 77 transitions. Complement of second has 7 states. [2023-02-18 08:58:28,996 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 [2023-02-18 08:58:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2023-02-18 08:58:28,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 36 letters. Loop has 9 letters. [2023-02-18 08:58:28,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:28,997 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:29,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:29,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:29,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:29,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:29,044 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-18 08:58:29,044 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:29,052 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 64 states and 77 transitions. Complement of second has 7 states. [2023-02-18 08:58:29,054 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 [2023-02-18 08:58:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2023-02-18 08:58:29,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 36 letters. Loop has 9 letters. [2023-02-18 08:58:29,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:29,055 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:29,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:29,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:29,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:29,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:29,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:29,103 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-18 08:58:29,103 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:29,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 107 states and 145 transitions. Complement of second has 8 states. [2023-02-18 08:58:29,118 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 [2023-02-18 08:58:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2023-02-18 08:58:29,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 36 letters. Loop has 9 letters. [2023-02-18 08:58:29,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:29,119 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:29,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:29,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:29,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:29,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:29,168 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-18 08:58:29,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:29,183 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 71 transitions. cyclomatic complexity: 17. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 107 states and 145 transitions. Complement of second has 8 states. [2023-02-18 08:58:29,184 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 [2023-02-18 08:58:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:29,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2023-02-18 08:58:29,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 36 letters. Loop has 9 letters. [2023-02-18 08:58:29,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:29,185 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-18 08:58:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:29,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 08:58:29,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:29,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-18 08:58:29,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 08:58:29,235 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2023-02-18 08:58:29,236 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 58 states and 71 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:29,388 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 58 states and 71 transitions. cyclomatic complexity: 17 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 871 states and 1369 transitions. Complement of second has 176 states 20 powerset states156 rank states. The highest rank that occured is 5 [2023-02-18 08:58:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2023-02-18 08:58:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) [2023-02-18 08:58:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2023-02-18 08:58:29,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 36 letters. Loop has 9 letters. [2023-02-18 08:58:29,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:29,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 45 letters. Loop has 9 letters. [2023-02-18 08:58:29,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:29,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 51 transitions. Stem has 36 letters. Loop has 18 letters. [2023-02-18 08:58:29,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-18 08:58:29,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 871 states and 1369 transitions. [2023-02-18 08:58:29,405 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2023-02-18 08:58:29,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 871 states to 89 states and 113 transitions. [2023-02-18 08:58:29,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-18 08:58:29,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-02-18 08:58:29,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 113 transitions. [2023-02-18 08:58:29,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:29,411 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 113 transitions. [2023-02-18 08:58:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 113 transitions. [2023-02-18 08:58:29,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 53. [2023-02-18 08:58:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 52 states have internal predecessors, (67), 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) [2023-02-18 08:58:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2023-02-18 08:58:29,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 67 transitions. [2023-02-18 08:58:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:58:29,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 08:58:29,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=356, Unknown=0, NotChecked=0, Total=600 [2023-02-18 08:58:29,426 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 25 states, 25 states have (on average 3.04) internal successors, (76), 25 states have internal predecessors, (76), 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) [2023-02-18 08:58:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:58:29,587 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2023-02-18 08:58:29,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 151 transitions. [2023-02-18 08:58:29,589 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:29,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 93 states and 107 transitions. [2023-02-18 08:58:29,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-18 08:58:29,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-02-18 08:58:29,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 107 transitions. [2023-02-18 08:58:29,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:29,590 INFO L218 hiAutomatonCegarLoop]: Abstraction has 93 states and 107 transitions. [2023-02-18 08:58:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 107 transitions. [2023-02-18 08:58:29,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-02-18 08:58:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.1573033707865168) internal successors, (103), 88 states have internal predecessors, (103), 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) [2023-02-18 08:58:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2023-02-18 08:58:29,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 103 transitions. [2023-02-18 08:58:29,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-02-18 08:58:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 08:58:29,598 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 103 transitions. [2023-02-18 08:58:29,598 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-18 08:58:29,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 103 transitions. [2023-02-18 08:58:29,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:29,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:29,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:29,602 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 24, 21, 3, 1, 1] [2023-02-18 08:58:29,602 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-18 08:58:29,602 INFO L748 eck$LassoCheckResult]: Stem: 4152#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 4146#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4148#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4232#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4231#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4230#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4229#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4228#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4227#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4226#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4225#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4224#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4223#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4222#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4221#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4220#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4219#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4218#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4217#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4216#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4215#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4214#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4213#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4212#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4211#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4210#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4209#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4208#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4207#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4206#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4205#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4204#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4203#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4202#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4201#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4200#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4199#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4198#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4197#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4196#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4195#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4194#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4193#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4192#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4190#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4191#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4189#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4188#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4187#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4186#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4185#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4184#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4183#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4182#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4181#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4180#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4179#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4178#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4177#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4176#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4175#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4174#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4173#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4172#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4171#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4170#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4168#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4164#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4161#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4163#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 4160#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4155#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4149#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 4150#L12-1 [2023-02-18 08:58:29,602 INFO L750 eck$LassoCheckResult]: Loop: 4150#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4154#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 4150#L12-1 [2023-02-18 08:58:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1834719871, now seen corresponding path program 7 times [2023-02-18 08:58:29,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:29,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413750170] [2023-02-18 08:58:29,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 316 proven. 510 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 08:58:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:58:30,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413750170] [2023-02-18 08:58:30,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413750170] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:58:30,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460159371] [2023-02-18 08:58:30,155 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-18 08:58:30,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:58:30,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:30,159 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) [2023-02-18 08:58:30,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-02-18 08:58:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:30,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 08:58:30,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 384 proven. 360 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-18 08:58:30,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:58:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 384 proven. 360 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-02-18 08:58:30,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460159371] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:58:30,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:58:30,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 18] total 49 [2023-02-18 08:58:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740199397] [2023-02-18 08:58:30,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:58:30,640 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:58:30,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 3 times [2023-02-18 08:58:30,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:30,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513490437] [2023-02-18 08:58:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:30,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:30,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:30,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:58:30,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-18 08:58:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1753, Unknown=0, NotChecked=0, Total=2352 [2023-02-18 08:58:30,652 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. cyclomatic complexity: 20 Second operand has 49 states, 49 states have (on average 3.1020408163265305) internal successors, (152), 49 states have internal predecessors, (152), 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) [2023-02-18 08:58:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:58:33,296 INFO L93 Difference]: Finished difference Result 1092 states and 1245 transitions. [2023-02-18 08:58:33,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1092 states and 1245 transitions. [2023-02-18 08:58:33,303 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:33,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1092 states to 494 states and 535 transitions. [2023-02-18 08:58:33,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-18 08:58:33,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-18 08:58:33,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 535 transitions. [2023-02-18 08:58:33,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:33,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 494 states and 535 transitions. [2023-02-18 08:58:33,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 535 transitions. [2023-02-18 08:58:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 398. [2023-02-18 08:58:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 398 states have (on average 1.065326633165829) internal successors, (424), 397 states have internal predecessors, (424), 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) [2023-02-18 08:58:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 424 transitions. [2023-02-18 08:58:33,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 398 states and 424 transitions. [2023-02-18 08:58:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2023-02-18 08:58:33,317 INFO L428 stractBuchiCegarLoop]: Abstraction has 398 states and 424 transitions. [2023-02-18 08:58:33,317 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-18 08:58:33,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 424 transitions. [2023-02-18 08:58:33,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:33,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:33,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:33,324 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [127, 127, 112, 15, 1, 1] [2023-02-18 08:58:33,324 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-18 08:58:33,325 INFO L748 eck$LassoCheckResult]: Stem: 6205#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 6206#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 6200#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6202#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6595#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6594#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6593#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6592#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6591#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6590#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6589#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6588#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6587#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6586#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6585#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6584#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6583#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6582#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6581#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6580#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6579#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6578#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6577#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6576#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6575#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6574#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6573#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6572#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6571#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6570#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6569#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6568#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6567#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6566#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6565#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6564#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6563#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6562#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6561#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6560#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6559#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6558#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6557#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6556#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6555#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6554#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6553#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6552#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6551#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6550#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6549#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6548#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6547#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6546#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6545#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6544#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6543#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6542#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6541#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6540#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6538#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6539#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6537#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6536#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6535#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6534#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6533#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6532#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6531#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6530#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6529#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6528#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6527#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6526#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6525#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6524#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6523#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6522#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6521#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6520#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6519#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6518#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6517#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6516#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6515#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6514#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6513#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6512#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6511#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6510#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6509#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6508#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6507#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6506#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6505#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6504#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6503#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6502#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6501#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6500#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6499#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6498#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6497#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6496#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6495#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6494#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6493#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6492#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6452#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6491#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6490#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6489#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6488#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6487#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6486#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6485#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6484#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6483#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6482#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6481#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6480#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6479#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6478#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6477#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6476#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6475#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6474#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6473#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6472#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6471#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6470#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6469#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6468#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6467#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6466#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6465#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6464#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6463#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6462#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6461#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6460#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6459#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6458#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6457#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6456#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6455#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6454#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6416#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6453#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6451#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6450#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6449#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6448#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6447#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6446#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6445#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6444#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6443#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6442#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6441#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6440#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6439#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6438#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6437#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6436#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6435#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6434#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6433#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6432#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6431#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6430#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6429#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6428#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6427#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6426#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6425#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6424#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6423#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6422#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6421#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6420#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6419#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6418#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6383#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6417#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6415#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6414#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6413#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6412#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6411#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6410#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6409#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6408#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6407#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6406#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6405#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6404#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6403#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6402#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6401#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6400#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6399#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6398#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6397#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6396#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6395#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6394#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6393#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6392#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6391#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6390#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6389#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6388#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6387#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6386#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6385#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6353#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6384#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6382#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6381#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6380#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6379#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6378#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6377#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6376#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6375#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6374#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6373#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6372#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6371#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6370#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6369#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6368#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6367#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6366#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6365#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6364#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6363#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6362#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6361#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6360#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6359#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6358#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6357#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6356#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6355#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6326#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6354#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6352#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6351#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6350#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6349#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6348#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6347#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6346#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6345#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6344#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6343#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6342#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6341#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6340#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6339#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6338#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6337#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6336#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6335#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6334#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6333#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6332#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6331#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6330#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6329#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6328#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6302#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6327#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6325#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6324#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6323#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6322#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6321#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6320#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6319#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6318#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6317#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6316#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6315#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6314#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6313#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6312#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6311#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6310#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6309#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6308#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6307#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6306#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6305#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6304#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6281#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6303#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6301#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6300#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6299#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6298#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6297#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6296#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6295#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6294#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6293#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6292#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6291#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6290#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6289#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6288#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6287#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6286#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6285#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6284#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6283#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6263#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6282#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6280#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6279#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6278#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6277#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6276#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6275#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6274#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6273#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6272#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6271#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6270#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6269#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6268#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6267#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6266#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6265#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6248#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6264#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6262#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6261#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6260#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6259#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6258#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6257#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6256#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6255#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6254#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6253#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6252#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6251#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6250#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6236#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6249#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6247#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6246#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6245#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6244#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6243#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6242#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6241#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6240#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6239#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6238#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6227#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6237#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6235#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6234#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6233#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6232#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6231#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6230#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6229#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6215#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6228#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6226#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6225#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6220#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6219#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6218#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6217#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 6214#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6213#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6208#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 6209#L12-1 [2023-02-18 08:58:33,326 INFO L750 eck$LassoCheckResult]: Loop: 6209#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 6212#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 6209#L12-1 [2023-02-18 08:58:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash -758366553, now seen corresponding path program 8 times [2023-02-18 08:58:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:33,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625940719] [2023-02-18 08:58:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 24003 backedges. 11550 proven. 2745 refuted. 0 times theorem prover too weak. 9708 trivial. 0 not checked. [2023-02-18 08:58:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:58:34,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625940719] [2023-02-18 08:58:34,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625940719] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:58:34,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511260245] [2023-02-18 08:58:34,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 08:58:34,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:58:34,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:34,277 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) [2023-02-18 08:58:34,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-02-18 08:58:34,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 08:58:34,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:58:34,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-18 08:58:34,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 24003 backedges. 9990 proven. 1428 refuted. 0 times theorem prover too weak. 12585 trivial. 0 not checked. [2023-02-18 08:58:34,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:58:34,848 INFO L134 CoverageAnalysis]: Checked inductivity of 24003 backedges. 9990 proven. 1428 refuted. 0 times theorem prover too weak. 12585 trivial. 0 not checked. [2023-02-18 08:58:34,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511260245] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:58:34,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:58:34,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 39 [2023-02-18 08:58:34,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486692426] [2023-02-18 08:58:34,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:58:34,850 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:58:34,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:34,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 4 times [2023-02-18 08:58:34,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:34,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909789157] [2023-02-18 08:58:34,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:34,853 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:34,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:58:34,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-18 08:58:34,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=946, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 08:58:34,859 INFO L87 Difference]: Start difference. First operand 398 states and 424 transitions. cyclomatic complexity: 32 Second operand has 39 states, 39 states have (on average 3.1794871794871793) internal successors, (124), 39 states have internal predecessors, (124), 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) [2023-02-18 08:58:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:58:35,484 INFO L93 Difference]: Finished difference Result 544 states and 572 transitions. [2023-02-18 08:58:35,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 544 states and 572 transitions. [2023-02-18 08:58:35,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:35,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 544 states to 520 states and 548 transitions. [2023-02-18 08:58:35,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2023-02-18 08:58:35,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2023-02-18 08:58:35,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 520 states and 548 transitions. [2023-02-18 08:58:35,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:35,490 INFO L218 hiAutomatonCegarLoop]: Abstraction has 520 states and 548 transitions. [2023-02-18 08:58:35,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states and 548 transitions. [2023-02-18 08:58:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 512. [2023-02-18 08:58:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 512 states have (on average 1.0546875) internal successors, (540), 511 states have internal predecessors, (540), 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) [2023-02-18 08:58:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 540 transitions. [2023-02-18 08:58:35,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 512 states and 540 transitions. [2023-02-18 08:58:35,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-02-18 08:58:35,500 INFO L428 stractBuchiCegarLoop]: Abstraction has 512 states and 540 transitions. [2023-02-18 08:58:35,500 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-18 08:58:35,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 512 states and 540 transitions. [2023-02-18 08:58:35,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:35,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:35,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:35,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [165, 165, 148, 17, 1, 1] [2023-02-18 08:58:35,509 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-18 08:58:35,513 INFO L748 eck$LassoCheckResult]: Stem: 9559#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 9560#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 9552#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9554#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9557#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9558#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10060#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10059#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10058#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10057#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10056#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10055#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10054#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10053#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10052#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10051#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10050#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10049#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10048#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10047#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10046#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10045#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10044#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10043#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10042#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10041#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10040#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10039#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10038#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10037#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10036#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10035#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10034#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10033#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10032#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10031#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10030#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10029#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10028#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10027#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10026#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10025#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10024#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10023#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10022#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10021#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10020#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10019#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10018#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10017#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10016#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10015#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10014#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10013#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10012#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10011#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10010#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10009#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10008#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10007#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10005#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10006#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 10004#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10003#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 10002#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 10001#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 10000#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9999#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9998#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9997#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9996#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9995#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9994#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9993#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9992#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9991#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9990#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9989#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9988#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9987#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9986#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9985#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9984#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9983#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9982#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9981#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9980#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9979#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9978#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9977#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9976#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9975#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9974#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9973#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9972#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9971#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9970#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9969#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9968#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9967#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9966#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9965#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9964#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9963#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9962#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9961#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9960#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9959#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9958#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9957#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9956#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9955#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9954#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9953#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9952#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9951#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9950#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9948#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9949#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9947#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9946#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9945#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9944#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9943#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9942#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9941#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9940#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9939#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9938#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9937#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9936#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9935#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9934#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9933#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9932#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9931#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9930#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9929#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9928#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9927#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9926#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9925#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9924#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9923#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9922#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9921#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9920#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9919#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9918#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9917#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9916#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9915#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9914#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9913#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9912#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9911#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9910#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9909#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9908#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9907#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9906#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9905#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9904#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9903#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9902#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9901#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9900#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9899#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9898#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9897#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9896#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9894#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9895#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9893#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9892#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9891#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9890#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9889#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9888#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9887#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9886#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9885#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9884#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9883#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9882#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9881#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9880#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9879#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9878#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9877#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9876#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9875#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9874#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9873#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9872#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9871#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9870#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9869#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9868#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9867#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9866#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9865#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9864#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9863#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9862#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9861#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9860#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9859#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9858#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9857#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9856#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9855#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9854#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9853#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9852#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9851#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9850#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9849#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9848#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9847#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9846#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9845#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9805#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9844#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9843#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9842#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9841#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9840#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9839#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9838#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9837#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9836#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9835#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9834#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9833#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9832#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9831#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9830#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9829#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9828#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9827#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9826#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9825#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9824#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9823#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9822#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9821#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9820#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9819#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9818#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9817#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9816#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9815#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9814#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9813#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9812#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9811#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9810#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9809#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9808#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9807#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9769#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9806#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9804#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9803#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9802#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9801#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9800#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9799#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9798#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9797#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9796#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9795#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9794#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9793#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9792#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9791#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9790#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9789#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9788#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9787#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9786#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9785#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9784#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9783#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9782#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9781#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9780#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9779#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9778#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9777#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9776#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9775#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9774#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9773#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9772#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9771#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9736#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9770#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9768#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9767#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9766#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9765#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9764#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9763#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9762#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9761#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9760#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9759#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9758#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9757#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9756#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9755#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9754#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9753#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9752#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9751#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9750#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9749#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9748#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9747#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9746#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9745#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9744#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9743#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9742#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9741#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9740#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9739#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9738#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9706#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9737#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9735#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9734#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9733#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9732#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9731#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9730#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9729#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9728#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9727#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9726#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9725#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9724#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9723#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9722#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9721#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9720#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9719#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9718#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9717#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9716#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9715#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9714#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9713#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9712#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9711#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9710#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9709#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9708#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9679#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9707#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9705#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9704#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9703#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9702#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9701#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9700#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9699#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9698#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9697#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9696#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9695#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9694#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9693#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9692#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9691#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9690#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9689#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9688#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9687#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9686#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9685#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9684#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9683#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9682#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9681#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9655#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9680#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9678#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9677#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9676#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9675#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9674#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9673#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9672#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9671#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9670#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9669#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9668#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9667#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9666#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9665#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9664#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9663#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9662#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9661#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9660#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9659#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9658#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9657#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9634#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9656#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9654#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9653#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9652#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9651#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9650#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9649#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9648#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9647#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9646#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9645#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9644#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9643#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9642#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9641#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9640#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9639#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9638#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9637#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9636#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9616#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9635#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9633#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9632#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9631#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9630#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9629#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9628#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9627#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9626#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9625#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9624#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9623#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9622#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9621#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9620#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9619#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9618#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9601#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9617#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9615#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9614#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9613#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9612#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9611#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9610#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9609#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9608#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9607#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9606#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9605#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9604#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9603#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9589#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9602#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9600#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9599#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9598#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9597#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9596#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9595#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9594#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9593#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9592#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9591#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9580#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9590#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9588#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9587#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9586#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9585#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9584#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9583#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9582#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9567#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9581#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9579#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9578#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9573#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9572#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9571#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9570#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 9565#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9562#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9555#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 9556#L12-1 [2023-02-18 08:58:35,513 INFO L750 eck$LassoCheckResult]: Loop: 9556#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 9561#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 9556#L12-1 [2023-02-18 08:58:35,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:35,513 INFO L85 PathProgramCache]: Analyzing trace with hash -774011285, now seen corresponding path program 9 times [2023-02-18 08:58:35,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:35,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107045248] [2023-02-18 08:58:35,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:35,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 40590 backedges. 20328 proven. 9534 refuted. 0 times theorem prover too weak. 10728 trivial. 0 not checked. [2023-02-18 08:58:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:58:36,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107045248] [2023-02-18 08:58:36,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107045248] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:58:36,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324655615] [2023-02-18 08:58:36,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 08:58:36,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:58:36,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:36,544 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) [2023-02-18 08:58:36,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-02-18 08:58:36,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 157 check-sat command(s) [2023-02-18 08:58:36,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:58:36,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-18 08:58:37,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 40590 backedges. 19245 proven. 14886 refuted. 0 times theorem prover too weak. 6459 trivial. 0 not checked. [2023-02-18 08:58:37,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:58:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 40590 backedges. 19245 proven. 14886 refuted. 0 times theorem prover too weak. 6459 trivial. 0 not checked. [2023-02-18 08:58:38,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324655615] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:58:38,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:58:38,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29, 29] total 50 [2023-02-18 08:58:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390795758] [2023-02-18 08:58:38,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:58:38,059 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:58:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 5 times [2023-02-18 08:58:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:38,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883595124] [2023-02-18 08:58:38,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:38,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:38,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:38,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:38,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:58:38,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 08:58:38,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=2019, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 08:58:38,067 INFO L87 Difference]: Start difference. First operand 512 states and 540 transitions. cyclomatic complexity: 36 Second operand has 50 states, 50 states have (on average 3.42) internal successors, (171), 50 states have internal predecessors, (171), 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) [2023-02-18 08:58:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:58:43,219 INFO L93 Difference]: Finished difference Result 725 states and 781 transitions. [2023-02-18 08:58:43,219 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 725 states and 781 transitions. [2023-02-18 08:58:43,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:43,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 725 states to 717 states and 773 transitions. [2023-02-18 08:58:43,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-18 08:58:43,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-18 08:58:43,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 717 states and 773 transitions. [2023-02-18 08:58:43,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:43,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 717 states and 773 transitions. [2023-02-18 08:58:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states and 773 transitions. [2023-02-18 08:58:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 602. [2023-02-18 08:58:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 602 states have (on average 1.0498338870431894) internal successors, (632), 601 states have internal predecessors, (632), 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) [2023-02-18 08:58:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 632 transitions. [2023-02-18 08:58:43,235 INFO L240 hiAutomatonCegarLoop]: Abstraction has 602 states and 632 transitions. [2023-02-18 08:58:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2023-02-18 08:58:43,236 INFO L428 stractBuchiCegarLoop]: Abstraction has 602 states and 632 transitions. [2023-02-18 08:58:43,236 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-18 08:58:43,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 602 states and 632 transitions. [2023-02-18 08:58:43,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:43,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:43,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:43,249 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [195, 195, 176, 19, 1, 1] [2023-02-18 08:58:43,249 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-18 08:58:43,250 INFO L748 eck$LassoCheckResult]: Stem: 14251#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 14252#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 14246#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14248#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14845#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14844#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14843#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14842#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14841#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14840#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14839#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14838#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14837#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14836#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14835#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14834#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14833#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14832#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14831#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14830#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14829#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14828#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14827#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14826#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14825#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14824#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14823#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14822#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14821#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14820#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14819#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14818#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14817#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14816#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14815#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14814#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14813#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14812#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14811#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14810#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14809#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14808#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14807#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14806#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14805#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14804#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14803#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14802#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14801#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14800#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14799#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14798#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14797#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14796#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14795#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14794#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14793#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14792#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14791#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14790#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14788#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14789#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14787#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14786#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14785#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14784#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14783#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14782#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14781#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14780#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14779#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14778#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14777#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14776#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14775#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14774#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14773#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14772#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14771#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14770#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14769#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14768#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14767#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14766#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14765#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14764#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14763#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14762#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14761#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14760#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14759#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14758#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14757#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14756#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14755#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14754#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14753#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14752#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14751#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14750#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14749#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14748#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14747#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14746#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14745#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14744#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14743#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14742#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14741#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14740#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14739#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14738#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14737#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14736#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14735#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14734#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14733#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14731#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14732#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14730#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14729#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14728#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14727#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14726#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14725#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14724#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14723#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14722#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14721#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14720#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14719#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14718#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14717#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14716#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14715#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14714#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14713#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14712#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14711#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14710#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14709#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14708#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14707#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14706#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14705#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14704#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14703#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14702#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14701#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14700#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14699#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14698#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14697#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14696#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14695#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14694#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14693#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14692#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14691#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14690#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14689#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14688#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14687#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14686#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14685#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14684#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14683#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14682#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14681#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14680#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14679#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14677#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14678#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14676#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14675#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14674#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14673#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14672#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14671#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14670#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14669#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14668#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14667#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14666#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14665#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14664#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14663#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14662#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14661#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14660#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14659#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14658#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14657#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14656#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14655#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14654#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14653#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14652#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14651#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14650#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14649#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14648#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14647#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14646#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14645#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14644#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14643#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14642#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14641#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14640#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14639#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14638#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14637#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14636#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14635#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14634#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14633#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14632#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14631#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14630#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14629#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14628#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14626#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14627#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14625#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14624#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14623#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14622#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14621#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14620#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14619#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14618#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14617#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14616#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14615#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14614#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14613#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14612#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14611#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14610#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14609#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14608#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14607#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14606#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14605#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14604#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14603#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14602#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14601#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14600#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14599#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14598#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14597#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14596#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14595#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14594#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14593#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14592#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14591#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14590#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14589#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14588#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14587#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14586#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14585#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14584#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14583#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14582#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14581#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14580#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14537#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14579#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14578#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14577#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14576#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14575#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14574#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14573#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14572#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14571#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14570#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14569#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14568#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14567#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14566#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14565#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14564#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14563#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14562#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14561#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14560#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14559#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14558#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14557#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14556#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14555#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14554#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14553#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14552#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14551#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14550#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14549#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14548#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14547#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14546#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14545#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14544#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14543#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14542#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14541#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14540#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14539#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14498#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14538#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14536#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14535#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14534#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14533#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14532#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14531#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14530#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14529#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14528#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14527#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14526#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14525#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14524#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14523#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14522#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14521#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14520#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14519#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14518#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14517#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14516#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14515#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14514#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14513#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14512#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14511#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14510#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14509#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14508#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14507#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14506#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14505#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14504#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14503#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14502#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14501#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14500#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14462#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14499#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14497#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14496#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14495#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14494#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14493#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14492#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14491#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14490#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14489#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14488#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14487#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14486#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14485#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14484#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14483#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14482#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14481#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14480#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14479#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14478#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14477#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14476#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14475#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14474#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14473#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14472#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14471#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14470#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14469#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14468#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14467#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14466#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14465#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14464#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14429#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14463#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14461#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14460#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14459#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14458#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14457#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14456#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14455#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14454#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14453#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14452#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14451#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14450#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14449#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14448#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14447#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14446#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14445#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14444#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14443#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14442#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14441#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14440#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14439#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14438#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14437#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14436#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14435#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14434#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14433#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14432#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14431#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14399#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14430#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14428#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14427#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14426#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14425#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14424#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14423#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14422#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14421#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14420#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14419#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14418#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14417#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14416#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14415#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14414#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14413#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14412#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14411#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14410#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14409#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14408#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14407#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14406#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14405#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14404#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14403#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14402#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14401#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14372#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14400#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14398#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14397#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14396#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14395#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14394#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14393#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14392#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14391#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14390#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14389#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14388#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14387#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14386#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14385#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14384#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14383#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14382#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14381#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14380#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14379#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14378#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14377#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14376#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14375#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14374#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14348#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14373#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14371#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14370#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14369#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14368#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14367#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14366#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14365#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14364#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14363#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14362#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14361#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14360#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14359#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14358#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14357#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14356#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14355#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14354#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14353#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14352#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14351#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14350#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14327#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14349#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14347#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14346#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14345#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14344#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14343#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14342#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14341#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14340#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14339#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14338#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14337#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14336#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14335#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14334#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14333#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14332#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14331#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14330#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14329#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14309#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14328#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14326#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14325#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14324#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14323#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14322#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14321#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14320#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14319#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14318#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14317#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14316#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14315#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14314#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14313#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14312#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14311#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14294#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14310#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14308#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14307#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14306#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14305#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14304#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14303#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14302#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14301#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14300#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14299#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14298#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14297#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14296#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14282#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14295#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14293#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14292#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14291#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14290#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14289#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14288#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14287#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14286#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14285#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14284#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14273#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14283#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14281#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14280#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14279#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14278#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14277#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14276#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14275#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14262#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14274#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14272#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14271#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14268#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14265#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14264#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14263#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 14260#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14258#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14249#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 14244#L12-1 [2023-02-18 08:58:43,250 INFO L750 eck$LassoCheckResult]: Loop: 14244#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 14245#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 14244#L12-1 [2023-02-18 08:58:43,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1097499175, now seen corresponding path program 10 times [2023-02-18 08:58:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:43,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093575153] [2023-02-18 08:58:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 08:58:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 56745 backedges. 28350 proven. 14070 refuted. 0 times theorem prover too weak. 14325 trivial. 0 not checked. [2023-02-18 08:58:44,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 08:58:44,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093575153] [2023-02-18 08:58:44,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093575153] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 08:58:44,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753748379] [2023-02-18 08:58:44,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 08:58:44,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 08:58:44,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 08:58:44,517 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 08:58:44,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-02-18 08:58:44,771 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 08:58:44,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 08:58:44,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 1230 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-18 08:58:44,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 08:58:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 56745 backedges. 29194 proven. 13796 refuted. 0 times theorem prover too weak. 13755 trivial. 0 not checked. [2023-02-18 08:58:45,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 08:58:45,918 INFO L134 CoverageAnalysis]: Checked inductivity of 56745 backedges. 29194 proven. 13796 refuted. 0 times theorem prover too weak. 13755 trivial. 0 not checked. [2023-02-18 08:58:45,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753748379] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 08:58:45,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 08:58:45,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 41, 41] total 56 [2023-02-18 08:58:45,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547357815] [2023-02-18 08:58:45,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 08:58:45,919 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-18 08:58:45,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 6 times [2023-02-18 08:58:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:45,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667589337] [2023-02-18 08:58:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:45,922 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:45,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 08:58:45,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-18 08:58:45,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=601, Invalid=2479, Unknown=0, NotChecked=0, Total=3080 [2023-02-18 08:58:45,930 INFO L87 Difference]: Start difference. First operand 602 states and 632 transitions. cyclomatic complexity: 39 Second operand has 56 states, 56 states have (on average 3.142857142857143) internal successors, (176), 56 states have internal predecessors, (176), 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) [2023-02-18 08:58:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 08:58:51,362 INFO L93 Difference]: Finished difference Result 1365 states and 1437 transitions. [2023-02-18 08:58:51,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1365 states and 1437 transitions. [2023-02-18 08:58:51,368 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:51,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1365 states to 1327 states and 1399 transitions. [2023-02-18 08:58:51,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-02-18 08:58:51,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-02-18 08:58:51,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1327 states and 1399 transitions. [2023-02-18 08:58:51,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-18 08:58:51,373 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1327 states and 1399 transitions. [2023-02-18 08:58:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states and 1399 transitions. [2023-02-18 08:58:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 647. [2023-02-18 08:58:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 647 states have (on average 1.0479134466769706) internal successors, (678), 646 states have internal predecessors, (678), 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) [2023-02-18 08:58:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 678 transitions. [2023-02-18 08:58:51,383 INFO L240 hiAutomatonCegarLoop]: Abstraction has 647 states and 678 transitions. [2023-02-18 08:58:51,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2023-02-18 08:58:51,384 INFO L428 stractBuchiCegarLoop]: Abstraction has 647 states and 678 transitions. [2023-02-18 08:58:51,384 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-18 08:58:51,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 647 states and 678 transitions. [2023-02-18 08:58:51,387 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2023-02-18 08:58:51,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-18 08:58:51,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-18 08:58:51,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [210, 210, 190, 20, 1, 1] [2023-02-18 08:58:51,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-02-18 08:58:51,399 INFO L748 eck$LassoCheckResult]: Stem: 20445#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 20446#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1;havoc main_~i~0#1;havoc main_~range~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20; 20440#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20442#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21084#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21083#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21082#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21081#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21080#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21079#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21078#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21077#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21076#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21075#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21074#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21073#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21072#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21071#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21070#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21069#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21068#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21067#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21066#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21065#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21064#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21063#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21062#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21061#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21060#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21059#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21058#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21057#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21056#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21055#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21054#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21053#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21052#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21051#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21050#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21049#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21048#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21047#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21046#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21045#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21044#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21043#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21042#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21041#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21040#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21039#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21038#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21037#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21036#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21035#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21034#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21033#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21032#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21031#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21030#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21029#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20971#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21028#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21027#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21026#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21025#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 21024#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21023#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21022#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21021#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21020#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21019#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21018#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21017#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21016#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21015#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21014#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21013#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21012#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21011#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21010#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21009#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21008#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21007#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21006#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21005#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21004#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21003#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 21002#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 21001#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 21000#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20999#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20998#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20997#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20996#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20995#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20994#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20993#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20992#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20991#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20990#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20989#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20988#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20987#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20986#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20985#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20984#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20983#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20982#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20981#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20980#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20979#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20978#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20977#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20976#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20975#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20974#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20973#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20917#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20972#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20970#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20969#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20968#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20967#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20966#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20965#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20964#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20963#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20962#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20961#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20960#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20959#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20958#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20957#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20956#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20955#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20954#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20953#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20952#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20951#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20950#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20949#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20948#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20947#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20946#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20945#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20944#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20943#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20942#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20941#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20940#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20939#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20938#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20937#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20936#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20935#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20934#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20933#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20932#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20931#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20930#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20929#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20928#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20927#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20926#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20925#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20924#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20923#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20922#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20921#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20920#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20919#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20866#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20918#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20916#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20915#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20914#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20913#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20912#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20911#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20910#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20909#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20908#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20907#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20906#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20905#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20904#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20903#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20902#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20901#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20900#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20899#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20898#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20897#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20896#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20895#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20894#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20893#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20892#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20891#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20890#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20889#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20888#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20887#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20886#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20885#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20884#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20883#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20882#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20881#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20880#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20879#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20878#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20877#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20876#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20875#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20874#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20873#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20872#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20871#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20870#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20869#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20868#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20818#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20867#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20865#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20864#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20863#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20862#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20861#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20860#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20859#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20858#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20857#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20856#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20855#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20854#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20853#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20852#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20851#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20850#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20849#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20848#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20847#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20846#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20845#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20844#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20843#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20842#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20841#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20840#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20839#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20838#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20837#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20836#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20835#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20834#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20833#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20832#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20831#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20830#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20829#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20828#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20827#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20826#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20825#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20824#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20823#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20822#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20821#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20820#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20773#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20819#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20817#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20816#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20815#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20814#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20813#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20812#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20811#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20810#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20809#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20808#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20807#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20806#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20805#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20804#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20803#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20802#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20801#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20800#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20799#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20798#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20797#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20796#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20795#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20794#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20793#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20792#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20791#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20790#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20789#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20788#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20787#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20786#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20785#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20784#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20783#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20782#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20781#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20780#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20779#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20778#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20777#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20776#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20775#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20731#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20774#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20772#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20771#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20770#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20769#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20768#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20767#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20766#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20765#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20764#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20763#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20762#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20761#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20760#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20759#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20758#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20757#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20756#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20755#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20754#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20753#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20752#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20751#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20750#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20749#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20748#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20747#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20746#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20745#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20744#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20743#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20742#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20741#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20740#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20739#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20738#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20737#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20736#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20735#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20734#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20733#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20692#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20732#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20730#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20729#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20728#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20727#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20726#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20725#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20724#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20723#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20722#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20721#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20720#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20719#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20718#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20717#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20716#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20715#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20714#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20713#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20712#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20711#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20710#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20709#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20708#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20707#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20706#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20705#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20704#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20703#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20702#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20701#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20700#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20699#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20698#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20697#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20696#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20695#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20694#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20656#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20693#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20691#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20690#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20689#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20688#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20687#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20686#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20685#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20684#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20683#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20682#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20681#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20680#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20679#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20678#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20677#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20676#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20675#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20674#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20673#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20672#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20671#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20670#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20669#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20668#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20667#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20666#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20665#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20664#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20663#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20662#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20661#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20660#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20659#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20658#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20623#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20657#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20655#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20654#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20653#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20652#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20651#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20650#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20649#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20648#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20647#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20646#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20645#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20644#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20643#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20642#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20641#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20640#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20639#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20638#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20637#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20636#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20635#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20634#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20633#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20632#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20631#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20630#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20629#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20628#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20627#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20626#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20625#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20593#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20624#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20622#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20621#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20620#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20619#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20618#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20617#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20616#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20615#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20614#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20613#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20612#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20611#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20610#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20609#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20608#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20607#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20606#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20605#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20604#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20603#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20602#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20601#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20600#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20599#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20598#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20597#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20596#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20595#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20566#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20594#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20592#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20591#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20590#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20589#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20588#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20587#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20586#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20585#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20584#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20583#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20582#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20581#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20580#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20579#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20578#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20577#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20576#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20575#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20574#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20573#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20572#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20571#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20570#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20569#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20568#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20542#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20567#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20565#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20564#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20563#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20562#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20561#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20560#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20559#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20558#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20557#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20556#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20555#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20554#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20553#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20552#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20551#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20550#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20549#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20548#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20547#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20546#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20545#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20544#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20521#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20543#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20541#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20540#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20539#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20538#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20537#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20536#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20535#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20534#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20533#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20532#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20531#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20530#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20529#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20528#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20527#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20526#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20525#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20524#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20523#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20503#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20522#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20520#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20519#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20518#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20517#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20516#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20515#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20514#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20513#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20512#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20511#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20510#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20509#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20508#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20507#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20506#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20505#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20488#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20504#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20502#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20501#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20500#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20499#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20498#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20497#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20496#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20495#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20494#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20493#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20492#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20491#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20490#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20476#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20489#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20487#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20486#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20485#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20484#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20483#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20482#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20481#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20480#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20479#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20478#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20467#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20477#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20475#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20474#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20473#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20472#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20471#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20470#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20469#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20456#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20468#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20466#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20465#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20462#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20459#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20458#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20457#L13 assume !(main_~i~0#1 == main_~range~0#1);main_~i~0#1 := 1 + main_~i~0#1; 20454#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20453#L12 assume !(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20448#L13 assume main_~i~0#1 == main_~range~0#1;main_~i~0#1 := 0;main_~range~0#1 := main_~range~0#1 - 1; 20449#L12-1 [2023-02-18 08:58:51,399 INFO L750 eck$LassoCheckResult]: Loop: 20449#L12-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 20452#L12 assume !!(0 == main_~i~0#1 && main_~i~0#1 == main_~range~0#1); 20449#L12-1 [2023-02-18 08:58:51,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -686017405, now seen corresponding path program 11 times [2023-02-18 08:58:51,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:51,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813060487] [2023-02-18 08:58:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:51,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:51,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:51,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:51,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:51,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1324, now seen corresponding path program 7 times [2023-02-18 08:58:51,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:51,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879270068] [2023-02-18 08:58:51,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:51,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:51,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:51,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 08:58:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2132729554, now seen corresponding path program 1 times [2023-02-18 08:58:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 08:58:51,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138483275] [2023-02-18 08:58:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 08:58:51,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 08:58:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:51,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:51,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 08:58:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:54,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 08:58:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 08:58:54,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.02 08:58:54 BoogieIcfgContainer [2023-02-18 08:58:54,509 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-18 08:58:54,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 08:58:54,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 08:58:54,510 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 08:58:54,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 08:58:25" (3/4) ... [2023-02-18 08:58:54,513 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-18 08:58:54,637 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-18 08:58:54,637 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 08:58:54,638 INFO L158 Benchmark]: Toolchain (without parser) took 29971.51ms. Allocated memory was 123.7MB in the beginning and 474.0MB in the end (delta: 350.2MB). Free memory was 93.5MB in the beginning and 378.0MB in the end (delta: -284.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2023-02-18 08:58:54,638 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 73.3MB in the beginning and 73.3MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 08:58:54,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.75ms. Allocated memory is still 123.7MB. Free memory was 92.9MB in the beginning and 84.1MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 08:58:54,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.70ms. Allocated memory is still 123.7MB. Free memory was 84.1MB in the beginning and 82.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 08:58:54,639 INFO L158 Benchmark]: Boogie Preprocessor took 17.55ms. Allocated memory is still 123.7MB. Free memory was 82.5MB in the beginning and 82.0MB in the end (delta: 571.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 08:58:54,639 INFO L158 Benchmark]: RCFGBuilder took 204.93ms. Allocated memory is still 123.7MB. Free memory was 82.0MB in the beginning and 73.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-18 08:58:54,640 INFO L158 Benchmark]: BuchiAutomizer took 29393.31ms. Allocated memory was 123.7MB in the beginning and 474.0MB in the end (delta: 350.2MB). Free memory was 73.2MB in the beginning and 398.3MB in the end (delta: -325.1MB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. [2023-02-18 08:58:54,640 INFO L158 Benchmark]: Witness Printer took 127.59ms. Allocated memory is still 474.0MB. Free memory was 398.3MB in the beginning and 378.0MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-18 08:58:54,641 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.17ms. Allocated memory is still 98.6MB. Free memory was 73.3MB in the beginning and 73.3MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.75ms. Allocated memory is still 123.7MB. Free memory was 92.9MB in the beginning and 84.1MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.70ms. Allocated memory is still 123.7MB. Free memory was 84.1MB in the beginning and 82.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.55ms. Allocated memory is still 123.7MB. Free memory was 82.5MB in the beginning and 82.0MB in the end (delta: 571.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 204.93ms. Allocated memory is still 123.7MB. Free memory was 82.0MB in the beginning and 73.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 29393.31ms. Allocated memory was 123.7MB in the beginning and 474.0MB in the end (delta: 350.2MB). Free memory was 73.2MB in the beginning and 398.3MB in the end (delta: -325.1MB). Peak memory consumption was 281.9MB. Max. memory is 16.1GB. * Witness Printer took 127.59ms. Allocated memory is still 474.0MB. Free memory was 398.3MB in the beginning and 378.0MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. 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 13 terminating modules (8 trivial, 2 deterministic, 3 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + range and consists of 3 locations. One deterministic module has affine ranking function -1 * i + range and consists of 3 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 6 locations. One nondeterministic module has affine ranking function i and consists of 10 locations. 8 modules have a trivial ranking function, the largest among these consists of 56 locations. The remainder module has 647 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.1s and 12 iterations. TraceHistogramMax:210. Analysis of lassos took 13.4s. Construction of modules took 2.3s. Büchi inclusion checks took 13.1s. Highest rank in rank-based complementation 5. Minimization of det autom 1. Minimization of nondet autom 12. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 974 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 1, 1]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 7/12 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 237 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 969 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4517 IncrementalHoareTripleChecker+Invalid, 5486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 969 mSolverCounterUnsat, 105 mSDtfsCounter, 4517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc2 concLT0 SILN4 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital34 mio100 ax138 hnf100 lsp71 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf96 smp100 dnf201 smp100 tf105 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 76ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 8 SupportingInvariants: 0 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 11]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] i = __VERIFIER_nondet_int() [L9] range = 20 VAL [range=20] [L11] COND TRUE 0 <= i && i <= range VAL [i=20, range=20] [L12] COND TRUE !(0 == i && i == range) VAL [i=20, range=20] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=18, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=18, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=18, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=19, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=19, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=19, range=19] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=18, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=18, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=18, range=18] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=17] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=16] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=15] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=14] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=13] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=12] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=11] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=10] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=9] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=8] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=7] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=6] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=5] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=4] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=3] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=2] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=2] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=2] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=1] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=1] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=1] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=1] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=1] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=1] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=0] Loop: [L11] COND TRUE 0 <= i && i <= range [L12] COND FALSE !(!(0 == i && i == range)) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 11]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] i = __VERIFIER_nondet_int() [L9] range = 20 VAL [range=20] [L11] COND TRUE 0 <= i && i <= range VAL [i=20, range=20] [L12] COND TRUE !(0 == i && i == range) VAL [i=20, range=20] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=18, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=18, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=18, range=19] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=19, range=19] [L11] COND TRUE 0 <= i && i <= range VAL [i=19, range=19] [L12] COND TRUE !(0 == i && i == range) VAL [i=19, range=19] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=18] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=18, range=18] [L11] COND TRUE 0 <= i && i <= range VAL [i=18, range=18] [L12] COND TRUE !(0 == i && i == range) VAL [i=18, range=18] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=17] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=17, range=17] [L11] COND TRUE 0 <= i && i <= range VAL [i=17, range=17] [L12] COND TRUE !(0 == i && i == range) VAL [i=17, range=17] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=16] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=16, range=16] [L11] COND TRUE 0 <= i && i <= range VAL [i=16, range=16] [L12] COND TRUE !(0 == i && i == range) VAL [i=16, range=16] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=15] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=15, range=15] [L11] COND TRUE 0 <= i && i <= range VAL [i=15, range=15] [L12] COND TRUE !(0 == i && i == range) VAL [i=15, range=15] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=14] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=14, range=14] [L11] COND TRUE 0 <= i && i <= range VAL [i=14, range=14] [L12] COND TRUE !(0 == i && i == range) VAL [i=14, range=14] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=13] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=13, range=13] [L11] COND TRUE 0 <= i && i <= range VAL [i=13, range=13] [L12] COND TRUE !(0 == i && i == range) VAL [i=13, range=13] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=12] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=12, range=12] [L11] COND TRUE 0 <= i && i <= range VAL [i=12, range=12] [L12] COND TRUE !(0 == i && i == range) VAL [i=12, range=12] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=11] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=11, range=11] [L11] COND TRUE 0 <= i && i <= range VAL [i=11, range=11] [L12] COND TRUE !(0 == i && i == range) VAL [i=11, range=11] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=10] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=10, range=10] [L11] COND TRUE 0 <= i && i <= range VAL [i=10, range=10] [L12] COND TRUE !(0 == i && i == range) VAL [i=10, range=10] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=9] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=9, range=9] [L11] COND TRUE 0 <= i && i <= range VAL [i=9, range=9] [L12] COND TRUE !(0 == i && i == range) VAL [i=9, range=9] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=8] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=8, range=8] [L11] COND TRUE 0 <= i && i <= range VAL [i=8, range=8] [L12] COND TRUE !(0 == i && i == range) VAL [i=8, range=8] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=7] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=7, range=7] [L11] COND TRUE 0 <= i && i <= range VAL [i=7, range=7] [L12] COND TRUE !(0 == i && i == range) VAL [i=7, range=7] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=6] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=6, range=6] [L11] COND TRUE 0 <= i && i <= range VAL [i=6, range=6] [L12] COND TRUE !(0 == i && i == range) VAL [i=6, range=6] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=5] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=5, range=5] [L11] COND TRUE 0 <= i && i <= range VAL [i=5, range=5] [L12] COND TRUE !(0 == i && i == range) VAL [i=5, range=5] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=4] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=4, range=4] [L11] COND TRUE 0 <= i && i <= range VAL [i=4, range=4] [L12] COND TRUE !(0 == i && i == range) VAL [i=4, range=4] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=3] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=3, range=3] [L11] COND TRUE 0 <= i && i <= range VAL [i=3, range=3] [L12] COND TRUE !(0 == i && i == range) VAL [i=3, range=3] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=2] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=2] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=2, range=2] [L11] COND TRUE 0 <= i && i <= range VAL [i=2, range=2] [L12] COND TRUE !(0 == i && i == range) VAL [i=2, range=2] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=1] [L11] COND TRUE 0 <= i && i <= range VAL [i=0, range=1] [L12] COND TRUE !(0 == i && i == range) VAL [i=0, range=1] [L13] COND FALSE !(i == range) [L17] i = i+1 VAL [i=1, range=1] [L11] COND TRUE 0 <= i && i <= range VAL [i=1, range=1] [L12] COND TRUE !(0 == i && i == range) VAL [i=1, range=1] [L13] COND TRUE i == range [L14] i = 0 [L15] range = range-1 VAL [i=0, range=0] Loop: [L11] COND TRUE 0 <= i && i <= range [L12] COND FALSE !(!(0 == i && i == range)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-18 08:58:54,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-02-18 08:58:54,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2023-02-18 08:58:55,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-02-18 08:58:55,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2023-02-18 08:58:55,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-02-18 08:58:55,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-02-18 08:58:55,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-18 08:58:56,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)