./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1 --witnessprinter.witness.filename witness --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 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-12-02 10:40:28,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-02 10:40:29,017 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-12-02 10:40:29,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-02 10:40:29,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-02 10:40:29,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-02 10:40:29,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-02 10:40:29,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-02 10:40:29,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-12-02 10:40:29,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-12-02 10:40:29,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-02 10:40:29,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-02 10:40:29,044 INFO L153 SettingsManager]: * Use SBE=true [2024-12-02 10:40:29,044 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-12-02 10:40:29,044 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Use old map elimination=false [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-12-02 10:40:29,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-12-02 10:40:29,045 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-12-02 10:40:29,046 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-02 10:40:29,046 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-12-02 10:40:29,046 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-02 10:40:29,046 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-02 10:40:29,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-02 10:40:29,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-02 10:40:29,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-02 10:40:29,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL_NO_AM [2024-12-02 10:40:29,046 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-12-02 10:40:29,047 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0b3c6d5b6497aa5ff0eb68154ec5345da59cc3565c3dc280e241d196cfa0cbf4 [2024-12-02 10:40:29,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-02 10:40:29,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-02 10:40:29,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-02 10:40:29,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-02 10:40:29,286 INFO L274 PluginConnector]: CDTParser initialized [2024-12-02 10:40:29,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/../../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2024-12-02 10:40:31,975 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/data/2acd5530f/282c3a5f99294a108db402e9e0150683/FLAGc59c0051e [2024-12-02 10:40:32,142 INFO L384 CDTParser]: Found 1 translation units. [2024-12-02 10:40:32,142 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2-modified1000.c [2024-12-02 10:40:32,148 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/data/2acd5530f/282c3a5f99294a108db402e9e0150683/FLAGc59c0051e [2024-12-02 10:40:32,162 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/data/2acd5530f/282c3a5f99294a108db402e9e0150683 [2024-12-02 10:40:32,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-02 10:40:32,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-02 10:40:32,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-02 10:40:32,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-02 10:40:32,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-02 10:40:32,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343ec61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32, skipping insertion in model container [2024-12-02 10:40:32,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-02 10:40:32,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:40:32,299 INFO L200 MainTranslator]: Completed pre-run [2024-12-02 10:40:32,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-02 10:40:32,317 INFO L204 MainTranslator]: Completed translation [2024-12-02 10:40:32,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32 WrapperNode [2024-12-02 10:40:32,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-02 10:40:32,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-02 10:40:32,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-02 10:40:32,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-02 10:40:32,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,338 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-12-02 10:40:32,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-02 10:40:32,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-02 10:40:32,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-02 10:40:32,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-02 10:40:32,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,350 INFO L175 MemorySlicer]: No memory access in input program. [2024-12-02 10:40:32,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-02 10:40:32,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-02 10:40:32,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-02 10:40:32,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-02 10:40:32,360 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (1/1) ... [2024-12-02 10:40:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-12-02 10:40:32,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:32,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-12-02 10:40:32,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-12-02 10:40:32,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-02 10:40:32,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-02 10:40:32,473 INFO L234 CfgBuilder]: Building ICFG [2024-12-02 10:40:32,475 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-02 10:40:32,531 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-12-02 10:40:32,531 INFO L283 CfgBuilder]: Performing block encoding [2024-12-02 10:40:32,539 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-02 10:40:32,539 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-12-02 10:40:32,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:40:32 BoogieIcfgContainer [2024-12-02 10:40:32,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-02 10:40:32,541 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-12-02 10:40:32,541 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-12-02 10:40:32,546 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-12-02 10:40:32,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-12-02 10:40:32,547 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 10:40:32" (1/3) ... [2024-12-02 10:40:32,548 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b0021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:40:32, skipping insertion in model container [2024-12-02 10:40:32,548 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-12-02 10:40:32,548 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:40:32" (2/3) ... [2024-12-02 10:40:32,549 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b0021 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 10:40:32, skipping insertion in model container [2024-12-02 10:40:32,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-12-02 10:40:32,549 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:40:32" (3/3) ... [2024-12-02 10:40:32,550 INFO L363 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2-modified1000.c [2024-12-02 10:40:32,598 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-12-02 10:40:32,598 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-12-02 10:40:32,598 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-12-02 10:40:32,598 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-12-02 10:40:32,599 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-12-02 10:40:32,599 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-12-02 10:40:32,599 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-12-02 10:40:32,599 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-12-02 10:40:32,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:40:32,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-12-02 10:40:32,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:40:32,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:40:32,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:40:32,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-12-02 10:40:32,621 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-12-02 10:40:32,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:40:32,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-12-02 10:40:32,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:40:32,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:40:32,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:40:32,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-12-02 10:40:32,629 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:40:32,629 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:40:32,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:32,634 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-12-02 10:40:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531153882] [2024-12-02 10:40:32,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:32,703 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:40:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:32,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:40:32,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1174027, now seen corresponding path program 1 times [2024-12-02 10:40:32,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:32,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957258877] [2024-12-02 10:40:32,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:32,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:32,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:40:32,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957258877] [2024-12-02 10:40:32,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957258877] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:40:32,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580593099] [2024-12-02 10:40:32,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:32,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:40:32,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:32,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:40:32,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-12-02 10:40:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:32,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-12-02 10:40:32,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:40:32,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:40:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580593099] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:40:32,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:40:32,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-12-02 10:40:32,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274743526] [2024-12-02 10:40:32,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:40:32,876 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:40:32,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:40:32,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-12-02 10:40:32,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-12-02 10:40:32,906 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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) [2024-12-02 10:40:32,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:32,933 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2024-12-02 10:40:32,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2024-12-02 10:40:32,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-12-02 10:40:32,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2024-12-02 10:40:32,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2024-12-02 10:40:32,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2024-12-02 10:40:32,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2024-12-02 10:40:32,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:40:32,941 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-12-02 10:40:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2024-12-02 10:40:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-12-02 10:40:32,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 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) [2024-12-02 10:40:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-12-02 10:40:32,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-12-02 10:40:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-12-02 10:40:32,964 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-12-02 10:40:32,964 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-12-02 10:40:32,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2024-12-02 10:40:32,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2024-12-02 10:40:32,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:40:32,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:40:32,965 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:40:32,965 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-12-02 10:40:32,965 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:40:32,965 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:40:32,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-12-02 10:40:32,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:32,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224501604] [2024-12-02 10:40:32,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:32,969 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:40:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:32,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:40:32,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:32,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1846436115, now seen corresponding path program 1 times [2024-12-02 10:40:32,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:32,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096921343] [2024-12-02 10:40:32,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:32,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:33,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:40:33,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096921343] [2024-12-02 10:40:33,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096921343] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:40:33,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925924054] [2024-12-02 10:40:33,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:33,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:40:33,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:33,041 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:40:33,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-02 10:40:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:33,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-12-02 10:40:33,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:40:33,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:40:33,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925924054] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:40:33,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:40:33,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-12-02 10:40:33,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901577921] [2024-12-02 10:40:33,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:40:33,160 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:40:33,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:40:33,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-12-02 10:40:33,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-12-02 10:40:33,161 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:40:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:33,207 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-12-02 10:40:33,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 19 transitions. [2024-12-02 10:40:33,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-12-02 10:40:33,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 19 transitions. [2024-12-02 10:40:33,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-12-02 10:40:33,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2024-12-02 10:40:33,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 19 transitions. [2024-12-02 10:40:33,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:40:33,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-12-02 10:40:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 19 transitions. [2024-12-02 10:40:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-12-02 10:40:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 17 states have internal predecessors, (19), 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) [2024-12-02 10:40:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-12-02 10:40:33,211 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-12-02 10:40:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-12-02 10:40:33,212 INFO L425 stractBuchiCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-12-02 10:40:33,212 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-12-02 10:40:33,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 19 transitions. [2024-12-02 10:40:33,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-12-02 10:40:33,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:40:33,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:40:33,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:40:33,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1, 1] [2024-12-02 10:40:33,214 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:40:33,214 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:40:33,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:33,214 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-12-02 10:40:33,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349577318] [2024-12-02 10:40:33,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:33,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:33,218 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:40:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:33,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:40:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 790692643, now seen corresponding path program 2 times [2024-12-02 10:40:33,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:33,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905309223] [2024-12-02 10:40:33,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:40:33,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905309223] [2024-12-02 10:40:33,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905309223] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:40:33,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431912177] [2024-12-02 10:40:33,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:33,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:40:33,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:33,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:40:33,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-02 10:40:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:33,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-02 10:40:33,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:40:33,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:40:33,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431912177] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:40:33,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:40:33,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-12-02 10:40:33,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144839920] [2024-12-02 10:40:33,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:40:33,598 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:40:33,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:40:33,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-02 10:40:33,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2024-12-02 10:40:33,599 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. cyclomatic complexity: 2 Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 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) [2024-12-02 10:40:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:33,658 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-12-02 10:40:33,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 35 transitions. [2024-12-02 10:40:33,659 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-12-02 10:40:33,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 35 transitions. [2024-12-02 10:40:33,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2024-12-02 10:40:33,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-12-02 10:40:33,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 35 transitions. [2024-12-02 10:40:33,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:40:33,660 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-12-02 10:40:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 35 transitions. [2024-12-02 10:40:33,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-12-02 10:40:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 33 states have internal predecessors, (35), 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) [2024-12-02 10:40:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-12-02 10:40:33,662 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-12-02 10:40:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-02 10:40:33,663 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-12-02 10:40:33,664 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-12-02 10:40:33,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 35 transitions. [2024-12-02 10:40:33,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2024-12-02 10:40:33,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:40:33,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:40:33,665 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:40:33,665 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 1, 1, 1, 1] [2024-12-02 10:40:33,665 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:40:33,665 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:40:33,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-12-02 10:40:33,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:33,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667608397] [2024-12-02 10:40:33,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:33,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:33,669 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:40:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:33,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:40:33,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash 920983363, now seen corresponding path program 3 times [2024-12-02 10:40:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791851508] [2024-12-02 10:40:33,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:40:33,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791851508] [2024-12-02 10:40:33,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791851508] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:40:33,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937867363] [2024-12-02 10:40:33,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:33,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:40:33,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:33,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:40:33,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-02 10:40:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:33,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-12-02 10:40:34,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:40:34,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:40:34,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937867363] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:40:34,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:40:34,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2024-12-02 10:40:34,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548970481] [2024-12-02 10:40:34,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:40:34,543 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:40:34,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:40:34,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-12-02 10:40:34,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2024-12-02 10:40:34,545 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. cyclomatic complexity: 2 Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-02 10:40:34,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:34,663 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2024-12-02 10:40:34,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 67 transitions. [2024-12-02 10:40:34,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-12-02 10:40:34,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 67 transitions. [2024-12-02 10:40:34,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2024-12-02 10:40:34,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2024-12-02 10:40:34,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 67 transitions. [2024-12-02 10:40:34,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:40:34,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-12-02 10:40:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 67 transitions. [2024-12-02 10:40:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-12-02 10:40:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 65 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) [2024-12-02 10:40:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2024-12-02 10:40:34,671 INFO L240 hiAutomatonCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-12-02 10:40:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-12-02 10:40:34,672 INFO L425 stractBuchiCegarLoop]: Abstraction has 66 states and 67 transitions. [2024-12-02 10:40:34,672 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-12-02 10:40:34,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 67 transitions. [2024-12-02 10:40:34,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2024-12-02 10:40:34,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:40:34,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:40:34,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:40:34,674 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 1, 1, 1, 1] [2024-12-02 10:40:34,674 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:40:34,674 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:40:34,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-12-02 10:40:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:34,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599443743] [2024-12-02 10:40:34,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:34,677 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:40:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:34,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:40:34,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:34,679 INFO L85 PathProgramCache]: Analyzing trace with hash 514359171, now seen corresponding path program 4 times [2024-12-02 10:40:34,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901599198] [2024-12-02 10:40:34,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:35,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:40:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901599198] [2024-12-02 10:40:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901599198] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:40:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987346737] [2024-12-02 10:40:35,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:40:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:35,541 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:40:35,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-02 10:40:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:35,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-12-02 10:40:35,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:40:35,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:40:36,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987346737] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:40:36,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:40:36,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 64 [2024-12-02 10:40:36,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933830538] [2024-12-02 10:40:36,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:40:36,998 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:40:36,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:40:36,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-12-02 10:40:37,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2024-12-02 10:40:37,000 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. cyclomatic complexity: 2 Second operand has 64 states, 64 states have (on average 1.96875) internal successors, (126), 64 states have internal predecessors, (126), 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) [2024-12-02 10:40:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:37,197 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2024-12-02 10:40:37,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 131 transitions. [2024-12-02 10:40:37,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 128 [2024-12-02 10:40:37,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 130 states and 131 transitions. [2024-12-02 10:40:37,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2024-12-02 10:40:37,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2024-12-02 10:40:37,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 131 transitions. [2024-12-02 10:40:37,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:40:37,202 INFO L218 hiAutomatonCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-12-02 10:40:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 131 transitions. [2024-12-02 10:40:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-12-02 10:40:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.0076923076923077) internal successors, (131), 129 states have internal predecessors, (131), 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) [2024-12-02 10:40:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2024-12-02 10:40:37,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-12-02 10:40:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-12-02 10:40:37,212 INFO L425 stractBuchiCegarLoop]: Abstraction has 130 states and 131 transitions. [2024-12-02 10:40:37,212 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-12-02 10:40:37,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 131 transitions. [2024-12-02 10:40:37,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 128 [2024-12-02 10:40:37,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:40:37,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:40:37,215 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:40:37,215 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [62, 62, 1, 1, 1, 1] [2024-12-02 10:40:37,215 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:40:37,216 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:40:37,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2024-12-02 10:40:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:37,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560763866] [2024-12-02 10:40:37,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:37,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:37,220 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:40:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:37,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:40:37,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -585347069, now seen corresponding path program 5 times [2024-12-02 10:40:37,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:37,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056783367] [2024-12-02 10:40:37,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:37,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:37,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:39,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:40:39,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056783367] [2024-12-02 10:40:39,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056783367] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:40:39,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576383441] [2024-12-02 10:40:39,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:39,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:40:39,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:39,313 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:40:39,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-02 10:40:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:39,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-12-02 10:40:39,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:40:39,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:40:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576383441] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:40:43,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:40:43,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 128 [2024-12-02 10:40:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723108978] [2024-12-02 10:40:43,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:40:43,669 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:40:43,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:40:43,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-12-02 10:40:43,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2024-12-02 10:40:43,675 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. cyclomatic complexity: 2 Second operand has 128 states, 128 states have (on average 1.984375) internal successors, (254), 128 states have internal predecessors, (254), 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) [2024-12-02 10:40:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:40:44,091 INFO L93 Difference]: Finished difference Result 258 states and 259 transitions. [2024-12-02 10:40:44,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 258 states and 259 transitions. [2024-12-02 10:40:44,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 256 [2024-12-02 10:40:44,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 258 states to 258 states and 259 transitions. [2024-12-02 10:40:44,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2024-12-02 10:40:44,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2024-12-02 10:40:44,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 258 states and 259 transitions. [2024-12-02 10:40:44,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:40:44,096 INFO L218 hiAutomatonCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-12-02 10:40:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states and 259 transitions. [2024-12-02 10:40:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-12-02 10:40:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 258 states have (on average 1.003875968992248) internal successors, (259), 257 states have internal predecessors, (259), 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) [2024-12-02 10:40:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2024-12-02 10:40:44,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-12-02 10:40:44,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-12-02 10:40:44,108 INFO L425 stractBuchiCegarLoop]: Abstraction has 258 states and 259 transitions. [2024-12-02 10:40:44,108 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-12-02 10:40:44,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 258 states and 259 transitions. [2024-12-02 10:40:44,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 256 [2024-12-02 10:40:44,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:40:44,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:40:44,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:40:44,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [126, 126, 1, 1, 1, 1] [2024-12-02 10:40:44,112 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:40:44,112 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:40:44,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2024-12-02 10:40:44,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:44,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332785428] [2024-12-02 10:40:44,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:44,116 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:40:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:40:44,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:40:44,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:40:44,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2051542781, now seen corresponding path program 6 times [2024-12-02 10:40:44,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:40:44,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659757396] [2024-12-02 10:40:44,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:44,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:40:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:40:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659757396] [2024-12-02 10:40:50,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659757396] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:40:50,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879142902] [2024-12-02 10:40:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:40:50,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:40:50,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:40:50,989 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:40:50,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-02 10:40:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:40:51,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-12-02 10:40:51,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:40:51,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:41:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879142902] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:41:06,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:41:06,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 256 [2024-12-02 10:41:06,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317921535] [2024-12-02 10:41:06,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:41:06,588 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:41:06,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:41:06,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2024-12-02 10:41:06,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32640, Invalid=32640, Unknown=0, NotChecked=0, Total=65280 [2024-12-02 10:41:06,600 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. cyclomatic complexity: 2 Second operand has 256 states, 256 states have (on average 1.9921875) internal successors, (510), 256 states have internal predecessors, (510), 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) [2024-12-02 10:41:08,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:41:08,006 INFO L93 Difference]: Finished difference Result 514 states and 515 transitions. [2024-12-02 10:41:08,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 515 transitions. [2024-12-02 10:41:08,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 512 [2024-12-02 10:41:08,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 514 states and 515 transitions. [2024-12-02 10:41:08,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 514 [2024-12-02 10:41:08,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 514 [2024-12-02 10:41:08,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 514 states and 515 transitions. [2024-12-02 10:41:08,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:41:08,012 INFO L218 hiAutomatonCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-12-02 10:41:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states and 515 transitions. [2024-12-02 10:41:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-12-02 10:41:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 514 states have (on average 1.0019455252918288) internal successors, (515), 513 states have internal predecessors, (515), 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) [2024-12-02 10:41:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 515 transitions. [2024-12-02 10:41:08,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-12-02 10:41:08,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 256 states. [2024-12-02 10:41:08,022 INFO L425 stractBuchiCegarLoop]: Abstraction has 514 states and 515 transitions. [2024-12-02 10:41:08,022 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-12-02 10:41:08,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 514 states and 515 transitions. [2024-12-02 10:41:08,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 512 [2024-12-02 10:41:08,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:41:08,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:41:08,027 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:41:08,027 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [254, 254, 1, 1, 1, 1] [2024-12-02 10:41:08,027 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:41:08,027 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:41:08,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:41:08,028 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2024-12-02 10:41:08,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:41:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331013071] [2024-12-02 10:41:08,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:41:08,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:41:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:41:08,030 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:41:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:41:08,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:41:08,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:41:08,032 INFO L85 PathProgramCache]: Analyzing trace with hash 96416515, now seen corresponding path program 7 times [2024-12-02 10:41:08,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:41:08,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508872670] [2024-12-02 10:41:08,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:41:08,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:41:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:41:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:41:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508872670] [2024-12-02 10:41:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508872670] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:41:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846756388] [2024-12-02 10:41:37,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:41:37,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:41:37,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:41:37,460 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:41:37,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-02 10:41:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:41:37,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 256 conjuncts are in the unsatisfiable core [2024-12-02 10:41:37,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:41:38,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:42:38,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846756388] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:42:38,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:42:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [257, 257, 257] total 512 [2024-12-02 10:42:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618408205] [2024-12-02 10:42:38,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:42:38,647 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:42:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:42:38,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 512 interpolants. [2024-12-02 10:42:38,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130816, Invalid=130816, Unknown=0, NotChecked=0, Total=261632 [2024-12-02 10:42:38,675 INFO L87 Difference]: Start difference. First operand 514 states and 515 transitions. cyclomatic complexity: 2 Second operand has 512 states, 512 states have (on average 1.99609375) internal successors, (1022), 512 states have internal predecessors, (1022), 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) [2024-12-02 10:42:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:42:46,246 INFO L93 Difference]: Finished difference Result 1026 states and 1027 transitions. [2024-12-02 10:42:46,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1026 states and 1027 transitions. [2024-12-02 10:42:46,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1024 [2024-12-02 10:42:46,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1026 states to 1026 states and 1027 transitions. [2024-12-02 10:42:46,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1026 [2024-12-02 10:42:46,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1026 [2024-12-02 10:42:46,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1026 states and 1027 transitions. [2024-12-02 10:42:46,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:42:46,261 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-12-02 10:42:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states and 1027 transitions. [2024-12-02 10:42:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1026. [2024-12-02 10:42:46,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1026 states have (on average 1.0009746588693957) internal successors, (1027), 1025 states have internal predecessors, (1027), 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) [2024-12-02 10:42:46,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1027 transitions. [2024-12-02 10:42:46,282 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-12-02 10:42:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 512 states. [2024-12-02 10:42:46,283 INFO L425 stractBuchiCegarLoop]: Abstraction has 1026 states and 1027 transitions. [2024-12-02 10:42:46,283 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-12-02 10:42:46,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1026 states and 1027 transitions. [2024-12-02 10:42:46,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1024 [2024-12-02 10:42:46,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:42:46,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:42:46,298 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:42:46,298 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [510, 510, 1, 1, 1, 1] [2024-12-02 10:42:46,298 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:42:46,298 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:42:46,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:42:46,299 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2024-12-02 10:42:46,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:42:46,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347121987] [2024-12-02 10:42:46,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:42:46,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:42:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:42:46,301 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:42:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:42:46,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:42:46,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:42:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1056065789, now seen corresponding path program 8 times [2024-12-02 10:42:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:42:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839619686] [2024-12-02 10:42:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:42:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:42:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:45:10,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL_NO_AM found an infeasible trace [2024-12-02 10:45:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839619686] [2024-12-02 10:45:10,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839619686] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-02 10:45:10,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124137843] [2024-12-02 10:45:10,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:45:10,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-02 10:45:10,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 [2024-12-02 10:45:10,886 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-02 10:45:10,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3879905a-3654-45fc-ae64-7c984fcc3280/bin/uautomizer-verify-84ZbGMXZE1/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-02 10:45:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-02 10:45:11,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 512 conjuncts are in the unsatisfiable core [2024-12-02 10:45:11,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-02 10:45:12,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-02 10:49:13,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124137843] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-02 10:49:13,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-02 10:49:13,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [513, 513, 513] total 1001 [2024-12-02 10:49:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720587491] [2024-12-02 10:49:13,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-02 10:49:13,063 INFO L764 eck$LassoCheckResult]: loop already infeasible [2024-12-02 10:49:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_NO_AM [2024-12-02 10:49:13,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 1001 interpolants. [2024-12-02 10:49:13,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=500500, Invalid=500500, Unknown=0, NotChecked=0, Total=1001000 [2024-12-02 10:49:13,156 INFO L87 Difference]: Start difference. First operand 1026 states and 1027 transitions. cyclomatic complexity: 2 Second operand has 1001 states, 1001 states have (on average 2.0) internal successors, (2002), 1001 states have internal predecessors, (2002), 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) [2024-12-02 10:49:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-12-02 10:49:59,991 INFO L93 Difference]: Finished difference Result 2004 states and 2005 transitions. [2024-12-02 10:49:59,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2004 states and 2005 transitions. [2024-12-02 10:49:59,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2002 [2024-12-02 10:50:00,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2004 states to 2004 states and 2005 transitions. [2024-12-02 10:50:00,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2004 [2024-12-02 10:50:00,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2004 [2024-12-02 10:50:00,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2004 states and 2005 transitions. [2024-12-02 10:50:00,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-12-02 10:50:00,004 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2004 states and 2005 transitions. [2024-12-02 10:50:00,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states and 2005 transitions. [2024-12-02 10:50:00,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 2004. [2024-12-02 10:50:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2004 states, 2004 states have (on average 1.000499001996008) internal successors, (2005), 2003 states have internal predecessors, (2005), 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) [2024-12-02 10:50:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2004 states to 2004 states and 2005 transitions. [2024-12-02 10:50:00,021 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2004 states and 2005 transitions. [2024-12-02 10:50:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1001 states. [2024-12-02 10:50:00,022 INFO L425 stractBuchiCegarLoop]: Abstraction has 2004 states and 2005 transitions. [2024-12-02 10:50:00,022 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-12-02 10:50:00,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2004 states and 2005 transitions. [2024-12-02 10:50:00,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2002 [2024-12-02 10:50:00,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-12-02 10:50:00,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-12-02 10:50:00,034 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-12-02 10:50:00,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [999, 999, 1, 1, 1, 1] [2024-12-02 10:50:00,035 INFO L747 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;havoc main_#t~nondet0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;havoc main_#t~nondet1#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;" [2024-12-02 10:50:00,035 INFO L749 eck$LassoCheckResult]: Loop: "assume main_~x1~0#1 <= 10;" "main_~x2~0#1 := 1000;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume main_~x2~0#1 > 1;" "main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2024-12-02 10:50:00,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:50:00,036 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2024-12-02 10:50:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:50:00,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356156136] [2024-12-02 10:50:00,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:50:00,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:50:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:50:00,037 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:50:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:50:00,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:50:00,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:50:00,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1919496359, now seen corresponding path program 9 times [2024-12-02 10:50:00,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:50:00,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635646197] [2024-12-02 10:50:00,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:50:00,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:50:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:50:04,056 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:50:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:50:08,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace [2024-12-02 10:50:08,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-02 10:50:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1264216087, now seen corresponding path program 1 times [2024-12-02 10:50:08,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL_NO_AM [2024-12-02 10:50:08,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950027943] [2024-12-02 10:50:08,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-02 10:50:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-02 10:50:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:50:12,020 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-12-02 10:50:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-12-02 10:50:15,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL_NO_AM found a feasible trace