./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:12:14,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:12:14,864 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-11-08 12:12:14,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:12:14,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:12:14,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:12:14,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:12:14,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:12:14,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:12:14,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:12:14,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:12:14,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:12:14,893 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:12:14,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:12:14,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:12:14,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:12:14,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:12:14,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:12:14,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:12:14,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:12:14,900 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:12:14,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:12:14,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:12:14,901 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:12:14,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:12:14,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:12:14,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:12:14,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:12:14,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:12:14,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:12:14,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:12:14,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:12:14,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:12:14,909 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:12:14,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:12:14,910 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-08 12:12:14,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:12:14,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:12:14,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-08 12:12:14,912 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-08 12:12:14,913 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-08 12:12:14,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2024-11-08 12:12:15,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:12:15,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:12:15,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:12:15,195 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:12:15,196 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:12:15,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c Unable to find full path for "g++" [2024-11-08 12:12:17,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:12:17,590 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:12:17,590 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2024-11-08 12:12:17,599 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/data/3eab193a9/cc3e47aa71e845d88a63b1efcb58b8b6/FLAGad8aacd46 [2024-11-08 12:12:17,615 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/data/3eab193a9/cc3e47aa71e845d88a63b1efcb58b8b6 [2024-11-08 12:12:17,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:12:17,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:12:17,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:12:17,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:12:17,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:12:17,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:12:17" (1/1) ... [2024-11-08 12:12:17,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459fe4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:17, skipping insertion in model container [2024-11-08 12:12:17,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:12:17" (1/1) ... [2024-11-08 12:12:17,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:12:18,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2024-11-08 12:12:18,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:12:18,068 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:12:18,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2024-11-08 12:12:18,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:12:18,123 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:12:18,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18 WrapperNode [2024-11-08 12:12:18,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:12:18,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:12:18,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:12:18,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:12:18,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,145 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,177 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2024-11-08 12:12:18,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:12:18,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:12:18,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:12:18,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:12:18,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:12:18,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:12:18,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:12:18,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:12:18,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (1/1) ... [2024-11-08 12:12:18,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:12:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:12:18,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-08 12:12:18,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-08 12:12:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:12:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 12:12:18,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 12:12:18,396 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 12:12:18,396 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 12:12:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 12:12:18,397 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 12:12:18,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 12:12:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 12:12:18,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 12:12:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 12:12:18,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 12:12:18,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:12:18,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:12:18,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 12:12:18,404 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 12:12:18,560 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:12:18,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:12:18,893 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 12:12:18,897 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:12:19,172 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:12:19,173 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:12:19,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:19 BoogieIcfgContainer [2024-11-08 12:12:19,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:12:19,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:12:19,181 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:12:19,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:12:19,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:12:17" (1/3) ... [2024-11-08 12:12:19,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364b8734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:12:19, skipping insertion in model container [2024-11-08 12:12:19,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:12:18" (2/3) ... [2024-11-08 12:12:19,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364b8734 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:12:19, skipping insertion in model container [2024-11-08 12:12:19,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:12:19" (3/3) ... [2024-11-08 12:12:19,194 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2024-11-08 12:12:19,241 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:12:19,241 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:12:19,242 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 12:12:19,348 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 12:12:19,401 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:12:19,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-08 12:12:19,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:12:19,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-08 12:12:19,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-08 12:12:19,431 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:12:19,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:12:19,460 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@276f2e60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:12:19,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-08 12:12:20,084 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:12:20,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash 300214339, now seen corresponding path program 1 times [2024-11-08 12:12:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612665521] [2024-11-08 12:12:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:20,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:20,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612665521] [2024-11-08 12:12:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612665521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:12:20,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:12:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:12:20,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260484023] [2024-11-08 12:12:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:20,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:12:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:12:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:12:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:20,703 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:12:20,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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-11-08 12:12:20,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:20,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:12:20,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:12:20,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:20,790 INFO L85 PathProgramCache]: Analyzing trace with hash 140583615, now seen corresponding path program 1 times [2024-11-08 12:12:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765640056] [2024-11-08 12:12:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:20,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:21,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:12:21,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:21,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765640056] [2024-11-08 12:12:21,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765640056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:12:21,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:12:21,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:12:21,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359784356] [2024-11-08 12:12:21,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:21,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:12:21,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:21,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:12:21,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:12:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:21,058 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:12:21,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:12:21,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:21,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:12:21,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:12:21,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:12:21,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:21,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1564202896, now seen corresponding path program 1 times [2024-11-08 12:12:21,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:21,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969213724] [2024-11-08 12:12:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:21,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:12:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969213724] [2024-11-08 12:12:21,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969213724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:21,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217540750] [2024-11-08 12:12:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:21,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:21,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:12:21,464 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:12:21,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:12:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:21,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 12:12:21,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:12:21,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:12:21,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217540750] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:21,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:12:21,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-11-08 12:12:21,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574323117] [2024-11-08 12:12:21,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:21,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:12:21,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:21,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:12:21,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 12:12:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:21,788 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:12:21,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 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-11-08 12:12:21,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:21,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:12:21,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:22,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:12:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:12:22,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:12:22,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:22,221 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:12:22,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:22,221 INFO L85 PathProgramCache]: Analyzing trace with hash -212678964, now seen corresponding path program 1 times [2024-11-08 12:12:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418437781] [2024-11-08 12:12:22,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:12:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418437781] [2024-11-08 12:12:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418437781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:12:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:12:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:12:22,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552052766] [2024-11-08 12:12:22,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:12:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:12:22,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:12:22,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:12:22,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:12:22,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:22,327 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:12:22,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-11-08 12:12:22,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:22,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:12:22,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:12:22,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:12:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:12:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:12:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:12:22,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:12:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:12:22,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:12:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:12:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 504414472, now seen corresponding path program 1 times [2024-11-08 12:12:22,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:12:22,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83310128] [2024-11-08 12:12:22,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:22,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:12:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:23,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:12:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83310128] [2024-11-08 12:12:23,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83310128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:12:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177828459] [2024-11-08 12:12:23,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:12:23,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:12:23,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:12:23,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:12:23,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:12:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:12:23,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 12:12:23,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:12:24,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:12:24,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2024-11-08 12:12:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:12:24,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:12:28,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 294 treesize of output 264 [2024-11-08 12:12:29,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:12:29,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 387 treesize of output 389 [2024-11-08 12:13:00,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 208 [2024-11-08 12:13:01,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:13:01,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 261 treesize of output 291 [2024-11-08 12:13:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:03,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177828459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:03,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:03,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 26 [2024-11-08 12:13:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984145679] [2024-11-08 12:13:03,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:03,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-08 12:13:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:03,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-08 12:13:03,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2024-11-08 12:13:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:03,203 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:13:03,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.259259259259259) internal successors, (88), 26 states have internal predecessors, (88), 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-11-08 12:13:03,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:03,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:03,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:03,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:03,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:13:04,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 12:13:05,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:05,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:13:05,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash -172420860, now seen corresponding path program 2 times [2024-11-08 12:13:05,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:05,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443339886] [2024-11-08 12:13:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443339886] [2024-11-08 12:13:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443339886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591482498] [2024-11-08 12:13:05,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:13:05,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:05,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:13:05,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:13:05,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 12:13:05,400 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:13:05,401 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:05,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 12:13:05,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:05,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:05,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591482498] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:05,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:05,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-08 12:13:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322293712] [2024-11-08 12:13:05,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:05,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 12:13:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 12:13:05,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-08 12:13:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:05,695 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:13:05,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 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-11-08 12:13:05,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:05,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:05,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:05,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:05,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:13:05,696 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:13:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:13:06,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 12:13:06,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:06,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:13:06,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash 989731268, now seen corresponding path program 3 times [2024-11-08 12:13:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:06,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674168605] [2024-11-08 12:13:06,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:06,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:06,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:06,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674168605] [2024-11-08 12:13:06,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674168605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:06,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543764946] [2024-11-08 12:13:06,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 12:13:06,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:06,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:13:06,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:13:06,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 12:13:06,439 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-08 12:13:06,439 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:06,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:13:06,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:06,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543764946] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:06,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:06,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-08 12:13:06,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127993565] [2024-11-08 12:13:06,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:06,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:13:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:13:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:13:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:06,657 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:13:06,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.642857142857143) internal successors, (79), 13 states have internal predecessors, (79), 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-11-08 12:13:06,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:06,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:06,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:06,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:06,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:13:06,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:13:06,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:13:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:13:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:06,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 12:13:07,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:07,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:13:07,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:07,158 INFO L85 PathProgramCache]: Analyzing trace with hash 107247368, now seen corresponding path program 1 times [2024-11-08 12:13:07,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:07,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396607492] [2024-11-08 12:13:07,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:13:07,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:07,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396607492] [2024-11-08 12:13:07,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396607492] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:07,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112518382] [2024-11-08 12:13:07,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:07,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:07,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:13:07,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:13:07,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 12:13:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:07,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:13:07,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:07,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:13:07,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:13:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112518382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:07,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-08 12:13:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124262347] [2024-11-08 12:13:07,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:07,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:13:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:07,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:13:07,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:13:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:07,589 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:13:07,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 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-11-08 12:13:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:07,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-08 12:13:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:13:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:07,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:09,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:09,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:09,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 12:13:09,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 12:13:09,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:13:09,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:09,822 INFO L85 PathProgramCache]: Analyzing trace with hash -116730599, now seen corresponding path program 4 times [2024-11-08 12:13:09,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:09,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199867807] [2024-11-08 12:13:09,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:09,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199867807] [2024-11-08 12:13:09,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199867807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:09,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42952956] [2024-11-08 12:13:09,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 12:13:09,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:09,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:13:09,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:13:09,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 12:13:10,065 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 12:13:10,066 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:10,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:13:10,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:10,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:10,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42952956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:10,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:10,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-08 12:13:10,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903507934] [2024-11-08 12:13:10,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:10,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 12:13:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:10,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 12:13:10,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-08 12:13:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:10,321 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:13:10,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 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-11-08 12:13:10,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:10,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:10,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:10,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:10,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:10,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:10,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:10,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:10,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:10,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 12:13:11,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-08 12:13:11,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:13:11,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:11,007 INFO L85 PathProgramCache]: Analyzing trace with hash 599637333, now seen corresponding path program 5 times [2024-11-08 12:13:11,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:11,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186626736] [2024-11-08 12:13:11,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:11,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:11,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186626736] [2024-11-08 12:13:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186626736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285726892] [2024-11-08 12:13:11,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 12:13:11,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:11,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:13:11,169 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:13:11,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 12:13:11,264 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-11-08 12:13:11,264 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:11,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 12:13:11,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:11,459 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 12:13:11,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 12:13:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285726892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:11,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:11,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2024-11-08 12:13:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956299117] [2024-11-08 12:13:11,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:11,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 12:13:11,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:11,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 12:13:11,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-11-08 12:13:11,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:11,630 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:13:11,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0) internal successors, (84), 21 states have internal predecessors, (84), 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-11-08 12:13:11,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:11,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:13,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:13,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-08 12:13:13,570 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 12:13:13,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 12:13:13,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:13:13,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1684321519, now seen corresponding path program 6 times [2024-11-08 12:13:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947425324] [2024-11-08 12:13:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:13,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:16,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947425324] [2024-11-08 12:13:16,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947425324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:16,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22881629] [2024-11-08 12:13:16,334 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 12:13:16,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:16,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:13:16,335 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:13:16,337 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 12:13:16,423 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-11-08 12:13:16,423 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:16,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 12:13:16,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:17,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:13:17,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2024-11-08 12:13:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:13:18,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:21,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:13:21,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 637 treesize of output 265 [2024-11-08 12:13:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 12:13:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22881629] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:25,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:25,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 12] total 41 [2024-11-08 12:13:25,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168876552] [2024-11-08 12:13:25,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 12:13:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 12:13:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1523, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 12:13:25,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:25,843 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:13:25,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.8095238095238093) internal successors, (118), 41 states have internal predecessors, (118), 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-11-08 12:13:25,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:25,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:25,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:25,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:25,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:25,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:25,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:25,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:25,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:25,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-08 12:13:25,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:40,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-08 12:13:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-08 12:13:40,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 12:13:40,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 12:13:40,818 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:13:40,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:40,819 INFO L85 PathProgramCache]: Analyzing trace with hash 929918605, now seen corresponding path program 7 times [2024-11-08 12:13:40,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:40,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256142975] [2024-11-08 12:13:40,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:40,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:41,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:41,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256142975] [2024-11-08 12:13:41,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256142975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:41,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500705836] [2024-11-08 12:13:41,039 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-08 12:13:41,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:41,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:13:41,043 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:13:41,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 12:13:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:41,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 12:13:41,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:41,443 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:41,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:13:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:41,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500705836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:13:41,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 12:13:41,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-08 12:13:41,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076767461] [2024-11-08 12:13:41,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 12:13:41,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 12:13:41,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:13:41,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 12:13:41,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2024-11-08 12:13:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:41,603 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:13:41,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.6) internal successors, (92), 19 states have internal predecessors, (92), 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-11-08 12:13:41,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:41,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:41,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:41,603 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:41,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:41,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:41,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:41,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:41,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:41,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-08 12:13:41,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-11-08 12:13:41,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:13:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:13:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:13:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:13:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 12:13:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:43,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 12:13:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:13:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 12:13:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-08 12:13:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-08 12:13:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 12:13:43,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 12:13:43,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-08 12:13:43,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:13:43,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:13:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1987434159, now seen corresponding path program 2 times [2024-11-08 12:13:43,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:13:43,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260912851] [2024-11-08 12:13:43,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:13:43,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:13:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:13:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:13:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260912851] [2024-11-08 12:13:45,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260912851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 12:13:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953819143] [2024-11-08 12:13:45,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 12:13:45,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:13:45,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:13:45,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:13:45,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 12:13:45,928 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 12:13:45,928 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 12:13:45,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-08 12:13:45,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:13:46,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:13:47,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:13:47,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 122 [2024-11-08 12:13:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:13:51,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:14:13,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1092 treesize of output 974 [2024-11-08 12:14:15,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:14:15,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 1581 treesize of output 1933 [2024-11-08 12:14:29,935 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-08 12:14:56,253 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-08 12:15:25,874 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-08 12:16:00,423 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-08 12:16:28,096 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-08 12:17:08,990 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-08 12:17:55,870 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-08 12:18:30,286 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-11-08 12:20:43,967 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-11-08 12:22:26,016 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-08 12:22:26,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-11-08 12:22:26,019 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 12:22:26,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 12:22:26,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 12:22:26,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-11-08 12:22:26,233 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-11-08 12:22:26,238 INFO L158 Benchmark]: Toolchain (without parser) took 608616.68ms. Allocated memory was 163.6MB in the beginning and 775.9MB in the end (delta: 612.4MB). Free memory was 133.7MB in the beginning and 433.1MB in the end (delta: -299.4MB). Peak memory consumption was 490.0MB. Max. memory is 16.1GB. [2024-11-08 12:22:26,239 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:22:26,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.85ms. Allocated memory is still 163.6MB. Free memory was 133.6MB in the beginning and 119.9MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 12:22:26,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.49ms. Allocated memory is still 163.6MB. Free memory was 119.9MB in the beginning and 118.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:22:26,239 INFO L158 Benchmark]: Boogie Preprocessor took 87.93ms. Allocated memory is still 163.6MB. Free memory was 118.0MB in the beginning and 116.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:22:26,240 INFO L158 Benchmark]: RCFGBuilder took 898.99ms. Allocated memory is still 163.6MB. Free memory was 116.5MB in the beginning and 78.3MB in the end (delta: 38.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 12:22:26,240 INFO L158 Benchmark]: TraceAbstraction took 607056.84ms. Allocated memory was 163.6MB in the beginning and 775.9MB in the end (delta: 612.4MB). Free memory was 77.6MB in the beginning and 433.1MB in the end (delta: -355.5MB). Peak memory consumption was 433.4MB. Max. memory is 16.1GB. [2024-11-08 12:22:26,241 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.85ms. Allocated memory is still 163.6MB. Free memory was 133.6MB in the beginning and 119.9MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.49ms. Allocated memory is still 163.6MB. Free memory was 119.9MB in the beginning and 118.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.93ms. Allocated memory is still 163.6MB. Free memory was 118.0MB in the beginning and 116.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 898.99ms. Allocated memory is still 163.6MB. Free memory was 116.5MB in the beginning and 78.3MB in the end (delta: 38.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 607056.84ms. Allocated memory was 163.6MB in the beginning and 775.9MB in the end (delta: 612.4MB). Free memory was 77.6MB in the beginning and 433.1MB in the end (delta: -355.5MB). Peak memory consumption was 433.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/config/GemCutterReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:22:28,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:22:28,583 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-11-08 12:22:28,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:22:28,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:22:28,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:22:28,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:22:28,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:22:28,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:22:28,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:22:28,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:22:28,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:22:28,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:22:28,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:22:28,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:22:28,637 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:22:28,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:22:28,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:22:28,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:22:28,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:22:28,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:22:28,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 12:22:28,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:22:28,643 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 12:22:28,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:22:28,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:22:28,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:22:28,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:22:28,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:22:28,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:22:28,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:22:28,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:22:28,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:22:28,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:22:28,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:22:28,648 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 12:22:28,648 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-08 12:22:28,649 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 12:22:28,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:22:28,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-08 12:22:28,650 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-08 12:22:28,651 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-08 12:22:28,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL 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(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25cf9c0a16564c460f6e824f90a2df4185d2e5d2c682a221258efaf06dec8ca4 [2024-11-08 12:22:29,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:22:29,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:22:29,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:22:29,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:22:29,137 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:22:29,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c Unable to find full path for "g++" [2024-11-08 12:22:31,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:22:31,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:22:31,539 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2024-11-08 12:22:31,550 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/data/b85e32d18/a6a59d1fa81f4918b563ee4453b14f23/FLAG460db2064 [2024-11-08 12:22:31,567 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/data/b85e32d18/a6a59d1fa81f4918b563ee4453b14f23 [2024-11-08 12:22:31,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:22:31,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:22:31,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:22:31,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:22:31,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:22:31,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:22:31" (1/1) ... [2024-11-08 12:22:31,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aff8c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:31, skipping insertion in model container [2024-11-08 12:22:31,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:22:31" (1/1) ... [2024-11-08 12:22:31,617 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:22:31,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2024-11-08 12:22:31,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:22:31,935 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:22:31,974 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2024-11-08 12:22:31,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:22:32,008 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:22:32,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32 WrapperNode [2024-11-08 12:22:32,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:22:32,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:22:32,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:22:32,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:22:32,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,034 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,066 INFO L138 Inliner]: procedures = 25, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2024-11-08 12:22:32,069 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:22:32,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:22:32,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:22:32,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:22:32,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:22:32,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:22:32,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:22:32,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:22:32,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (1/1) ... [2024-11-08 12:22:32,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:22:32,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:22:32,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-08 12:22:32,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-08 12:22:32,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:22:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 12:22:32,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 12:22:32,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 12:22:32,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 12:22:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 12:22:32,275 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 12:22:32,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-08 12:22:32,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-08 12:22:32,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-08 12:22:32,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 12:22:32,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-08 12:22:32,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:22:32,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:22:32,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-08 12:22:32,281 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 12:22:32,438 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:22:32,441 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:22:32,927 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 12:22:32,927 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:22:33,259 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:22:33,260 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 12:22:33,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:22:33 BoogieIcfgContainer [2024-11-08 12:22:33,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:22:33,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:22:33,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:22:33,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:22:33,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:22:31" (1/3) ... [2024-11-08 12:22:33,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212eeb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:22:33, skipping insertion in model container [2024-11-08 12:22:33,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:22:32" (2/3) ... [2024-11-08 12:22:33,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212eeb10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:22:33, skipping insertion in model container [2024-11-08 12:22:33,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:22:33" (3/3) ... [2024-11-08 12:22:33,278 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2024-11-08 12:22:33,300 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:22:33,300 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:22:33,301 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 12:22:33,373 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-08 12:22:33,437 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:22:33,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-08 12:22:33,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:22:33,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-08 12:22:33,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-08 12:22:33,486 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:22:33,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:22:33,510 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1afaeb75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:22:33,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-08 12:22:34,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:22:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash -175320955, now seen corresponding path program 1 times [2024-11-08 12:22:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:22:34,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456872398] [2024-11-08 12:22:34,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:34,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:34,334 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:22:34,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:22:34,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 12:22:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:34,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 12:22:34,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:22:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:22:34,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:22:34,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:22:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456872398] [2024-11-08 12:22:34,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456872398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:34,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:34,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:22:34,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910340317] [2024-11-08 12:22:34,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:34,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:22:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:22:34,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:22:34,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:22:34,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:34,856 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:22:34,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 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-11-08 12:22:34,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:34,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 12:22:35,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:35,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:22:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1988867967, now seen corresponding path program 1 times [2024-11-08 12:22:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:22:35,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427283781] [2024-11-08 12:22:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:35,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:35,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:22:35,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:22:35,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 12:22:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:35,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 12:22:35,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:22:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:22:35,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:22:35,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:22:35,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427283781] [2024-11-08 12:22:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427283781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:22:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453780807] [2024-11-08 12:22:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:35,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:22:35,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:22:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:22:35,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:22:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:35,395 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:22:35,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:22:35,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:35,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:22:35,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 12:22:35,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:35,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:22:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:35,767 INFO L85 PathProgramCache]: Analyzing trace with hash 529217469, now seen corresponding path program 1 times [2024-11-08 12:22:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:22:35,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846798918] [2024-11-08 12:22:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:35,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:35,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:22:35,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:22:35,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 12:22:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:35,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 12:22:35,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:22:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:22:35,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:22:35,943 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:22:35,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846798918] [2024-11-08 12:22:35,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846798918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:35,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 12:22:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024119864] [2024-11-08 12:22:35,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:35,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:22:35,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:22:35,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:22:35,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:22:35,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:35,946 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:22:35,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 12:22:35,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:35,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:22:35,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:22:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:22:36,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 12:22:36,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:36,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:22:36,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash -677354162, now seen corresponding path program 1 times [2024-11-08 12:22:36,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:22:36,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745268487] [2024-11-08 12:22:36,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:36,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:36,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:22:36,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:22:36,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 12:22:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:36,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 12:22:36,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:22:36,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 12:22:36,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:22:36,931 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:22:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745268487] [2024-11-08 12:22:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745268487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:22:36,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:22:36,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 12:22:36,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082760474] [2024-11-08 12:22:36,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:22:36,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 12:22:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:22:36,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 12:22:36,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 12:22:36,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:36,937 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:22:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 8 states have internal predecessors, (29), 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-11-08 12:22:36,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:36,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:22:36,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:22:36,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:22:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:22:37,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:22:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:22:37,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:22:37,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 12:22:37,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:37,610 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-08 12:22:37,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:22:37,610 INFO L85 PathProgramCache]: Analyzing trace with hash -846955254, now seen corresponding path program 1 times [2024-11-08 12:22:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 12:22:37,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163754563] [2024-11-08 12:22:37,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:22:37,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 12:22:37,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:22:37,613 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 12:22:37,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c04fa942-d6be-40a1-a432-f705d2bd6eb3/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 12:22:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:22:37,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 12:22:37,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:22:37,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 12:22:39,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:22:39,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2024-11-08 12:22:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:22:39,720 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 12:23:00,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 202 [2024-11-08 12:23:00,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 12:23:00,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 323 treesize of output 385 [2024-11-08 12:25:19,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 127 [2024-11-08 12:25:19,403 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-08 12:25:19,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 1 [2024-11-08 12:25:21,952 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|))) (let ((.cse32 (= (_ bv0 32) .cse3))) (let ((.cse50 (not .cse32)) (.cse29 (forall ((v_arrayElimCell_7 (_ BitVec 32))) (or (not (bvslt c_~max3~0 v_arrayElimCell_7)) (= v_arrayElimCell_7 c_~max1~0) (bvslt c_~max1~0 v_arrayElimCell_7))))) (let ((.cse15 (= (_ bv0 32) (bvadd c_~max1~0 (_ bv2147483648 32)))) (.cse299 (forall ((v_prenex_1 (_ BitVec 32))) (or (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (.cse528 (bvslt c_~max2~0 c_~max3~0)) (.cse36 (= c_~max1~0 c_~max2~0)) (.cse80 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58| (_ BitVec 32))) (or (bvslt c_~max1~0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58| c_~max1~0) (not (bvslt c_~max2~0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58|)) (not (bvslt c_~max3~0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58|))))) (.cse0 (forall ((v_arrayElimCell_7 (_ BitVec 32))) (or (not (bvslt c_~max3~0 v_arrayElimCell_7)) (not (bvslt c_~max2~0 v_arrayElimCell_7)) (= v_arrayElimCell_7 c_~max1~0) (bvslt c_~max1~0 v_arrayElimCell_7)))) (.cse348 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse574 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse574) (= (bvmul (_ bv4 32) v_prenex_2) .cse574) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse352 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (bvmul (_ bv4 32) v_prenex_2) (bvmul (_ bv4 32) v_prenex_1)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (.cse330 (forall ((v_prenex_1 (_ BitVec 32))) (or (= .cse3 (bvmul (_ bv4 32) v_prenex_1)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (.cse23 (and (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (or (not (bvslt c_~max3~0 v_arrayElimCell_7)) (= v_arrayElimCell_7 c_~max1~0))) .cse50) .cse29)) (.cse25 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58| (_ BitVec 32))) (or (bvslt c_~max1~0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58|) (= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58| c_~max1~0) (not (bvslt c_~max3~0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58|))))) (.cse516 (forall ((v_prenex_1 (_ BitVec 32))) (or (not (= .cse3 (bvmul (_ bv4 32) v_prenex_1))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (let ((.cse43 (bvsle c_~max2~0 c_~max3~0)) (.cse48 (bvsle c_~max1~0 c_~max3~0)) (.cse22 (or .cse25 .cse516)) (.cse28 (or .cse330 .cse23)) (.cse269 (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse572 (bvmul (_ bv4 32) v_prenex_1)) (.cse573 (bvmul ~M~0 (_ bv4 32)))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse572) (= .cse572 .cse573) (not (= .cse3 .cse572)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse573 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (.cse275 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse570 (bvmul (_ bv4 32) v_prenex_1)) (.cse571 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse570) (= (bvmul (_ bv4 32) v_prenex_2) .cse570) (= .cse570 .cse571) (not (bvslt v_prenex_1 c_~N~0)) (= .cse571 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse273 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse568 (bvmul (_ bv4 32) v_prenex_1)) (.cse569 (bvmul ~M~0 (_ bv4 32)))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse568) (= .cse568 .cse569) (not (bvslt v_prenex_1 c_~N~0)) (= .cse569 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse276 (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse567 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse565 (bvmul (_ bv4 32) v_prenex_3)) (.cse564 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse564 .cse565) (forall ((~M~0 (_ BitVec 32))) (let ((.cse566 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse566) (= .cse564 .cse566) (= .cse566 .cse565)))) (= .cse567 .cse564)))) (not (= .cse567 .cse3)) (not (bvslt v_prenex_2 c_~N~0)))))) (.cse277 (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse562 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse561 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse560 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse560 .cse561) (= .cse562 .cse560)))) (forall ((~M~0 (_ BitVec 32))) (let ((.cse563 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse563) (= .cse563 .cse561))))))) (not (bvsge v_prenex_2 (_ bv0 32))) (not (= .cse562 .cse3)) (not (bvslt v_prenex_2 c_~N~0)))))) (.cse258 (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse557 (bvmul (_ bv4 32) v_prenex_1)) (.cse559 (bvmul ~M~0 (_ bv4 32))) (.cse558 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse557 .cse558) (= (bvmul (_ bv4 32) v_prenex_2) .cse557) (= .cse557 .cse559) (not (= .cse3 .cse557)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse559 .cse558) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (.cse262 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse554 (bvmul (_ bv4 32) v_prenex_1)) (.cse556 (bvmul ~M~0 (_ bv4 32))) (.cse555 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse554) (= .cse554 .cse555) (= (bvmul (_ bv4 32) v_prenex_2) .cse554) (= .cse554 .cse556) (not (bvslt v_prenex_1 c_~N~0)) (= .cse556 .cse555) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse272 (or .cse352 .cse29)) (.cse261 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse551 (bvmul (_ bv4 32) v_prenex_1)) (.cse553 (bvmul ~M~0 (_ bv4 32))) (.cse552 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse551 .cse552) (= (bvmul (_ bv4 32) v_prenex_2) .cse551) (= .cse551 .cse553) (not (bvslt v_prenex_1 c_~N~0)) (= .cse553 .cse552) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse270 (or .cse348 .cse23)) (.cse271 (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse550 (bvmul (_ bv4 32) v_prenex_1))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse550) (not (= .cse3 .cse550)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (.cse51 (forall ((v_arrayElimCell_4 (_ BitVec 32))) (or (not (bvslt c_~max3~0 v_arrayElimCell_4)) (= v_arrayElimCell_4 c_~max1~0) (bvslt c_~max1~0 v_arrayElimCell_4)))) (.cse349 (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse547 (bvmul (_ bv4 32) v_prenex_1)) (.cse546 (bvmul (_ bv4 32) v_prenex_2)) (.cse548 (bvmul ~M~0 (_ bv4 32))) (.cse549 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse546 .cse547) (= .cse547 .cse548) (not (= .cse3 .cse547)) (= .cse546 .cse549) (not (bvslt v_prenex_1 c_~N~0)) (= .cse548 .cse549) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (.cse350 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse543 (bvmul (_ bv4 32) v_prenex_1)) (.cse542 (bvmul (_ bv4 32) v_prenex_2)) (.cse544 (bvmul ~M~0 (_ bv4 32))) (.cse545 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse542 .cse543) (= .cse543 .cse544) (= .cse542 .cse545) (not (bvslt v_prenex_1 c_~N~0)) (= .cse544 .cse545) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse341 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse538 (bvmul (_ bv4 32) v_prenex_1)) (.cse539 (bvmul (_ bv4 32) v_prenex_2)) (.cse540 (bvmul ~M~0 (_ bv4 32))) (.cse541 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse538) (= .cse539 .cse538) (= .cse538 .cse540) (= .cse539 .cse541) (not (bvslt v_prenex_1 c_~N~0)) (= .cse540 .cse541) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse42 (forall ((v_arrayElimCell_5 (_ BitVec 32))) (or (not (bvslt c_~max3~0 v_arrayElimCell_5)) (= v_arrayElimCell_5 c_~max1~0) (bvslt c_~max1~0 v_arrayElimCell_5)))) (.cse114 (forall ((v_prenex_2 (_ BitVec 32))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= (bvmul (_ bv4 32) v_prenex_2) .cse3) (not (bvslt v_prenex_2 c_~N~0))))) (.cse153 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse535 (bvmul (_ bv4 32) v_prenex_1)) (.cse537 (bvmul (_ bv4 32) v_prenex_2)) (.cse536 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse535 .cse536) (= .cse537 .cse535) (not (= .cse537 .cse3)) (= .cse537 .cse536) (= (bvmul ~M~0 (_ bv4 32)) .cse536) (not (bvslt v_prenex_2 c_~N~0)))))) (.cse17 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse532 (bvmul (_ bv4 32) v_prenex_1)) (.cse534 (bvmul (_ bv4 32) v_prenex_2)) (.cse533 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse532 .cse533) (= .cse534 .cse532) (not (= .cse534 .cse3)) (= .cse532 (bvmul ~M~0 (_ bv4 32))) (= .cse534 .cse533) (not (bvslt v_prenex_2 c_~N~0)))))) (.cse6 (and (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (or (not (bvslt c_~max3~0 v_arrayElimCell_7)) (not (bvslt c_~max2~0 v_arrayElimCell_7)) (= v_arrayElimCell_7 c_~max1~0))) .cse50) .cse0)) (.cse16 (and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58| (_ BitVec 32))) (or (= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58| c_~max1~0) (not (bvslt c_~max2~0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58|)) (not (bvslt c_~max3~0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58|)))) .cse32) .cse80)) (.cse331 (or .cse25 (and (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse529 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse529) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse530 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse531 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse530 .cse531) (= .cse531 .cse529)))) (not (= .cse3 .cse530)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))))) .cse516))) (.cse469 (and (not .cse528) .cse36)) (.cse474 (forall ((~M~0 (_ BitVec 32))) (or (= .cse3 (bvmul ~M~0 (_ bv4 32))) (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32)))))) (.cse478 (and (= c_~max3~0 c_~max1~0) .cse528)) (.cse31 (or .cse29 .cse299)) (.cse500 (or .cse15 .cse25 .cse516)) (.cse501 (or .cse15 .cse330 .cse23))) (and (or .cse0 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse1 (bvmul (_ bv4 32) v_prenex_1)) (.cse2 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse1 (bvmul (_ bv4 32) v_prenex_3)) (= .cse2 (bvmul ~M~0 (_ bv4 32))) (= .cse2 .cse1) (= .cse2 .cse3) (not (bvslt v_prenex_2 c_~N~0)))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse5 (bvmul (_ bv4 32) v_prenex_1)) (.cse4 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse4 .cse5) (= .cse5 (bvmul ~M~0 (_ bv4 32))) (= .cse4 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or (and (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse7 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((v_prenex_1 (_ BitVec 32))) (= .cse7 (bvmul (_ bv4 32) v_prenex_1))) (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse7 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse10 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse9 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse8 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse8) (= .cse9 .cse8) (= .cse8 (bvmul (_ bv4 32) v_prenex_3))))) (= .cse10 .cse9)))) (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse10 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse11 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse11 .cse3) (not (bvslt v_prenex_2 c_~N~0)) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse12 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse11 .cse12) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse14 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse13 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse13) (= .cse14 .cse13) (= .cse13 .cse12)))) (= .cse11 .cse14))))))))))) .cse0) (or .cse15 .cse16 .cse17) (or .cse0 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse18 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse18 (bvmul ~M~0 (_ bv4 32))) (= .cse18 .cse3) (not (bvslt v_prenex_2 c_~N~0)))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse19 (bvmul (_ bv4 32) v_prenex_1)) (.cse21 (bvmul (_ bv4 32) v_prenex_2)) (.cse20 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse19 .cse20) (= .cse21 .cse19) (= .cse21 .cse3) (= (_ bv0 32) .cse20) (= (bvmul ~M~0 (_ bv4 32)) .cse20) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or (and .cse22 (or .cse23 (forall ((~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse24 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse24) (= .cse24 (bvmul ~M~0 (_ bv4 32))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse25 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse26 (bvmul (_ bv4 32) v_prenex_1)) (.cse27 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse26 .cse27) (not (= .cse3 .cse26)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse27 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32))))))) .cse28 (or (and (or .cse29 (forall ((~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (bvmul (_ bv4 32) v_prenex_1) (bvmul ~M~0 (_ bv4 32))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse30 (bvmul ~M~0 (_ bv4 32)))) (or (= (bvmul (_ bv4 32) v_prenex_1) .cse30) (not (bvslt v_prenex_1 c_~N~0)) (= .cse30 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29) .cse31) .cse32) (or .cse25 (forall ((~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse33 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse33 (bvmul ~M~0 (_ bv4 32))) (not (= .cse3 .cse33)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse34 (bvmul (_ bv4 32) v_prenex_1)) (.cse35 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse34) (= .cse34 .cse35) (not (bvslt v_prenex_1 c_~N~0)) (= .cse35 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23)) .cse36) (or (let ((.cse41 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse62 (bvmul (_ bv4 32) v_prenex_2)) (.cse60 (bvmul (_ bv4 32) v_prenex_1)) (.cse63 (bvmul ~M~0 (_ bv4 32))) (.cse61 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse60) (= .cse60 .cse61) (= .cse62 .cse63) (= .cse62 .cse60) (= .cse60 .cse63) (not (bvslt v_prenex_1 c_~N~0)) (= .cse63 .cse61) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse49 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse58 (bvmul (_ bv4 32) v_prenex_2)) (.cse56 (bvmul (_ bv4 32) v_prenex_1)) (.cse59 (bvmul ~M~0 (_ bv4 32))) (.cse57 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse56 .cse57) (= .cse58 .cse59) (= .cse58 .cse56) (= .cse56 .cse59) (not (bvslt v_prenex_1 c_~N~0)) (= .cse59 .cse57) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (and (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse39 (bvmul (_ bv4 32) v_prenex_2)) (.cse37 (bvmul (_ bv4 32) v_prenex_1)) (.cse40 (bvmul ~M~0 (_ bv4 32))) (.cse38 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse37 .cse38) (= .cse39 .cse40) (= .cse39 .cse37) (= .cse37 .cse40) (not (= .cse3 .cse37)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse40 .cse38) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse41 .cse42) (or .cse43 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse46 (bvmul (_ bv4 32) v_prenex_2)) (.cse44 (bvmul (_ bv4 32) v_prenex_1)) (.cse47 (bvmul ~M~0 (_ bv4 32))) (.cse45 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse44 .cse45) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse46 .cse47) (= .cse46 .cse44) (= .cse44 .cse47) (= .cse3 .cse45) (not (bvslt v_prenex_3 c_~N~0)) (= .cse47 .cse45)))) .cse48) (or .cse49 .cse25 .cse50) (or .cse51 .cse41) (or .cse32 (and (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse54 (bvmul (_ bv4 32) v_prenex_2)) (.cse52 (bvmul (_ bv4 32) v_prenex_1)) (.cse55 (bvmul ~M~0 (_ bv4 32))) (.cse53 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse52 .cse53) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse54 .cse55) (= .cse54 .cse52) (= .cse52 .cse55) (not (bvslt v_prenex_3 c_~N~0)) (= .cse55 .cse53)))) .cse43 .cse48) (or .cse49 .cse42) (or .cse49 .cse51))))) .cse36) (or .cse15 .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse66 (bvmul (_ bv4 32) v_prenex_2)) (.cse64 (bvmul (_ bv4 32) v_prenex_1)) (.cse67 (bvmul ~M~0 (_ bv4 32))) (.cse65 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse64 .cse65) (= .cse66 .cse64) (not (= .cse66 .cse3)) (= .cse64 .cse67) (= (_ bv0 32) .cse65) (= .cse67 .cse65) (not (bvslt v_prenex_2 c_~N~0)))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse68 (bvmul (_ bv4 32) v_prenex_2)) (.cse69 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse68 (bvmul (_ bv4 32) v_prenex_1)) (= .cse68 .cse69) (= .cse68 .cse3) (= (bvmul ~M~0 (_ bv4 32)) .cse69) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse71 (bvmul (_ bv4 32) v_prenex_1)) (.cse70 (bvmul (_ bv4 32) v_prenex_2)) (.cse72 (bvmul ~M~0 (_ bv4 32))) (.cse73 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse70 .cse71) (= .cse71 .cse72) (= .cse70 .cse73) (= .cse70 .cse3) (= .cse72 .cse73) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (not (bvslt v_prenex_2 c_~N~0)) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse75 (bvmul (_ bv4 32) v_prenex_3)) (.cse74 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse74 .cse75) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse77 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse76 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse76) (= .cse77 .cse76) (= .cse76 .cse75)))) (= .cse74 .cse77))))))))) (forall ((v_prenex_2 (_ BitVec 32))) (or (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse79 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse78 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse78) (= .cse79 .cse78) (= .cse78 (bvmul (_ bv4 32) v_prenex_3))))) (= (bvmul (_ bv4 32) v_prenex_2) .cse79)))) (not (bvsge v_prenex_2 (_ bv0 32))) (not (bvslt v_prenex_2 c_~N~0)))) (forall ((v_prenex_2 (_ BitVec 32))) (or (forall ((v_prenex_1 (_ BitVec 32))) (= (bvmul (_ bv4 32) v_prenex_2) (bvmul (_ bv4 32) v_prenex_1))) (not (bvsge v_prenex_2 (_ bv0 32))) (not (bvslt v_prenex_2 c_~N~0))))) .cse50 .cse80) (or .cse15 .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse81 (bvmul (_ bv4 32) v_prenex_1)) (.cse83 (bvmul (_ bv4 32) v_prenex_2)) (.cse84 (bvmul ~M~0 (_ bv4 32))) (.cse82 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse81 .cse82) (= .cse83 .cse81) (not (= .cse83 .cse3)) (= .cse81 .cse84) (= .cse83 .cse82) (= .cse84 .cse82) (not (bvslt v_prenex_2 c_~N~0)))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32))) (let ((.cse85 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse85 (bvmul ~M~0 (_ bv4 32))) (not (= .cse85 .cse3)) (not (bvslt v_prenex_2 c_~N~0))))) .cse16) (or (let ((.cse86 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse93 (bvmul (_ bv4 32) v_prenex_2)) (.cse94 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse93 .cse94) (= .cse93 (bvmul (_ bv4 32) v_prenex_1)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse94 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (and (or .cse86 .cse32 .cse42) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse87 (bvmul (_ bv4 32) v_prenex_2)) (.cse89 (bvmul (_ bv4 32) v_prenex_1)) (.cse88 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse87 .cse88) (= .cse87 .cse89) (not (= .cse3 .cse89)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse88 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse86 .cse25 .cse50) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse91 (bvmul (_ bv4 32) v_prenex_2)) (.cse90 (bvmul (_ bv4 32) v_prenex_1)) (.cse92 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse90) (= .cse91 .cse92) (= .cse91 .cse90) (not (bvslt v_prenex_1 c_~N~0)) (= .cse92 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse42))) .cse36) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse96 (bvmul (_ bv4 32) v_prenex_2)) (.cse97 (bvmul ~M~0 (_ bv4 32))) (.cse95 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= (bvmul (_ bv4 32) v_prenex_1) .cse95) (= .cse96 .cse97) (not (= .cse96 .cse3)) (= .cse97 .cse95) (not (bvslt v_prenex_2 c_~N~0)))))) (or (and (or .cse43 (and (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse100 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse99 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse98 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse98) (= .cse99 .cse98)))) (= .cse99 .cse100)))) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse3 .cse100)) (not (bvslt v_prenex_3 c_~N~0))))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse102 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse101 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse101 .cse102) (forall ((~M~0 (_ BitVec 32))) (= .cse101 (bvmul ~M~0 (_ bv4 32))))))) (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse3 .cse102)) (not (bvslt v_prenex_3 c_~N~0)))))) .cse48) (or .cse32 (and (or .cse43 (and (forall ((v_prenex_3 (_ BitVec 32))) (or (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse103 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse103 (bvmul (_ bv4 32) v_prenex_3)) (forall ((~M~0 (_ BitVec 32))) (= .cse103 (bvmul ~M~0 (_ bv4 32))))))) (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0)))) (forall ((v_prenex_3 (_ BitVec 32))) (or (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse105 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse104 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse104) (= .cse105 .cse104)))) (= .cse105 (bvmul (_ bv4 32) v_prenex_3))))) (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0))))) .cse48) (or .cse43 (forall ((v_prenex_3 (_ BitVec 32))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0)))) .cse48) .cse31)) .cse22 (or (forall ((v_prenex_3 (_ BitVec 32))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse3 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_3 c_~N~0)))) .cse43 .cse48) .cse28 (or (forall ((v_prenex_3 (_ BitVec 32))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (not (= .cse3 (bvmul (_ bv4 32) v_prenex_3))) (not (bvslt v_prenex_3 c_~N~0)))) .cse43 .cse48) (or .cse43 .cse48 (and (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse107 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse106 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse106 .cse107) (forall ((~M~0 (_ BitVec 32))) (= .cse106 (bvmul ~M~0 (_ bv4 32))))))) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse3 .cse107) (not (bvslt v_prenex_3 c_~N~0))))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse110 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse109 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse108 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse108) (= .cse109 .cse108)))) (= .cse109 .cse110)))) (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse3 .cse110) (not (bvslt v_prenex_3 c_~N~0)))))))) .cse36) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse111 (bvmul (_ bv4 32) v_prenex_1)) (.cse113 (bvmul (_ bv4 32) v_prenex_2)) (.cse112 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse111 .cse112) (= .cse113 .cse111) (= .cse113 .cse112) (= .cse113 .cse3) (= (bvmul ~M~0 (_ bv4 32)) .cse112) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or .cse114 .cse0) (or (and (or .cse15 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse115 (bvmul (_ bv4 32) v_prenex_1)) (.cse116 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse115 .cse116) (not (= .cse3 .cse115)) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse116) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse25) (or (and (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse119 (bvmul (_ bv4 32) v_prenex_3)) (.cse117 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse118 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse117 .cse118) (= .cse118 .cse119)))) (= .cse117 .cse119) (not (= .cse3 .cse117)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse121 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse120 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse120 .cse121) (not (= .cse3 .cse120)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (forall ((~M~0 (_ BitVec 32))) (= (bvmul ~M~0 (_ bv4 32)) .cse121)))))) .cse25) (or .cse15 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse122 (bvmul (_ bv4 32) v_prenex_1)) (.cse124 (bvmul ~M~0 (_ bv4 32))) (.cse123 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse122 .cse123) (= .cse122 .cse124) (not (= .cse3 .cse122)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse124 .cse123) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse25) (or .cse15 .cse23 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse125 (bvmul (_ bv4 32) v_prenex_1)) (.cse126 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse125) (= .cse125 .cse126) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse126) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (and (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse127 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((~M~0 (_ BitVec 32))) (= (bvmul ~M~0 (_ bv4 32)) .cse127)) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse128 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse128) (= .cse128 .cse127) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse129 (bvmul (_ bv4 32) v_prenex_1)) (.cse131 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse130 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse129 .cse130) (= .cse130 .cse131)))) (= .cse3 .cse129) (= .cse129 .cse131) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) .cse23) (or (and (or .cse29 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse132 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_1) .cse132) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse132) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse133 (bvmul (_ bv4 32) v_prenex_1)) (.cse135 (bvmul ~M~0 (_ bv4 32))) (.cse134 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse133 .cse134) (= .cse133 .cse135) (not (bvslt v_prenex_1 c_~N~0)) (= .cse135 .cse134) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29)) .cse32) (or .cse15 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse136 (bvmul (_ bv4 32) v_prenex_1)) (.cse138 (bvmul ~M~0 (_ bv4 32))) (.cse137 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse136) (= .cse136 .cse137) (= .cse136 .cse138) (not (bvslt v_prenex_1 c_~N~0)) (= .cse138 .cse137) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23)) .cse36) (or (and (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse142 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse141 (bvmul (_ bv4 32) v_prenex_3)) (.cse139 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse140 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse139 .cse140) (= .cse140 .cse141)))) (= .cse139 .cse141) (= .cse142 .cse139)))) (not (= .cse142 .cse3)) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse144 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse143 (bvmul (_ bv4 32) v_prenex_1)) (.cse145 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse143 .cse144) (= .cse145 .cse143) (not (= .cse145 .cse3)) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((~M~0 (_ BitVec 32))) (= (bvmul ~M~0 (_ bv4 32)) .cse144))))) (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse147 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (forall ((~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse146 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse146 (bvmul (_ bv4 32) v_prenex_3)) (= .cse147 .cse146) (= .cse146 (bvmul ~M~0 (_ bv4 32)))))) (not (= .cse147 .cse3)) (not (bvslt v_prenex_2 c_~N~0)))))) .cse16) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse149 (bvmul (_ bv4 32) v_prenex_1)) (.cse148 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse148 .cse149) (not (= .cse148 .cse3)) (= .cse149 (bvmul ~M~0 (_ bv4 32))) (= .cse148 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_2 c_~N~0)))))) (or .cse15 .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse150 (bvmul (_ bv4 32) v_prenex_1)) (.cse152 (bvmul (_ bv4 32) v_prenex_2)) (.cse151 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse150 .cse151) (= .cse152 .cse150) (not (= .cse152 .cse3)) (= (_ bv0 32) .cse151) (= (bvmul ~M~0 (_ bv4 32)) .cse151) (not (bvslt v_prenex_2 c_~N~0)))))) (or .cse15 .cse153 .cse16) (or (let ((.cse160 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse161 (bvmul (_ bv4 32) v_prenex_2)) (.cse163 (bvmul (_ bv4 32) v_prenex_1)) (.cse162 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse161 .cse162) (= .cse161 .cse163) (= .cse163 .cse162) (not (bvslt v_prenex_1 c_~N~0)) (= .cse162 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (and (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse154 (bvmul (_ bv4 32) v_prenex_2)) (.cse156 (bvmul (_ bv4 32) v_prenex_1)) (.cse155 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse154 .cse155) (= .cse154 .cse156) (= .cse156 .cse155) (not (= .cse3 .cse156)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse155 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse158 (bvmul (_ bv4 32) v_prenex_2)) (.cse157 (bvmul (_ bv4 32) v_prenex_1)) (.cse159 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse157) (= .cse158 .cse159) (= .cse158 .cse157) (= .cse157 .cse159) (not (bvslt v_prenex_1 c_~N~0)) (= .cse159 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse42) (or .cse25 .cse160 .cse50) (or .cse160 .cse32 .cse42))) .cse36) (or (let ((.cse164 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse169 (bvmul ~M~0 (_ bv4 32)))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse169) (= (bvmul (_ bv4 32) v_prenex_1) .cse169) (not (bvslt v_prenex_1 c_~N~0)) (= .cse169 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (and (or .cse25 .cse164 .cse50) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse166 (bvmul (_ bv4 32) v_prenex_1)) (.cse165 (bvmul ~M~0 (_ bv4 32)))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse165) (= .cse166 .cse165) (not (= .cse3 .cse166)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse165 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse29 .cse164 .cse32) (or .cse29 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse167 (bvmul (_ bv4 32) v_prenex_1)) (.cse168 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse167) (= (bvmul (_ bv4 32) v_prenex_2) .cse168) (= .cse167 .cse168) (not (bvslt v_prenex_1 c_~N~0)) (= .cse168 (bvmul (_ bv4 32) v_prenex_3)) (not (bvsge v_prenex_1 (_ bv0 32))))))))) .cse36) (or (and (or .cse15 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse170 (bvmul (_ bv4 32) v_prenex_1)) (.cse171 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse170) (= .cse170 .cse171) (= (bvmul (_ bv4 32) v_prenex_2) .cse171) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse171) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or (and (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse174 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse172 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse173 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse172 .cse173) (= .cse173 .cse174)))) (= .cse3 .cse172) (= .cse172 .cse174) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= (bvmul (_ bv4 32) v_prenex_2) .cse174)))) (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse175 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse175) (forall ((~M~0 (_ BitVec 32))) (= (bvmul ~M~0 (_ bv4 32)) .cse175)) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse176 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse176) (= .cse176 .cse175) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))))))) .cse23) (or .cse32 (and (or .cse29 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse177 (bvmul (_ bv4 32) v_prenex_1)) (.cse179 (bvmul ~M~0 (_ bv4 32))) (.cse178 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse177 .cse178) (= .cse177 .cse179) (= (bvmul (_ bv4 32) v_prenex_2) .cse178) (not (bvslt v_prenex_1 c_~N~0)) (= .cse179 .cse178) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse180 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_1) .cse180) (= (bvmul (_ bv4 32) v_prenex_2) .cse180) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse180) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29))) (or .cse15 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse181 (bvmul (_ bv4 32) v_prenex_1)) (.cse183 (bvmul ~M~0 (_ bv4 32))) (.cse182 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse181) (= .cse181 .cse182) (= .cse181 .cse183) (= (bvmul (_ bv4 32) v_prenex_2) .cse182) (not (bvslt v_prenex_1 c_~N~0)) (= .cse183 .cse182) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or .cse25 (and (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse186 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse184 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse185 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse184 .cse185) (= .cse185 .cse186)))) (= .cse184 .cse186) (not (= .cse3 .cse184)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= (bvmul (_ bv4 32) v_prenex_2) .cse186)))) (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse188 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse187 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse187 .cse188) (not (= .cse3 .cse187)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= (bvmul (_ bv4 32) v_prenex_2) .cse188) (forall ((~M~0 (_ BitVec 32))) (= (bvmul ~M~0 (_ bv4 32)) .cse188))))))) (or .cse15 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse189 (bvmul (_ bv4 32) v_prenex_1)) (.cse190 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse189 .cse190) (not (= .cse3 .cse189)) (= (bvmul (_ bv4 32) v_prenex_2) .cse190) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse190) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse25) (or .cse15 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse191 (bvmul (_ bv4 32) v_prenex_1)) (.cse193 (bvmul ~M~0 (_ bv4 32))) (.cse192 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse191 .cse192) (= .cse191 .cse193) (not (= .cse3 .cse191)) (= (bvmul (_ bv4 32) v_prenex_2) .cse192) (not (bvslt v_prenex_1 c_~N~0)) (= .cse193 .cse192) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse25)) .cse36) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse194 (bvmul (_ bv4 32) v_prenex_1)) (.cse195 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse194 (bvmul (_ bv4 32) v_prenex_3)) (= .cse195 .cse194) (= .cse195 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) .cse0) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse197 (bvmul (_ bv4 32) v_prenex_1)) (.cse196 (bvmul (_ bv4 32) v_prenex_2)) (.cse198 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse196 .cse197) (= .cse197 .cse198) (= .cse196 .cse3) (= .cse198 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse199 (bvmul (_ bv4 32) v_prenex_1)) (.cse201 (bvmul (_ bv4 32) v_prenex_2)) (.cse200 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse199 .cse200) (= .cse201 .cse199) (= .cse199 (bvmul ~M~0 (_ bv4 32))) (= .cse201 .cse3) (= (_ bv0 32) .cse200) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or .cse16 (and (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse202 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (not (= .cse202 .cse3)) (not (bvslt v_prenex_2 c_~N~0)) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse203 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse202 .cse203) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse205 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse204 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse204) (= .cse205 .cse204) (= .cse204 .cse203)))) (= .cse202 .cse205)))))))))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse206 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((v_prenex_1 (_ BitVec 32))) (= .cse206 (bvmul (_ bv4 32) v_prenex_1))) (not (bvsge v_prenex_2 (_ bv0 32))) (not (= .cse206 .cse3)) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse209 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse208 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse207 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse207) (= .cse208 .cse207) (= .cse207 (bvmul (_ bv4 32) v_prenex_3))))) (= .cse209 .cse208)))) (not (bvsge v_prenex_2 (_ bv0 32))) (not (= .cse209 .cse3)) (not (bvslt v_prenex_2 c_~N~0))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse210 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse210 (bvmul ~M~0 (_ bv4 32))) (= .cse210 (bvmul (_ bv4 32) v_prenex_1)) (= .cse210 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) .cse0) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse211 (bvmul (_ bv4 32) v_prenex_1)) (.cse212 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse211 (bvmul (_ bv4 32) v_prenex_3)) (= .cse212 (bvmul ~M~0 (_ bv4 32))) (= .cse212 .cse211) (not (= .cse212 .cse3)) (not (bvslt v_prenex_2 c_~N~0)))))) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse213 (bvmul (_ bv4 32) v_prenex_2)) (.cse214 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse213 .cse214) (= .cse213 (bvmul (_ bv4 32) v_prenex_1)) (not (= .cse213 .cse3)) (= .cse214 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_2 c_~N~0)))))) (or (let ((.cse222 (and (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse253 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse253 (bvmul (_ bv4 32) v_prenex_3)) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse254 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse254 .cse253) (forall ((~M~0 (_ BitVec 32))) (= .cse254 (bvmul ~M~0 (_ bv4 32))))))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse255 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse255 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse257 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse256 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse256) (= .cse257 .cse256)))) (= .cse257 .cse255)))))))))) (and (or (and (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse215 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse3 .cse215) (not (bvslt v_prenex_3 c_~N~0)) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse216 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse216 .cse215) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse218 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse217 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse217) (= .cse218 .cse217)))) (= .cse218 .cse216)))))))))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse219 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (= .cse3 .cse219) (not (bvslt v_prenex_3 c_~N~0)) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse220 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse220 .cse219) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse221 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse221 .cse220) (forall ((~M~0 (_ BitVec 32))) (= .cse221 (bvmul ~M~0 (_ bv4 32)))))))))))))) .cse43 .cse48) (or .cse25 .cse50 .cse222) (or .cse42 (and (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse223 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse223) (= .cse223 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse225 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse224 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse224) (= .cse225 .cse224)))) (= .cse225 .cse223))))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse226 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse226) (= .cse226 (bvmul (_ bv4 32) v_prenex_3)) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse227 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse227 .cse226) (forall ((~M~0 (_ BitVec 32))) (= .cse227 (bvmul ~M~0 (_ bv4 32))))))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse229 (bvmul (_ bv4 32) v_prenex_2)) (.cse228 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse228 (bvmul (_ bv4 32) v_prenex_3)) (= .cse229 (bvmul ~M~0 (_ bv4 32))) (= .cse229 .cse228) (not (= .cse3 .cse228)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse25 (and (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse230 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse230 (bvmul (_ bv4 32) v_prenex_3)) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse231 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse231 .cse230) (forall ((~M~0 (_ BitVec 32))) (= .cse231 (bvmul ~M~0 (_ bv4 32))))))) (not (= .cse3 .cse230)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse232 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse232 (bvmul (_ bv4 32) v_prenex_3)) (not (= .cse3 .cse232)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse234 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse233 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse233) (= .cse234 .cse233)))) (= .cse234 .cse232))))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse236 (bvmul ~M~0 (_ bv4 32))) (.cse237 (bvmul (_ bv4 32) v_prenex_2)) (.cse235 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse235) (= (_ bv0 32) .cse236) (= .cse235 (bvmul (_ bv4 32) v_prenex_3)) (= .cse237 .cse236) (= .cse237 .cse235) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse51) (or (and (or .cse51 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse238 (bvmul ~M~0 (_ bv4 32))) (.cse240 (bvmul (_ bv4 32) v_prenex_2)) (.cse239 (bvmul (_ bv4 32) v_prenex_1))) (or (= (_ bv0 32) .cse238) (= .cse239 (bvmul (_ bv4 32) v_prenex_3)) (= .cse240 .cse238) (= .cse240 .cse239) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse242 (bvmul (_ bv4 32) v_prenex_2)) (.cse241 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse241 (bvmul (_ bv4 32) v_prenex_3)) (= .cse242 (bvmul ~M~0 (_ bv4 32))) (= .cse242 .cse241) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse42) (or .cse222 .cse42) (or (and (forall ((v_prenex_3 (_ BitVec 32))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0)) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse243 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse243 (bvmul (_ bv4 32) v_prenex_3)) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse244 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse244 .cse243) (forall ((~M~0 (_ BitVec 32))) (= .cse244 (bvmul ~M~0 (_ bv4 32)))))))))))) (forall ((v_prenex_3 (_ BitVec 32))) (or (not (bvsge v_prenex_3 (_ bv0 32))) (not (bvslt v_prenex_3 c_~N~0)) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse245 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse245 (bvmul (_ bv4 32) v_prenex_3)) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse247 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse246 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse246) (= .cse247 .cse246)))) (= .cse247 .cse245)))))))))) .cse43 .cse48)) .cse32) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse248 (bvmul ~M~0 (_ bv4 32))) (.cse250 (bvmul (_ bv4 32) v_prenex_2)) (.cse249 (bvmul (_ bv4 32) v_prenex_1))) (or (= (_ bv0 32) .cse248) (= .cse249 (bvmul (_ bv4 32) v_prenex_3)) (= .cse250 .cse248) (= .cse250 .cse249) (not (= .cse3 .cse249)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (and (or (forall ((v_arrayElimCell_5 (_ BitVec 32))) (or (not (bvslt c_~max3~0 v_arrayElimCell_5)) (= v_arrayElimCell_5 c_~max1~0))) .cse50) .cse42) (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse252 (bvmul (_ bv4 32) v_prenex_2)) (.cse251 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse251) (= .cse251 (bvmul (_ bv4 32) v_prenex_3)) (= .cse252 (bvmul ~M~0 (_ bv4 32))) (= .cse252 .cse251) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))))) .cse36) (or (and .cse258 (or (and (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse259 (bvmul (_ bv4 32) v_prenex_1)) (.cse260 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse259 .cse260) (= (bvmul (_ bv4 32) v_prenex_2) .cse259) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse260) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29) (or .cse29 .cse261)) .cse32) (or .cse23 .cse262) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse263 (bvmul (_ bv4 32) v_prenex_1)) (.cse264 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse263) (= .cse263 .cse264) (= (bvmul (_ bv4 32) v_prenex_2) .cse263) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse264) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse265 (bvmul (_ bv4 32) v_prenex_1)) (.cse266 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse265 .cse266) (= (bvmul (_ bv4 32) v_prenex_2) .cse265) (not (= .cse3 .cse265)) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse266) (not (bvsge v_prenex_1 (_ bv0 32)))))))) .cse36) (or (and (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse267 (bvmul (_ bv4 32) v_prenex_1))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse267) (= .cse267 (bvmul ~M~0 (_ bv4 32))) (not (= .cse3 .cse267)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse268 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse268) (= (bvmul (_ bv4 32) v_prenex_2) .cse268) (= .cse268 (bvmul ~M~0 (_ bv4 32))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) .cse269 .cse270 .cse271 (or (and .cse272 (or .cse29 .cse273) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse274 (bvmul (_ bv4 32) v_prenex_1))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse274) (= .cse274 (bvmul ~M~0 (_ bv4 32))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29)) .cse32) (or .cse275 .cse23)) .cse36) (or (and .cse276 .cse277) .cse80) (or (let ((.cse279 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse297 (bvmul ~M~0 (_ bv4 32))) (.cse298 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse297) (= (bvmul (_ bv4 32) v_prenex_1) .cse297) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse298) (= .cse297 .cse298) (not (bvsge v_prenex_1 (_ bv0 32))))))) (.cse278 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse294 (bvmul (_ bv4 32) v_prenex_2)) (.cse295 (bvmul ~M~0 (_ bv4 32))) (.cse296 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse294 .cse295) (= (bvmul (_ bv4 32) v_prenex_1) .cse295) (= .cse294 .cse296) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse296) (= .cse295 .cse296) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (and (or (and (or .cse278 .cse29) (or .cse29 .cse279)) .cse32) (or .cse25 .cse50 .cse279) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse282 (bvmul (_ bv4 32) v_prenex_1)) (.cse280 (bvmul (_ bv4 32) v_prenex_2)) (.cse281 (bvmul ~M~0 (_ bv4 32))) (.cse283 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse280 .cse281) (= .cse282 .cse281) (not (= .cse3 .cse282)) (= .cse280 .cse283) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse283) (= .cse281 .cse283) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse284 (bvmul (_ bv4 32) v_prenex_1)) (.cse285 (bvmul (_ bv4 32) v_prenex_2)) (.cse286 (bvmul ~M~0 (_ bv4 32))) (.cse287 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse284) (= .cse285 .cse286) (= .cse284 .cse286) (= .cse285 .cse287) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse287) (= .cse286 .cse287) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29) (or .cse29 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse288 (bvmul (_ bv4 32) v_prenex_1)) (.cse289 (bvmul ~M~0 (_ bv4 32))) (.cse290 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse288) (= (bvmul (_ bv4 32) v_prenex_2) .cse289) (= .cse288 .cse289) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse290) (= .cse289 .cse290) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse278 .cse25 .cse50) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse292 (bvmul (_ bv4 32) v_prenex_1)) (.cse291 (bvmul ~M~0 (_ bv4 32))) (.cse293 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse291) (= .cse292 .cse291) (not (= .cse3 .cse292)) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse293) (= .cse291 .cse293) (not (bvsge v_prenex_1 (_ bv0 32))))))))) .cse36) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (not (= (bvmul (_ bv4 32) v_prenex_2) .cse3)) (not (bvslt v_prenex_2 c_~N~0))))) (or (and .cse22 .cse28 (or .cse29 .cse299 .cse32)) .cse36) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse300 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse300 (bvmul ~M~0 (_ bv4 32))) (= .cse300 (bvmul (_ bv4 32) v_prenex_1)) (not (= .cse300 .cse3)) (not (bvslt v_prenex_2 c_~N~0)))))) (or (and (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse301 (bvmul (_ bv4 32) v_prenex_1)) (.cse303 (bvmul (_ bv4 32) v_prenex_2)) (.cse304 (bvmul ~M~0 (_ bv4 32))) (.cse302 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse301) (= .cse301 .cse302) (= .cse303 .cse301) (= .cse301 .cse304) (= .cse303 .cse302) (not (bvslt v_prenex_1 c_~N~0)) (= .cse304 .cse302) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse305 (bvmul (_ bv4 32) v_prenex_1)) (.cse307 (bvmul (_ bv4 32) v_prenex_2)) (.cse306 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse305) (= .cse305 .cse306) (= .cse307 .cse305) (= .cse307 .cse306) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse306) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse308 (bvmul (_ bv4 32) v_prenex_1)) (.cse310 (bvmul (_ bv4 32) v_prenex_2)) (.cse311 (bvmul ~M~0 (_ bv4 32))) (.cse309 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse308 .cse309) (= .cse310 .cse308) (= .cse308 .cse311) (not (= .cse3 .cse308)) (= .cse310 .cse309) (not (bvslt v_prenex_1 c_~N~0)) (= .cse311 .cse309) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse25) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse312 (bvmul (_ bv4 32) v_prenex_1)) (.cse314 (bvmul (_ bv4 32) v_prenex_2)) (.cse313 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse312 .cse313) (= .cse314 .cse312) (not (= .cse3 .cse312)) (= .cse314 .cse313) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse313) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (and (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse315 (bvmul (_ bv4 32) v_prenex_1)) (.cse317 (bvmul (_ bv4 32) v_prenex_2)) (.cse316 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse315 .cse316) (= .cse317 .cse315) (= .cse317 .cse316) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse316) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse318 (bvmul (_ bv4 32) v_prenex_1)) (.cse320 (bvmul (_ bv4 32) v_prenex_2)) (.cse321 (bvmul ~M~0 (_ bv4 32))) (.cse319 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse318 .cse319) (= .cse320 .cse318) (= .cse318 .cse321) (= .cse320 .cse319) (not (bvslt v_prenex_1 c_~N~0)) (= .cse321 .cse319) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29)) .cse32)) .cse36) (or .cse0 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse323 (bvmul (_ bv4 32) v_prenex_2)) (.cse324 (bvmul ~M~0 (_ bv4 32))) (.cse322 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= (bvmul (_ bv4 32) v_prenex_1) .cse322) (= .cse323 .cse324) (= .cse323 .cse3) (= .cse324 .cse322) (not (bvslt v_prenex_2 c_~N~0)))))) (or (and (or .cse29 (and .cse299 (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse326 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse325 (bvmul ~M~0 (_ bv4 32)))) (or (= (bvmul (_ bv4 32) v_prenex_1) .cse325) (not (bvslt v_prenex_1 c_~N~0)) (= .cse325 .cse326) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= (_ bv0 32) .cse326))))) .cse32) (or (and (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse329 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse327 (bvmul (_ bv4 32) v_prenex_1)) (.cse328 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse327) (= .cse327 .cse328) (not (bvslt v_prenex_1 c_~N~0)) (= .cse328 .cse329) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= (_ bv0 32) .cse329)))) .cse330) .cse23) .cse331) .cse36) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse332 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse332 (bvmul (_ bv4 32) v_prenex_1)) (= .cse332 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or (and (or .cse29 .cse32 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse334 (bvmul ~M~0 (_ bv4 32))) (.cse333 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_1) .cse333) (= (bvmul (_ bv4 32) v_prenex_2) .cse334) (not (bvslt v_prenex_1 c_~N~0)) (= .cse334 .cse333) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse335 (bvmul (_ bv4 32) v_prenex_1)) (.cse337 (bvmul ~M~0 (_ bv4 32))) (.cse336 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse335) (= .cse335 .cse336) (= (bvmul (_ bv4 32) v_prenex_2) .cse337) (not (bvslt v_prenex_1 c_~N~0)) (= .cse337 .cse336) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse338 (bvmul (_ bv4 32) v_prenex_1)) (.cse340 (bvmul ~M~0 (_ bv4 32))) (.cse339 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse338 .cse339) (= (bvmul (_ bv4 32) v_prenex_2) .cse340) (not (= .cse3 .cse338)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse340 .cse339) (not (bvsge v_prenex_1 (_ bv0 32)))))))) .cse36) (or (let ((.cse351 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse359 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse359 (bvmul (_ bv4 32) v_prenex_1)) (= .cse359 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (and (or .cse15 .cse341 .cse42) .cse269 (or .cse15 .cse275 .cse42) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse343 (bvmul (_ bv4 32) v_prenex_1)) (.cse342 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse342 .cse343) (not (= .cse3 .cse343)) (= .cse342 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse15 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse344 (bvmul (_ bv4 32) v_prenex_1)) (.cse345 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse3 .cse344) (= .cse345 .cse344) (= .cse345 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse42) (or (and (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse346 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse347 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse346 .cse347) (= .cse347 (bvmul (_ bv4 32) v_prenex_3))))) (= .cse3 .cse346) (= (bvmul (_ bv4 32) v_prenex_2) .cse346) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse348) .cse42) .cse349 (or .cse32 (and (or .cse42 .cse350) (or .cse351 .cse42))) (or .cse50 (and (or .cse25 .cse273) (or .cse25 .cse351) (or .cse352 .cse25) (or .cse25 .cse350))) (or .cse15 .cse348 .cse42) (or .cse32 (and (or .cse352 .cse42) (or .cse273 .cse42))) .cse271 (or (and (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse354 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse353 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse353) (= .cse354 .cse353) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= .cse354 (bvmul (_ bv4 32) v_prenex_3))))) (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse358 (bvmul (_ bv4 32) v_prenex_2)) (.cse357 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse355 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse356 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse355 .cse356) (= .cse356 .cse357)))) (= .cse3 .cse355) (= .cse358 .cse355) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= .cse358 .cse357))))) .cse42))) .cse36) (or (and .cse276 (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse360 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (not (= .cse360 .cse3)) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse361 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse361 (bvmul (_ bv4 32) v_prenex_3)) (= .cse360 .cse361)))) (not (bvslt v_prenex_2 c_~N~0))))) .cse277) .cse80) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse362 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse362 (bvmul (_ bv4 32) v_prenex_3)) (= .cse362 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or (let ((.cse368 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse382 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse382 (bvmul (_ bv4 32) v_prenex_3)) (= (bvmul (_ bv4 32) v_prenex_2) .cse382) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (and .cse258 (or .cse25 .cse261 .cse50) (or .cse51 .cse262) (or .cse42 .cse262) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse363 (bvmul (_ bv4 32) v_prenex_1)) (.cse365 (bvmul (_ bv4 32) v_prenex_2)) (.cse364 (bvmul ~M~0 (_ bv4 32))) (.cse366 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse363) (= (_ bv0 32) .cse364) (= .cse365 .cse363) (= .cse365 .cse366) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse366) (= .cse364 .cse366) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse367 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse367 (bvmul (_ bv4 32) v_prenex_3)) (= (bvmul (_ bv4 32) v_prenex_2) .cse367) (not (= .cse3 .cse367)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse25) (or .cse25 .cse50 .cse368) (or (and .cse272 (or .cse261 .cse42) (or .cse51 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse369 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse369 (bvmul (_ bv4 32) v_prenex_3)) (= (bvmul (_ bv4 32) v_prenex_2) .cse369) (= .cse369 (bvmul ~M~0 (_ bv4 32))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse29 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse371 (bvmul (_ bv4 32) v_prenex_2)) (.cse370 (bvmul ~M~0 (_ bv4 32))) (.cse372 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse370) (= .cse371 (bvmul (_ bv4 32) v_prenex_1)) (= .cse371 .cse372) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse372) (= .cse370 .cse372) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse51 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse373 (bvmul (_ bv4 32) v_prenex_1)) (.cse375 (bvmul ~M~0 (_ bv4 32))) (.cse374 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse373 .cse374) (= (bvmul (_ bv4 32) v_prenex_2) .cse373) (= .cse373 .cse375) (not (bvslt v_prenex_1 c_~N~0)) (= .cse375 .cse374) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse29 .cse368)) .cse32) (or .cse51 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse376 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse376) (= .cse376 (bvmul (_ bv4 32) v_prenex_3)) (= (bvmul (_ bv4 32) v_prenex_2) .cse376) (= .cse376 (bvmul ~M~0 (_ bv4 32))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse379 (bvmul (_ bv4 32) v_prenex_1)) (.cse378 (bvmul (_ bv4 32) v_prenex_2)) (.cse377 (bvmul ~M~0 (_ bv4 32))) (.cse380 (bvmul (_ bv4 32) v_prenex_3))) (or (= (_ bv0 32) .cse377) (= .cse378 .cse379) (not (= .cse3 .cse379)) (= .cse378 .cse380) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse380) (= .cse377 .cse380) (not (bvsge v_prenex_1 (_ bv0 32))))))) .cse270 (or .cse29 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse381 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse381) (= .cse381 (bvmul (_ bv4 32) v_prenex_3)) (= (bvmul (_ bv4 32) v_prenex_2) .cse381) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) .cse271)) .cse36) (or (and (or (and .cse25 (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58| (_ BitVec 32))) (or (= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58| c_~max1~0) (not (bvslt c_~max3~0 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet20#1_58|)))) .cse32)) (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse385 (bvmul (_ bv4 32) v_prenex_2)) (.cse383 (bvmul (_ bv4 32) v_prenex_1)) (.cse386 (bvmul ~M~0 (_ bv4 32))) (.cse384 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse383 .cse384) (= .cse385 .cse386) (= .cse385 .cse383) (not (= .cse3 .cse383)) (not (bvslt v_prenex_1 c_~N~0)) (= .cse386 .cse384) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse51 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse389 (bvmul (_ bv4 32) v_prenex_2)) (.cse387 (bvmul (_ bv4 32) v_prenex_1)) (.cse390 (bvmul ~M~0 (_ bv4 32))) (.cse388 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse387) (= .cse387 .cse388) (= .cse389 .cse390) (= .cse389 .cse387) (not (bvslt v_prenex_1 c_~N~0)) (= .cse390 .cse388) (not (bvsge v_prenex_1 (_ bv0 32)))))))) .cse36) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse391 (bvmul (_ bv4 32) v_prenex_2)) (.cse392 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse391 .cse392) (= .cse391 (bvmul (_ bv4 32) v_prenex_1)) (= .cse391 .cse3) (= .cse392 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_2 c_~N~0))))) .cse0) (or .cse15 .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse395 (bvmul (_ bv4 32) v_prenex_2)) (.cse393 (bvmul (_ bv4 32) v_prenex_1)) (.cse394 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse393 .cse394) (= .cse395 .cse393) (not (= .cse395 .cse3)) (= .cse393 (bvmul ~M~0 (_ bv4 32))) (= (_ bv0 32) .cse394) (not (bvslt v_prenex_2 c_~N~0)))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse396 (bvmul (_ bv4 32) v_prenex_1)) (.cse397 (bvmul (_ bv4 32) v_prenex_3)) (.cse398 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse396 .cse397) (= .cse398 .cse396) (= .cse396 (bvmul ~M~0 (_ bv4 32))) (= .cse398 .cse397) (= .cse398 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse399 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (not (= .cse399 .cse3)) (= .cse399 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_2 c_~N~0))))) .cse16) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse401 (bvmul (_ bv4 32) v_prenex_1)) (.cse400 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse400 .cse401) (= .cse401 (bvmul ~M~0 (_ bv4 32))) (= .cse400 (bvmul (_ bv4 32) v_prenex_3)) (= .cse400 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or .cse36 (and (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse403 (bvmul (_ bv4 32) v_prenex_1)) (.cse402 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse402 .cse403) (= .cse403 (bvmul ~M~0 (_ bv4 32))) (not (= .cse3 .cse403)) (= .cse402 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse405 (bvmul (_ bv4 32) v_prenex_1)) (.cse404 (bvmul (_ bv4 32) v_prenex_2)) (.cse406 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse404 .cse405) (not (= .cse3 .cse405)) (= .cse404 .cse406) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse406) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse407 (bvmul (_ bv4 32) v_prenex_1)) (.cse408 (bvmul (_ bv4 32) v_prenex_2)) (.cse409 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse407) (= .cse408 .cse407) (= .cse408 .cse409) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse409) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) .cse349 (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse410 (bvmul (_ bv4 32) v_prenex_1)) (.cse411 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse3 .cse410) (= .cse411 .cse410) (= .cse410 (bvmul ~M~0 (_ bv4 32))) (= .cse411 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or .cse32 (and (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse413 (bvmul (_ bv4 32) v_prenex_1)) (.cse412 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse412 .cse413) (= .cse413 (bvmul ~M~0 (_ bv4 32))) (= .cse412 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29) (or .cse29 .cse350) (or .cse29 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse414 (bvmul (_ bv4 32) v_prenex_2)) (.cse415 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse414 (bvmul (_ bv4 32) v_prenex_1)) (= .cse414 .cse415) (not (bvslt v_prenex_1 c_~N~0)) (= (bvmul ~M~0 (_ bv4 32)) .cse415) (not (bvsge v_prenex_1 (_ bv0 32))))))))) (or .cse341 .cse23))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse416 (bvmul (_ bv4 32) v_prenex_1)) (.cse418 (bvmul (_ bv4 32) v_prenex_2)) (.cse419 (bvmul ~M~0 (_ bv4 32))) (.cse417 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse416 .cse417) (= .cse418 .cse416) (= .cse416 .cse419) (= .cse418 .cse417) (= .cse418 .cse3) (= .cse419 .cse417) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse420 (bvmul (_ bv4 32) v_prenex_2)) (.cse421 (bvmul (_ bv4 32) v_prenex_1))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse420 .cse421) (not (= .cse420 .cse3)) (= .cse421 (bvmul ~M~0 (_ bv4 32))) (not (bvslt v_prenex_2 c_~N~0)))))) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse422 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse422 (bvmul (_ bv4 32) v_prenex_1)) (not (= .cse422 .cse3)) (not (bvslt v_prenex_2 c_~N~0)))))) (or .cse16 (and (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse423 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (not (= .cse423 .cse3)) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse424 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (= (bvmul (_ bv4 32) v_prenex_1) .cse424)) (= .cse423 .cse424) (forall ((~M~0 (_ BitVec 32))) (= (bvmul ~M~0 (_ bv4 32)) .cse424))))) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse428 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse427 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse425 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse426 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse425 .cse426) (= .cse426 .cse427)))) (= .cse425 .cse427)))) (= .cse428 .cse427)))) (not (= .cse428 .cse3)) (not (bvslt v_prenex_2 c_~N~0))))))) (or (and (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse430 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (forall ((~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse429 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse429 (bvmul (_ bv4 32) v_prenex_3)) (= .cse430 .cse429) (= .cse429 (bvmul ~M~0 (_ bv4 32)))))) (= .cse430 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse434 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse433 (bvmul (_ bv4 32) v_prenex_3)) (.cse431 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse432 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse431 .cse432) (= .cse432 .cse433)))) (= .cse431 .cse433) (= .cse434 .cse431)))) (= .cse434 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse436 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse435 (bvmul (_ bv4 32) v_prenex_1)) (.cse437 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse435 .cse436) (= .cse437 .cse435) (= .cse437 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((~M~0 (_ BitVec 32))) (= (bvmul ~M~0 (_ bv4 32)) .cse436)))))) .cse6) (or (and (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse441 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse440 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse438 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse439 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse438 .cse439) (= .cse439 .cse440)))) (= .cse438 .cse440)))) (= .cse441 .cse440)))) (= .cse441 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse442 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse442 .cse3) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse443 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (= (bvmul (_ bv4 32) v_prenex_1) .cse443)) (= .cse442 .cse443) (forall ((~M~0 (_ BitVec 32))) (= (bvmul ~M~0 (_ bv4 32)) .cse443))))) (not (bvslt v_prenex_2 c_~N~0)))))) .cse6) (or .cse36 (let ((.cse449 (and (forall ((v_prenex_1 (_ BitVec 32))) (or (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse456 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse455 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse455) (= .cse456 .cse455)))) (= .cse456 (bvmul (_ bv4 32) v_prenex_1))))))) (forall ((v_prenex_1 (_ BitVec 32))) (or (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse457 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse457 (bvmul (_ bv4 32) v_prenex_1)) (forall ((~M~0 (_ BitVec 32))) (= .cse457 (bvmul ~M~0 (_ bv4 32))))))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (and (or (and (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse444 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse444) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse446 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse445 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse445) (= .cse446 .cse445)))) (= .cse446 .cse444))))))) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse447 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse3 .cse447) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse448 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse448 .cse447) (forall ((~M~0 (_ BitVec 32))) (= .cse448 (bvmul ~M~0 (_ bv4 32))))))) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))))))) .cse42) (or .cse449 .cse25 .cse50) (or .cse25 (and (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse450 (bvmul (_ bv4 32) v_prenex_1))) (or (not (= .cse3 .cse450)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse452 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse451 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse451) (= .cse452 .cse451)))) (= .cse452 .cse450))))))) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse454 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse453 (bvmul (_ bv4 32) v_prenex_2))) (or (= .cse453 .cse454) (forall ((~M~0 (_ BitVec 32))) (= .cse453 (bvmul ~M~0 (_ bv4 32))))))) (not (= .cse3 .cse454)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))))) (or .cse449 .cse32 .cse42)))) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse458 (bvmul (_ bv4 32) v_prenex_2)) (.cse459 (bvmul (_ bv4 32) v_prenex_1)) (.cse460 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse458 .cse459) (not (= .cse458 .cse3)) (= .cse459 .cse460) (= .cse460 (bvmul (_ bv4 32) v_prenex_3)) (not (bvslt v_prenex_2 c_~N~0)))))) (or .cse114 .cse6) (or .cse16 (and .cse153 .cse17 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse461 (bvmul (_ bv4 32) v_prenex_1)) (.cse463 (bvmul (_ bv4 32) v_prenex_2)) (.cse464 (bvmul ~M~0 (_ bv4 32))) (.cse462 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse461 .cse462) (= .cse463 .cse461) (not (= .cse463 .cse3)) (= .cse461 .cse464) (= .cse463 .cse462) (= .cse464 .cse462) (not (bvslt v_prenex_2 c_~N~0))))))) (or (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse465 (bvmul (_ bv4 32) v_prenex_1)) (.cse467 (bvmul (_ bv4 32) v_prenex_2)) (.cse468 (bvmul ~M~0 (_ bv4 32))) (.cse466 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse465 .cse466) (= .cse467 .cse465) (= .cse465 .cse468) (= .cse467 .cse3) (= (_ bv0 32) .cse466) (= .cse468 .cse466) (not (bvslt v_prenex_2 c_~N~0))))) .cse6) (or .cse469 (and (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse470 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse470 (bvmul (_ bv4 32) v_prenex_3)) (forall ((~M~0 (_ BitVec 32))) (let ((.cse471 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse471) (not (bvslt ~M~0 c_~N~0)) (= .cse470 .cse471) (not (bvsge ~M~0 (_ bv0 32))))))))) (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse472 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (= (bvmul (_ bv4 32) v_prenex_1) .cse472)) (forall ((~M~0 (_ BitVec 32))) (let ((.cse473 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse473) (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32))) (= .cse473 .cse472))))))) .cse474 (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse475 (bvmul (_ bv4 32) v_prenex_1)) (.cse476 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse475 .cse476) (forall ((~M~0 (_ BitVec 32))) (let ((.cse477 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse477) (not (bvslt ~M~0 c_~N~0)) (= .cse475 .cse477) (not (bvsge ~M~0 (_ bv0 32))) (= .cse477 .cse476)))))))) .cse478) (or .cse80 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse479 (bvmul (_ bv4 32) v_prenex_1)) (.cse480 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse479 (bvmul (_ bv4 32) v_prenex_3)) (= .cse480 .cse479) (not (= .cse480 .cse3)) (not (bvslt v_prenex_2 c_~N~0)))))) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse482 (bvmul (_ bv4 32) v_prenex_1)) (.cse481 (bvmul (_ bv4 32) v_prenex_2)) (.cse483 (bvmul ~M~0 (_ bv4 32))) (.cse484 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse481 .cse482) (not (= .cse481 .cse3)) (= .cse482 .cse483) (= .cse481 .cse484) (= .cse483 .cse484) (not (bvslt v_prenex_2 c_~N~0)))))) (or .cse16 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse485 (bvmul (_ bv4 32) v_prenex_2)) (.cse486 (bvmul (_ bv4 32) v_prenex_3))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse485 (bvmul (_ bv4 32) v_prenex_1)) (not (= .cse485 .cse3)) (= .cse485 .cse486) (= (bvmul ~M~0 (_ bv4 32)) .cse486) (not (bvslt v_prenex_2 c_~N~0)))))) (or (and (bvsle c_~N~0 (_ bv0 32)) (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse487 (bvmul (_ bv4 32) v_prenex_1)) (.cse488 (bvmul ~M~0 (_ bv4 32)))) (or (not (bvslt ~M~0 c_~N~0)) (= (bvmul (_ bv4 32) v_prenex_2) .cse487) (= .cse487 .cse488) (not (bvsge ~M~0 (_ bv0 32))) (= .cse488 (bvmul (_ bv4 32) v_prenex_3))))) (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (or (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32))) (= (bvmul ~M~0 (_ bv4 32)) (bvmul (_ bv4 32) v_prenex_3)))) (forall ((~M~0 (_ BitVec 32))) (or (not (bvslt ~M~0 c_~N~0)) (not (bvsge ~M~0 (_ bv0 32)))))) .cse469 .cse478) (or (and (or (and (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse491 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse489 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse490 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse489 .cse490) (= .cse490 .cse491)))) (= .cse3 .cse489) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= (_ bv0 32) .cse491)))) .cse330) .cse23) (or .cse15 .cse25 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse492 (bvmul (_ bv4 32) v_prenex_1)) (.cse493 (bvmul ~M~0 (_ bv4 32))) (.cse494 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse492 .cse493) (not (= .cse3 .cse492)) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse494) (= .cse493 .cse494) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (and (or (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse495 (bvmul ~M~0 (_ bv4 32))) (.cse496 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_1) .cse495) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse496) (= .cse495 .cse496) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse29) .cse31) .cse32) (or .cse15 (forall ((~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse497 (bvmul (_ bv4 32) v_prenex_1)) (.cse498 (bvmul ~M~0 (_ bv4 32))) (.cse499 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse497) (= .cse497 .cse498) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse499) (= .cse498 .cse499) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) .cse500 .cse501 .cse331) .cse36) (or .cse469 (and (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse503 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse502 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse502 .cse503) (forall ((~M~0 (_ BitVec 32))) (let ((.cse504 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse3 .cse504) (not (bvslt ~M~0 c_~N~0)) (= .cse502 .cse504) (not (bvsge ~M~0 (_ bv0 32))))))))) (= (bvmul (_ bv4 32) v_prenex_2) .cse503) (= (_ bv0 32) .cse503)))) .cse474) .cse478) (or (and (or .cse15 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse505 (bvmul (_ bv4 32) v_prenex_1)) (.cse506 (bvmul ~M~0 (_ bv4 32))) (.cse507 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse3 .cse505) (= .cse505 .cse506) (= (bvmul (_ bv4 32) v_prenex_2) .cse507) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse507) (= .cse506 .cse507) (not (bvsge v_prenex_1 (_ bv0 32)))))) .cse23) (or .cse15 .cse25 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse508 (bvmul (_ bv4 32) v_prenex_1)) (.cse509 (bvmul ~M~0 (_ bv4 32))) (.cse510 (bvmul (_ bv4 32) v_prenex_3))) (or (= .cse508 .cse509) (not (= .cse3 .cse508)) (= (bvmul (_ bv4 32) v_prenex_2) .cse510) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse510) (= .cse509 .cse510) (not (bvsge v_prenex_1 (_ bv0 32))))))) (or (and (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse513 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse511 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse512 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse511 .cse512) (= .cse512 .cse513)))) (= .cse3 .cse511) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))) (= (bvmul (_ bv4 32) v_prenex_2) .cse513) (= (_ bv0 32) .cse513)))) .cse330) .cse23) (or (and .cse31 (or .cse29 (forall ((v_prenex_2 (_ BitVec 32)) (~M~0 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse514 (bvmul ~M~0 (_ bv4 32))) (.cse515 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_1) .cse514) (= (bvmul (_ bv4 32) v_prenex_2) .cse515) (not (bvslt v_prenex_1 c_~N~0)) (= (_ bv0 32) .cse515) (= .cse514 .cse515) (not (bvsge v_prenex_1 (_ bv0 32)))))))) .cse32) .cse500 (or (and .cse516 (forall ((v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse517 (bvmul (_ bv4 32) v_prenex_3))) (or (= (bvmul (_ bv4 32) v_prenex_2) .cse517) (= (_ bv0 32) .cse517) (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse518 (bvmul (_ bv4 32) v_prenex_1))) (or (forall ((~M~0 (_ BitVec 32))) (let ((.cse519 (bvmul ~M~0 (_ bv4 32)))) (or (= .cse518 .cse519) (= .cse519 .cse517)))) (not (= .cse3 .cse518)) (not (bvslt v_prenex_1 c_~N~0)) (not (bvsge v_prenex_1 (_ bv0 32)))))))))) .cse25) .cse501) .cse36) (or (and (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse522 (bvmul (_ bv4 32) v_prenex_2))) (or (forall ((v_prenex_3 (_ BitVec 32))) (let ((.cse521 (bvmul (_ bv4 32) v_prenex_3))) (or (forall ((v_prenex_1 (_ BitVec 32))) (let ((.cse520 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse520 .cse521) (= .cse522 .cse520)))) (forall ((~M~0 (_ BitVec 32))) (let ((.cse523 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse523) (= .cse523 .cse521))))))) (not (bvsge v_prenex_2 (_ bv0 32))) (= .cse522 .cse3) (not (bvslt v_prenex_2 c_~N~0))))) (forall ((v_prenex_2 (_ BitVec 32))) (let ((.cse527 (bvmul (_ bv4 32) v_prenex_2))) (or (not (bvsge v_prenex_2 (_ bv0 32))) (forall ((v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse525 (bvmul (_ bv4 32) v_prenex_3)) (.cse524 (bvmul (_ bv4 32) v_prenex_1))) (or (= .cse524 .cse525) (forall ((~M~0 (_ BitVec 32))) (let ((.cse526 (bvmul ~M~0 (_ bv4 32)))) (or (= (_ bv0 32) .cse526) (= .cse524 .cse526) (= .cse526 .cse525)))) (= .cse527 .cse524)))) (= .cse527 .cse3) (not (bvslt v_prenex_2 c_~N~0)))))) .cse0))))))) (bvslt (_ bv1 32) c_~N~0)) is different from true [2024-11-08 12:26:20,689 WARN L286 SmtUtils]: Spent 12.87s on a formula simplification. DAG size of input: 834 DAG size of output: 15 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 12:26:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:26:20,697 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 12:26:20,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163754563] [2024-11-08 12:26:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163754563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 12:26:20,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 12:26:20,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2024-11-08 12:26:20,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78604722] [2024-11-08 12:26:20,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 12:26:20,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 12:26:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 12:26:20,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 12:26:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=327, Unknown=9, NotChecked=38, Total=462 [2024-11-08 12:26:20,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:26:20,706 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:26:20,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 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-11-08 12:26:20,706 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:26:20,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:26:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:26:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-11-08 12:26:20,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:26:24,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 12:26:26,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1]