./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:29:58,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:29:58,502 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 17:29:58,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:29:58,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:29:58,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:29:58,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:29:58,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:29:58,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:29:58,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:29:58,536 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:29:58,536 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:29:58,537 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:29:58,537 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 17:29:58,538 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:29:58,539 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:29:58,539 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 17:29:58,540 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 17:29:58,540 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:29:58,541 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 17:29:58,541 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 17:29:58,542 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 17:29:58,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:29:58,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:29:58,543 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:29:58,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 17:29:58,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:29:58,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:29:58,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:29:58,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:29:58,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:29:58,547 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:29:58,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:29:58,548 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:29:58,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:29:58,548 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:29:58,548 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:29:58,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:29:58,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:29:58,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:29:58,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:29:58,549 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 17:29:58,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 17:29:58,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:29:58,550 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:29:58,550 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:29:58,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:29:58,550 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2023-12-02 17:29:58,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:29:58,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:29:58,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:29:58,802 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:29:58,802 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:29:58,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2023-12-02 17:30:01,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:30:01,695 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:30:01,695 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2023-12-02 17:30:01,702 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/data/6aa37cddd/a29b3874a0b545f882385de5bd832cc0/FLAG03defd6d0 [2023-12-02 17:30:01,713 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/data/6aa37cddd/a29b3874a0b545f882385de5bd832cc0 [2023-12-02 17:30:01,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:30:01,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:30:01,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:01,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:30:01,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:30:01,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:01,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d255845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01, skipping insertion in model container [2023-12-02 17:30:01,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:01,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:30:01,900 WARN L240 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-12-02 17:30:01,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:01,922 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:30:01,945 WARN L240 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-12-02 17:30:01,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:30:01,958 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 17:30:01,959 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 17:30:01,967 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:30:01,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01 WrapperNode [2023-12-02 17:30:01,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:30:01,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:01,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:30:01,969 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:30:01,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:01,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,016 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 282 [2023-12-02 17:30:02,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:30:02,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:30:02,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:30:02,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:30:02,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:30:02,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:30:02,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:30:02,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:30:02,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (1/1) ... [2023-12-02 17:30:02,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:30:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:02,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:30:02,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:30:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:30:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:30:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 17:30:02,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 17:30:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 17:30:02,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 17:30:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 17:30:02,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 17:30:02,135 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 17:30:02,135 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 17:30:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 17:30:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 17:30:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 17:30:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:30:02,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:30:02,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:30:02,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:30:02,138 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 17:30:02,242 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:30:02,244 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:30:02,622 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:30:03,055 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:30:03,056 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 17:30:03,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:03 BoogieIcfgContainer [2023-12-02 17:30:03,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:30:03,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:30:03,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:30:03,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:30:03,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:30:01" (1/3) ... [2023-12-02 17:30:03,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc78351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:30:03, skipping insertion in model container [2023-12-02 17:30:03,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:30:01" (2/3) ... [2023-12-02 17:30:03,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc78351 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:30:03, skipping insertion in model container [2023-12-02 17:30:03,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:30:03" (3/3) ... [2023-12-02 17:30:03,065 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2023-12-02 17:30:03,074 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 17:30:03,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:30:03,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:30:03,085 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 17:30:03,141 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 17:30:03,171 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 37 transitions, 95 flow [2023-12-02 17:30:03,235 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 377 states, 376 states have (on average 3.25531914893617) internal successors, (1224), 376 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:03,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:30:03,262 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@1d761543, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:30:03,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 17:30:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 377 states, 376 states have (on average 3.25531914893617) internal successors, (1224), 376 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 17:30:03,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:03,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:03,284 INFO L420 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)] === [2023-12-02 17:30:03,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1692316083, now seen corresponding path program 1 times [2023-12-02 17:30:03,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:03,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712543636] [2023-12-02 17:30:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:03,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:03,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712543636] [2023-12-02 17:30:03,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712543636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:30:03,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:30:03,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513511152] [2023-12-02 17:30:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:03,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:30:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:03,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:30:03,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:30:03,772 INFO L87 Difference]: Start difference. First operand has 377 states, 376 states have (on average 3.25531914893617) internal successors, (1224), 376 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:03,904 INFO L93 Difference]: Finished difference Result 380 states and 1227 transitions. [2023-12-02 17:30:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:30:03,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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) Word has length 22 [2023-12-02 17:30:03,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:03,921 INFO L225 Difference]: With dead ends: 380 [2023-12-02 17:30:03,921 INFO L226 Difference]: Without dead ends: 379 [2023-12-02 17:30:03,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:30:03,925 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:03,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:30:03,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-12-02 17:30:03,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2023-12-02 17:30:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.2433862433862433) internal successors, (1226), 378 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:03,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1226 transitions. [2023-12-02 17:30:03,996 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 1226 transitions. Word has length 22 [2023-12-02 17:30:03,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:03,996 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 1226 transitions. [2023-12-02 17:30:03,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:03,997 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 1226 transitions. [2023-12-02 17:30:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 17:30:04,001 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:04,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:04,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 17:30:04,002 INFO L420 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)] === [2023-12-02 17:30:04,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1836206963, now seen corresponding path program 1 times [2023-12-02 17:30:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:04,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869932989] [2023-12-02 17:30:04,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:04,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:04,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:30:04,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:04,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869932989] [2023-12-02 17:30:04,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869932989] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:04,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9966921] [2023-12-02 17:30:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:04,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:04,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:04,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:04,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 17:30:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:04,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:30:04,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:30:04,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:30:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9966921] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:30:04,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:30:04,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-12-02 17:30:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188740185] [2023-12-02 17:30:04,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:04,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:30:04,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:04,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:30:04,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 17:30:04,431 INFO L87 Difference]: Start difference. First operand 379 states and 1226 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:04,558 INFO L93 Difference]: Finished difference Result 441 states and 1435 transitions. [2023-12-02 17:30:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:30:04,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) Word has length 24 [2023-12-02 17:30:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:04,565 INFO L225 Difference]: With dead ends: 441 [2023-12-02 17:30:04,565 INFO L226 Difference]: Without dead ends: 441 [2023-12-02 17:30:04,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:30:04,567 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 39 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:04,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:30:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2023-12-02 17:30:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2023-12-02 17:30:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 3.2613636363636362) internal successors, (1435), 440 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1435 transitions. [2023-12-02 17:30:04,598 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1435 transitions. Word has length 24 [2023-12-02 17:30:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:04,599 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 1435 transitions. [2023-12-02 17:30:04,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1435 transitions. [2023-12-02 17:30:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:30:04,602 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:04,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:04,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:30:04,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:04,803 INFO L420 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)] === [2023-12-02 17:30:04,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash 755570456, now seen corresponding path program 1 times [2023-12-02 17:30:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:04,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993046143] [2023-12-02 17:30:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:30:04,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:04,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993046143] [2023-12-02 17:30:04,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993046143] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:04,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210051321] [2023-12-02 17:30:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:04,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:04,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:04,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:04,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 17:30:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:05,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 17:30:05,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:30:05,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:30:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210051321] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:05,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-02 17:30:05,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-12-02 17:30:05,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160259689] [2023-12-02 17:30:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:30:05,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 17:30:05,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:05,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 17:30:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 17:30:05,239 INFO L87 Difference]: Start difference. First operand 441 states and 1435 transitions. Second operand 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) [2023-12-02 17:30:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:05,373 INFO L93 Difference]: Finished difference Result 513 states and 1679 transitions. [2023-12-02 17:30:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 17:30:05,374 INFO L78 Accepts]: Start accepts. 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) Word has length 27 [2023-12-02 17:30:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:05,380 INFO L225 Difference]: With dead ends: 513 [2023-12-02 17:30:05,380 INFO L226 Difference]: Without dead ends: 513 [2023-12-02 17:30:05,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-02 17:30:05,382 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:05,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 5 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 17:30:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-12-02 17:30:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2023-12-02 17:30:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.279296875) internal successors, (1679), 512 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1679 transitions. [2023-12-02 17:30:05,408 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1679 transitions. Word has length 27 [2023-12-02 17:30:05,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:05,409 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 1679 transitions. [2023-12-02 17:30:05,409 INFO L496 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) [2023-12-02 17:30:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1679 transitions. [2023-12-02 17:30:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:30:05,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:05,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:05,418 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 17:30:05,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:05,613 INFO L420 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)] === [2023-12-02 17:30:05,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash 305247897, now seen corresponding path program 1 times [2023-12-02 17:30:05,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:05,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425136816] [2023-12-02 17:30:05,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:05,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:07,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425136816] [2023-12-02 17:30:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425136816] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948593390] [2023-12-02 17:30:07,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:07,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:07,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:07,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:07,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 17:30:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:07,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 17:30:07,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:08,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:08,063 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 27 treesize of output 19 [2023-12-02 17:30:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:30:08,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:08,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:08,196 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 33 treesize of output 78 [2023-12-02 17:30:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:30:08,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948593390] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:30:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556517689] [2023-12-02 17:30:08,616 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:30:08,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:30:08,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 26 [2023-12-02 17:30:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576556074] [2023-12-02 17:30:08,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:30:08,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:30:08,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:08,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:30:08,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:30:08,620 INFO L87 Difference]: Start difference. First operand 513 states and 1679 transitions. Second operand has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:10,052 INFO L93 Difference]: Finished difference Result 1236 states and 4105 transitions. [2023-12-02 17:30:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 17:30:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 26 states have internal predecessors, (69), 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) Word has length 30 [2023-12-02 17:30:10,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:10,065 INFO L225 Difference]: With dead ends: 1236 [2023-12-02 17:30:10,066 INFO L226 Difference]: Without dead ends: 1229 [2023-12-02 17:30:10,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=1414, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 17:30:10,068 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 172 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:10,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 62 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 17:30:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2023-12-02 17:30:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 714. [2023-12-02 17:30:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 3.302945301542777) internal successors, (2355), 713 states have internal predecessors, (2355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2355 transitions. [2023-12-02 17:30:10,116 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 2355 transitions. Word has length 30 [2023-12-02 17:30:10,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:10,117 INFO L495 AbstractCegarLoop]: Abstraction has 714 states and 2355 transitions. [2023-12-02 17:30:10,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:10,117 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 2355 transitions. [2023-12-02 17:30:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:30:10,121 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:10,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:10,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 17:30:10,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:10,322 INFO L420 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)] === [2023-12-02 17:30:10,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:10,323 INFO L85 PathProgramCache]: Analyzing trace with hash -503765867, now seen corresponding path program 2 times [2023-12-02 17:30:10,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:10,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593739599] [2023-12-02 17:30:10,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:10,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:11,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:11,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593739599] [2023-12-02 17:30:11,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593739599] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:11,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382218659] [2023-12-02 17:30:11,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:30:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:11,671 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:11,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 17:30:11,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:30:11,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:30:11,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 17:30:11,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:12,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:12,141 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 27 treesize of output 19 [2023-12-02 17:30:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:30:12,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:12,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:12,232 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 41 treesize of output 86 [2023-12-02 17:30:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:30:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382218659] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:30:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1948193897] [2023-12-02 17:30:12,479 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:30:12,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:30:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 25 [2023-12-02 17:30:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278310771] [2023-12-02 17:30:12,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:30:12,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 17:30:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:12,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 17:30:12,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2023-12-02 17:30:12,482 INFO L87 Difference]: Start difference. First operand 714 states and 2355 transitions. Second operand has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:13,709 INFO L93 Difference]: Finished difference Result 1372 states and 4521 transitions. [2023-12-02 17:30:13,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-02 17:30:13,710 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 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) Word has length 30 [2023-12-02 17:30:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:13,724 INFO L225 Difference]: With dead ends: 1372 [2023-12-02 17:30:13,724 INFO L226 Difference]: Without dead ends: 1365 [2023-12-02 17:30:13,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1417, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 17:30:13,726 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 204 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:13,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 48 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 17:30:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2023-12-02 17:30:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 833. [2023-12-02 17:30:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 3.295673076923077) internal successors, (2742), 832 states have internal predecessors, (2742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:13,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2742 transitions. [2023-12-02 17:30:13,777 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2742 transitions. Word has length 30 [2023-12-02 17:30:13,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:13,778 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 2742 transitions. [2023-12-02 17:30:13,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:13,778 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2742 transitions. [2023-12-02 17:30:13,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:30:13,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:13,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:13,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 17:30:13,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:13,988 INFO L420 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)] === [2023-12-02 17:30:13,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1390826539, now seen corresponding path program 3 times [2023-12-02 17:30:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:13,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161639116] [2023-12-02 17:30:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:13,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:30:14,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161639116] [2023-12-02 17:30:14,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161639116] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:14,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818770941] [2023-12-02 17:30:14,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:30:14,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:14,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:14,927 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:14,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 17:30:15,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:30:15,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:30:15,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 17:30:15,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:15,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:15,406 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 27 treesize of output 19 [2023-12-02 17:30:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:30:15,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:15,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:15,498 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 41 treesize of output 86 [2023-12-02 17:30:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:30:15,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818770941] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:30:15,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1318969491] [2023-12-02 17:30:15,748 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:30:15,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:30:15,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 8] total 26 [2023-12-02 17:30:15,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432892329] [2023-12-02 17:30:15,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:30:15,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:30:15,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:15,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:30:15,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:30:15,750 INFO L87 Difference]: Start difference. First operand 833 states and 2742 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:16,910 INFO L93 Difference]: Finished difference Result 1461 states and 4753 transitions. [2023-12-02 17:30:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 17:30:16,910 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 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) Word has length 30 [2023-12-02 17:30:16,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:16,923 INFO L225 Difference]: With dead ends: 1461 [2023-12-02 17:30:16,923 INFO L226 Difference]: Without dead ends: 1447 [2023-12-02 17:30:16,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=1530, Unknown=0, NotChecked=0, Total=1806 [2023-12-02 17:30:16,925 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 202 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:16,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 37 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 17:30:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2023-12-02 17:30:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 841. [2023-12-02 17:30:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.2857142857142856) internal successors, (2760), 840 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2760 transitions. [2023-12-02 17:30:16,968 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2760 transitions. Word has length 30 [2023-12-02 17:30:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:16,968 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 2760 transitions. [2023-12-02 17:30:16,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 26 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2760 transitions. [2023-12-02 17:30:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:30:16,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:16,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:16,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-02 17:30:17,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:17,174 INFO L420 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)] === [2023-12-02 17:30:17,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:17,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1361550579, now seen corresponding path program 4 times [2023-12-02 17:30:17,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:17,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28485975] [2023-12-02 17:30:17,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:17,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:18,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28485975] [2023-12-02 17:30:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28485975] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116645208] [2023-12-02 17:30:18,286 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:30:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:18,287 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:18,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 17:30:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:18,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-02 17:30:18,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:18,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:18,725 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 27 treesize of output 19 [2023-12-02 17:30:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:30:18,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:18,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:18,826 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 41 treesize of output 86 [2023-12-02 17:30:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:30:19,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116645208] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:30:19,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1788805033] [2023-12-02 17:30:19,103 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:30:19,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:30:19,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2023-12-02 17:30:19,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861422927] [2023-12-02 17:30:19,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:30:19,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 17:30:19,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:19,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 17:30:19,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2023-12-02 17:30:19,105 INFO L87 Difference]: Start difference. First operand 841 states and 2760 transitions. Second operand has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 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) [2023-12-02 17:30:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:30:20,362 INFO L93 Difference]: Finished difference Result 1878 states and 6139 transitions. [2023-12-02 17:30:20,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 17:30:20,363 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 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) Word has length 30 [2023-12-02 17:30:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:30:20,375 INFO L225 Difference]: With dead ends: 1878 [2023-12-02 17:30:20,375 INFO L226 Difference]: Without dead ends: 1864 [2023-12-02 17:30:20,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 17:30:20,376 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 211 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:30:20,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 28 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 17:30:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2023-12-02 17:30:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 876. [2023-12-02 17:30:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 3.2822857142857145) internal successors, (2872), 875 states have internal predecessors, (2872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:30:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 2872 transitions. [2023-12-02 17:30:20,411 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 2872 transitions. Word has length 30 [2023-12-02 17:30:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:30:20,411 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 2872 transitions. [2023-12-02 17:30:20,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 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) [2023-12-02 17:30:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 2872 transitions. [2023-12-02 17:30:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:30:20,414 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:30:20,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:30:20,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 17:30:20,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:20,615 INFO L420 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)] === [2023-12-02 17:30:20,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:30:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1764530791, now seen corresponding path program 5 times [2023-12-02 17:30:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:30:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866281042] [2023-12-02 17:30:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:30:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:30:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:30:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:21,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:30:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866281042] [2023-12-02 17:30:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866281042] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:30:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438498585] [2023-12-02 17:30:21,899 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:30:21,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:30:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:30:21,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:30:21,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 17:30:22,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 17:30:22,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:30:22,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 51 conjunts are in the unsatisfiable core [2023-12-02 17:30:22,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:30:22,345 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 [2023-12-02 17:30:22,416 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 8 treesize of output 1 [2023-12-02 17:30:22,497 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 8 treesize of output 1 [2023-12-02 17:30:22,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:30:22,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:30:22,756 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:30:22,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 17:30:22,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:22,883 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 27 treesize of output 19 [2023-12-02 17:30:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:30:22,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:30:23,068 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int))) (= (let ((.cse0 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ .cse0 c_~A~0.offset)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse0 c_~B~0.offset)) c_~res1~0)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_300)) (.cse2 (* 4 c_~M~0))) (+ c_~res2~0 (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)) (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)))))) is different from false [2023-12-02 17:30:23,084 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) c_~res1~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_300)) (.cse1 (* 4 c_~M~0))) (+ c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))))) is different from false [2023-12-02 17:30:23,109 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_300 (Array Int Int)) (v_ArrVal_299 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_299))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_300)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) (select (select .cse2 c_~B~0.base) c_~B~0.offset) c_~res1~0)))) is different from false [2023-12-02 17:30:23,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:23,277 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2023-12-02 17:30:23,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:23,481 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 1196022 treesize of output 1065018 [2023-12-02 17:30:23,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:23,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2070 treesize of output 1694 [2023-12-02 17:30:23,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:23,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1686 treesize of output 1582 [2023-12-02 17:30:24,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:30:24,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1526 treesize of output 1262 [2023-12-02 17:30:45,724 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:47,402 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:30:47,428 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:47,444 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:48,630 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:50,371 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:50,456 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:30:50,482 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:50,498 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:50,885 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:52,391 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:52,460 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:30:52,483 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:52,496 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:52,703 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:53,454 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:30:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:30:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438498585] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:30:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [6053937] [2023-12-02 17:30:58,853 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:30:58,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:30:58,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2023-12-02 17:30:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120918076] [2023-12-02 17:30:58,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:30:58,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 17:30:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:30:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 17:30:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=880, Unknown=7, NotChecked=186, Total=1190 [2023-12-02 17:30:58,855 INFO L87 Difference]: Start difference. First operand 876 states and 2872 transitions. Second operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 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) [2023-12-02 17:31:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:31:00,533 INFO L93 Difference]: Finished difference Result 1608 states and 5269 transitions. [2023-12-02 17:31:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 17:31:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 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) Word has length 30 [2023-12-02 17:31:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:31:00,544 INFO L225 Difference]: With dead ends: 1608 [2023-12-02 17:31:00,544 INFO L226 Difference]: Without dead ends: 1601 [2023-12-02 17:31:00,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=239, Invalid=1572, Unknown=7, NotChecked=252, Total=2070 [2023-12-02 17:31:00,545 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:31:00,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 29 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1353 Invalid, 0 Unknown, 422 Unchecked, 1.0s Time] [2023-12-02 17:31:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2023-12-02 17:31:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 899. [2023-12-02 17:31:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 3.2661469933184857) internal successors, (2933), 898 states have internal predecessors, (2933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:31:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2933 transitions. [2023-12-02 17:31:00,579 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2933 transitions. Word has length 30 [2023-12-02 17:31:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:31:00,579 INFO L495 AbstractCegarLoop]: Abstraction has 899 states and 2933 transitions. [2023-12-02 17:31:00,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 34 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) [2023-12-02 17:31:00,580 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2933 transitions. [2023-12-02 17:31:00,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:31:00,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:31:00,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:31:00,587 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 17:31:00,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:00,783 INFO L420 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)] === [2023-12-02 17:31:00,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:31:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1290760729, now seen corresponding path program 6 times [2023-12-02 17:31:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:31:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589851717] [2023-12-02 17:31:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:31:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:31:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:31:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:02,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:31:02,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589851717] [2023-12-02 17:31:02,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589851717] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:31:02,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593282695] [2023-12-02 17:31:02,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:31:02,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:31:02,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:31:02,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:31:02,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 17:31:02,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:31:02,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:31:02,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 62 conjunts are in the unsatisfiable core [2023-12-02 17:31:02,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:31:02,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,397 INFO L349 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2023-12-02 17:31:02,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 27 [2023-12-02 17:31:02,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,430 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 17:31:02,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 17:31:02,443 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:31:02,443 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:31:02,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:31:02,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2023-12-02 17:31:02,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:02,615 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-12-02 17:31:02,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 33 [2023-12-02 17:31:02,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-12-02 17:31:02,765 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 8 treesize of output 1 [2023-12-02 17:31:03,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:31:03,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 17:31:03,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 17:31:03,365 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 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-02 17:31:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:31:03,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:31:03,457 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_350)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))) c_~res1~0)) is different from false [2023-12-02 17:31:03,803 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_349 (Array Int Int)) (v_ArrVal_350 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_348))) (= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~res1~0) (let ((.cse1 (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_350))) (+ (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res2~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)))))) is different from false [2023-12-02 17:31:03,813 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_349 (Array Int Int)) (v_ArrVal_350 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_168| Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet31#1_168|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_348))) (= (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_350))) (+ c_~res2~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-12-02 17:31:03,933 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-12-02 17:31:03,933 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 177 treesize of output 84 [2023-12-02 17:31:03,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:03,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14080 treesize of output 12058 [2023-12-02 17:31:04,088 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:04,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1422 treesize of output 1334 [2023-12-02 17:31:04,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:04,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1326 treesize of output 1270 [2023-12-02 17:31:04,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:31:04,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1262 treesize of output 1142 [2023-12-02 17:31:05,685 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:05,860 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:06,712 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:06,794 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:06,861 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:06,947 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:07,039 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:07,100 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:07,346 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:07,386 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:07,404 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:07,477 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:07,510 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:07,527 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:07,856 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:07,902 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:07,942 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:08,016 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:08,123 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:08,176 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:08,270 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:08,318 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:08,366 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:08,428 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:08,650 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:08,658 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:08,757 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:08,765 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:08,852 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:08,943 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:08,951 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:09,063 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:09,111 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:09,178 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:09,217 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:09,257 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:09,294 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:09,608 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:09,763 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:09,803 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:09,819 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:09,918 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:09,968 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:10,022 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:10,077 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:10,171 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:10,227 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:10,236 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:10,326 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:10,387 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:10,735 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:10,896 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:10,952 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:10,961 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:11,024 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:11,154 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:11,268 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:11,727 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:11,735 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:11,842 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:11,853 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:11,953 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:11,961 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:12,069 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:12,149 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:12,222 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:12,430 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:15,912 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:16,042 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:16,086 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:16,127 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:16,165 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:16,386 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:16,398 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:16,525 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:16,555 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:16,572 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:16,586 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:16,728 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:16,761 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:17,113 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:17,156 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:17,177 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:17,193 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:17,325 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:17,443 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:17,475 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:17,637 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:17,689 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:17,937 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:18,014 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:18,110 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:18,214 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:18,255 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:18,482 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:18,535 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:18,638 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:18,688 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:18,783 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:18,825 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:18,941 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:18,952 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:19,063 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:19,070 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:19,172 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:19,505 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:19,621 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:19,684 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:19,693 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:19,820 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:19,895 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:19,905 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:20,033 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:20,201 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:20,209 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:20,269 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:20,457 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:20,903 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:21,697 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:21,803 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:21,819 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:21,827 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:21,916 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:21,994 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:22,035 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:22,045 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:22,054 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:22,188 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:22,201 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:22,550 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:22,556 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:22,636 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:22,653 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:22,703 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:22,754 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:22,765 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:22,775 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:22,813 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:22,822 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:22,849 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:22,879 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:22,893 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:22,942 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:22,950 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:22,957 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:22,969 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:23,036 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:23,051 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:23,057 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:23,067 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:23,120 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:23,159 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:23,169 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:23,201 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:23,475 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:23,517 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:23,735 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:23,744 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:23,849 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:23,867 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:23,931 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:23,941 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:24,006 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:24,167 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:24,177 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:24,514 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:24,535 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:24,544 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:31:24,555 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:25,222 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:25,231 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:25,241 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:25,249 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:25,307 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:25,369 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:25,530 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:25,536 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:25,564 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:25,579 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:25,606 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:25,677 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:25,717 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:25,726 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:25,776 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:25,785 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:25,801 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:25,874 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:25,896 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:25,921 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:25,931 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:25,938 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:26,062 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:26,070 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:26,079 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:26,353 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:26,378 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:26,417 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:26,428 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:26,439 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:26,446 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:26,504 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:26,539 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:26,546 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:26,567 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:26,678 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:26,771 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:26,854 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:26,986 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:26,996 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:27,071 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:27,192 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:27,199 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:27,206 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:27,321 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:27,368 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:27,396 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:27,449 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:27,455 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:27,578 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:27,595 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:27,601 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:27,612 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:27,626 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:27,757 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:27,815 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:27,824 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:27,937 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:28,261 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:29,758 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:29,846 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:29,874 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:29,901 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:29,912 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:29,971 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:29,978 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:30,006 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:30,042 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:30,061 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:30,106 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:30,126 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:30,132 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:30,155 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:30,169 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:30,409 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:30,453 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:30,461 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:30,490 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:30,506 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:30,611 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:30,656 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:30,672 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:30,708 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:30,745 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:30,754 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:30,782 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:30,887 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:30,927 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:30,937 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:30,951 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:30,976 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:30,999 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:31,068 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:31,152 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:31,173 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:31,278 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:31,285 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:31,292 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:31,386 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:31,393 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:31,401 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:31,408 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:31,766 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:31,782 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:31,788 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:31,801 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:31,810 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:31,816 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:31,944 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:31,984 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:31,991 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:32,032 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:32,076 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:32,118 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:32,124 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,142 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,149 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:32,203 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:32,300 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,328 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,374 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:32,394 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,418 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:32,429 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:32,537 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,589 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:32,626 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:32,689 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:32,706 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,715 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:32,722 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,753 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,761 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:32,766 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:32,776 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,783 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:32,849 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:32,862 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,871 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:32,878 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:32,937 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:32,945 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,953 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:32,983 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:32,991 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:33,330 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:33,346 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:33,387 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:33,395 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:33,668 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:33,680 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:34,162 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:34,243 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:34,255 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:34,349 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:34,358 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:34,376 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:34,634 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:34,647 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:34,656 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:34,663 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:34,935 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:34,944 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:35,265 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:35,298 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:35,405 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:35,451 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:35,464 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:35,501 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:35,508 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:35,520 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:35,569 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:35,615 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:35,664 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:35,711 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:35,724 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:35,800 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:35,833 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:35,847 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:35,856 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:36,110 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:36,143 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:36,180 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:36,200 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:36,224 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:36,235 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:36,343 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:36,404 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:36,443 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:36,574 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:36,580 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:36,657 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:36,723 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:36,731 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:36,873 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:36,914 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:36,927 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:37,012 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:37,149 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:37,224 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:37,314 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:37,325 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:37,395 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:37,404 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:37,517 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:37,533 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:37,604 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:38,041 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:38,051 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:38,104 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:38,113 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:38,145 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:38,210 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:38,290 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:38,489 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:38,497 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:39,739 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:39,755 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:39,765 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:40,093 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:40,103 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:40,126 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:40,175 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:40,356 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:40,365 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:40,375 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:40,486 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:40,667 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:40,704 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:40,787 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:40,869 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:40,930 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:40,947 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:41,157 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:41,173 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:41,212 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:41,364 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:41,978 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:31:42,183 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:42,379 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:42,387 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:42,503 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:42,514 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:31:42,528 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:43,089 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:43,114 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:43,153 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:43,250 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:43,273 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:43,322 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:43,335 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:44,244 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:31:44,254 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-12-02 17:31:44,333 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:44,411 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:44,567 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:44,578 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:44,589 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:45,641 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:45,828 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:45,924 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:46,001 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:46,108 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:46,295 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:46,387 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:46,465 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:46,796 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:47,239 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:47,624 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:50,150 WARN L667 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2023-12-02 17:31:50,162 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-12-02 17:31:50,173 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:31:50,223 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:51,284 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:51,416 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:51,859 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:51,997 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:52,076 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:52,330 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:52,339 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:52,349 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:53,082 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:53,093 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:53,103 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:54,332 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:54,415 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:54,423 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:54,596 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:54,650 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:31:54,679 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:54,780 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:54,839 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:55,115 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-12-02 17:31:55,179 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:55,306 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:55,358 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:55,400 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:55,408 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:55,441 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:55,470 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:55,498 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:55,507 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:55,580 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:55,653 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:55,756 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:55,832 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:56,022 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:56,134 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:56,187 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:56,220 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:56,271 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:56,416 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:56,613 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:56,676 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:56,724 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:56,756 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:56,968 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:56,976 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:56,983 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:57,003 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:57,010 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:57,017 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:57,076 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:57,102 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:57,159 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:57,198 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:57,335 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:57,352 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:57,462 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:57,468 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:57,475 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:57,561 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:57,568 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:31:57,575 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:57,582 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:57,940 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:57,957 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:57,965 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:57,980 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:57,990 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:57,998 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:58,141 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:31:58,178 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:58,186 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:58,225 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:58,278 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:58,535 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:58,596 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:58,605 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:31:58,875 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:58,966 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:58,974 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:31:59,554 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:31:59,653 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:59,690 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:31:59,698 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:31:59,803 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:31:59,818 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:00,018 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:00,040 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:32:00,051 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:00,503 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:00,942 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:01,084 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:01,117 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:01,146 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:01,222 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:01,242 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:01,257 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:01,295 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:01,488 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:01,496 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:01,695 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:01,704 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:01,841 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:01,849 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:01,864 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:01,878 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:01,926 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:01,977 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:01,985 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:02,014 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:02,030 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:02,137 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:02,144 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:02,151 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:02,188 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:02,330 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:02,456 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:02,486 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:02,500 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:02,531 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:02,568 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:02,576 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:02,601 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:02,702 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:02,738 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:02,883 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:02,892 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:02,995 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:03,003 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:03,016 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:03,242 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:03,257 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:03,271 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:03,377 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:03,513 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:03,519 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:03,584 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:03,591 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:03,626 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:03,638 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:03,668 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:03,674 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:03,694 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:03,701 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:03,854 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:03,912 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:03,944 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:03,978 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:03,992 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:04,048 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:04,056 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:04,090 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:04,136 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:04,159 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:04,213 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:04,249 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:04,256 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:04,284 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:04,494 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:04,578 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:04,648 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:04,656 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:04,701 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:04,737 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:04,745 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:04,793 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:04,809 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:04,849 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:04,858 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:05,078 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:05,171 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:05,226 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:05,256 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:05,287 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:05,319 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:05,417 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:05,462 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:05,471 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:05,488 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:05,596 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:05,684 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:32:05,711 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:05,806 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:05,909 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:05,985 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:06,141 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:06,309 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:06,452 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:06,615 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:06,642 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:06,657 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:06,897 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:07,141 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:07,568 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:07,687 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:08,030 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:08,059 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:08,105 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:08,228 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:08,243 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:08,278 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:08,286 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:08,369 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:08,376 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:08,382 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:08,522 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:08,531 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:08,545 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:08,560 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:08,568 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:08,645 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:09,126 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:09,216 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:32:09,244 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:09,330 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:09,357 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:09,457 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:09,499 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:09,506 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:09,523 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:09,574 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:09,668 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:09,674 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:09,735 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:09,742 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:09,777 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:09,789 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:09,818 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:09,825 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:09,848 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:09,856 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:10,224 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:10,334 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:10,389 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:10,422 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:10,475 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:10,573 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:10,854 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:11,328 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:32:11,490 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:32:11,550 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:32:11,578 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:11,755 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:11,764 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:32:11,775 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:12,556 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 17:32:12,567 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-12-02 17:32:12,650 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:12,734 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:12,804 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:12,955 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:12,969 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:13,017 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:13,024 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:13,032 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:13,039 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:13,183 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:13,204 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:13,211 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:13,223 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:13,232 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:13,288 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:13,300 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:13,307 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:13,318 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:13,508 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:13,544 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:13,703 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:13,711 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:13,811 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:13,820 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:13,833 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:14,069 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:14,084 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:14,098 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:14,192 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:14,224 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:14,256 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:14,333 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:14,357 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:14,373 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:14,419 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:14,540 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:14,576 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:14,586 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:14,597 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:14,648 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:14,666 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:14,736 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:14,744 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:14,751 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:14,765 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:14,799 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:14,828 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:14,843 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:14,874 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:14,908 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:14,916 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:14,939 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:15,021 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:15,030 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:15,037 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:15,074 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:15,108 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:15,115 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:15,144 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:15,173 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:15,205 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:15,212 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:15,391 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:15,533 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:15,598 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 17:32:15,675 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 17:32:15,684 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:15,733 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:15,765 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:15,773 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:15,788 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:15,935 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:15,943 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:16,768 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:17,355 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:17,518 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:17,729 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:17,830 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:18,093 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:18,227 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:18,402 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:18,554 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:19,415 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:19,451 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:19,477 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:19,763 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:19,991 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:20,027 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:20,233 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:20,284 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:20,329 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:21,041 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:21,728 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:21,981 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:22,005 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:22,075 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:22,098 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:22,729 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:22,740 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:22,747 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:22,758 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:22,853 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:22,861 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:22,867 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:22,922 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:22,928 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:22,982 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:23,246 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:23,264 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:23,271 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:23,283 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:23,342 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:23,791 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:23,801 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:23,808 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:23,815 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:23,865 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:23,872 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:23,878 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:23,922 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:23,962 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:23,970 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:23,976 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:24,072 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:24,090 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:24,096 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:24,104 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:24,241 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:24,316 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:24,329 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:24,394 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 17:32:24,445 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:24,451 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:24,483 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:24,719 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:24,742 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:25,067 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:25,075 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:25,083 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:25,190 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:25,281 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:25,447 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:25,487 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:25,524 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:25,782 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:25,831 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:25,839 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:25,847 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:25,904 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 17:32:25,966 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:26,117 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 17:32:27,371 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:28,142 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:28,238 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:28,292 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:28,361 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:29,782 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:29,795 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:29,971 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:30,212 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:30,322 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:30,347 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:30,367 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:30,804 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:31,112 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:31,128 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:31,137 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:31,472 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:31,485 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:31,589 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:31,613 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:31,715 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:31,744 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:31,783 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:39,592 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:39,618 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:39,711 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:39,751 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:39,762 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:39,839 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:39,862 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:39,874 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:39,908 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 17:32:39,942 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:39,974 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:39,985 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:40,035 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:40,044 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:40,045 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:40,080 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:40,099 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:40,100 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 17:32:40,125 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 17:32:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-02 17:32:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593282695] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:32:45,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [297280101] [2023-12-02 17:32:45,385 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:32:45,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:32:45,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2023-12-02 17:32:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295800843] [2023-12-02 17:32:45,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:32:45,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 17:32:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:32:45,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 17:32:45,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1061, Unknown=10, NotChecked=204, Total=1406 [2023-12-02 17:32:45,387 INFO L87 Difference]: Start difference. First operand 899 states and 2933 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:51,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:32:53,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 17:32:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:54,074 INFO L93 Difference]: Finished difference Result 2379 states and 7741 transitions. [2023-12-02 17:32:54,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 17:32:54,075 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 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) Word has length 30 [2023-12-02 17:32:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:54,089 INFO L225 Difference]: With dead ends: 2379 [2023-12-02 17:32:54,089 INFO L226 Difference]: Without dead ends: 2365 [2023-12-02 17:32:54,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=518, Invalid=3501, Unknown=25, NotChecked=378, Total=4422 [2023-12-02 17:32:54,091 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 504 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 46 mSolverCounterUnsat, 87 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 87 IncrementalHoareTripleChecker+Unknown, 1083 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:54,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 36 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2080 Invalid, 87 Unknown, 1083 Unchecked, 6.5s Time] [2023-12-02 17:32:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2023-12-02 17:32:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 942. [2023-12-02 17:32:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 3.2646121147715195) internal successors, (3072), 941 states have internal predecessors, (3072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:54,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 3072 transitions. [2023-12-02 17:32:54,123 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 3072 transitions. Word has length 30 [2023-12-02 17:32:54,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:54,124 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 3072 transitions. [2023-12-02 17:32:54,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 37 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 3072 transitions. [2023-12-02 17:32:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 17:32:54,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:54,127 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:32:54,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 17:32:54,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:32:54,329 INFO L420 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)] === [2023-12-02 17:32:54,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:54,329 INFO L85 PathProgramCache]: Analyzing trace with hash -222219338, now seen corresponding path program 7 times [2023-12-02 17:32:54,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:32:54,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604748290] [2023-12-02 17:32:54,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:54,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:32:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:32:54,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:32:54,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604748290] [2023-12-02 17:32:54,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604748290] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:32:54,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742040835] [2023-12-02 17:32:54,513 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:32:54,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:32:54,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:32:54,515 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:32:54,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 17:32:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:54,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:32:54,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:32:54,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:32:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:32:54,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742040835] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:32:54,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [206278985] [2023-12-02 17:32:54,816 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:32:54,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:32:54,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-12-02 17:32:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617418232] [2023-12-02 17:32:54,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:32:54,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 17:32:54,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:32:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 17:32:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2023-12-02 17:32:54,818 INFO L87 Difference]: Start difference. First operand 942 states and 3072 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:55,103 INFO L93 Difference]: Finished difference Result 1675 states and 5497 transitions. [2023-12-02 17:32:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:32:55,104 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 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) Word has length 31 [2023-12-02 17:32:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:55,114 INFO L225 Difference]: With dead ends: 1675 [2023-12-02 17:32:55,114 INFO L226 Difference]: Without dead ends: 1675 [2023-12-02 17:32:55,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:32:55,115 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 59 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:55,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 28 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:32:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2023-12-02 17:32:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 884. [2023-12-02 17:32:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 3.263873159682899) internal successors, (2882), 883 states have internal predecessors, (2882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 2882 transitions. [2023-12-02 17:32:55,150 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 2882 transitions. Word has length 31 [2023-12-02 17:32:55,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:55,150 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 2882 transitions. [2023-12-02 17:32:55,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 2882 transitions. [2023-12-02 17:32:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:32:55,154 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:55,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:32:55,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 17:32:55,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 17:32:55,355 INFO L420 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)] === [2023-12-02 17:32:55,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:55,355 INFO L85 PathProgramCache]: Analyzing trace with hash 524756415, now seen corresponding path program 8 times [2023-12-02 17:32:55,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:32:55,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711474288] [2023-12-02 17:32:55,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:55,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:32:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:55,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:32:55,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711474288] [2023-12-02 17:32:55,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711474288] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:32:55,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530652872] [2023-12-02 17:32:55,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:32:55,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:32:55,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:32:55,534 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:32:55,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 17:32:55,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:32:55,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:32:55,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:32:55,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:55,838 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:32:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530652872] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:32:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1724496279] [2023-12-02 17:32:55,919 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:32:55,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:32:55,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-12-02 17:32:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964426749] [2023-12-02 17:32:55,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:32:55,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:32:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:32:55,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:32:55,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:32:55,921 INFO L87 Difference]: Start difference. First operand 884 states and 2882 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:56,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:56,728 INFO L93 Difference]: Finished difference Result 2222 states and 7164 transitions. [2023-12-02 17:32:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 17:32:56,729 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 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) Word has length 32 [2023-12-02 17:32:56,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:56,742 INFO L225 Difference]: With dead ends: 2222 [2023-12-02 17:32:56,742 INFO L226 Difference]: Without dead ends: 2222 [2023-12-02 17:32:56,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2023-12-02 17:32:56,743 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 144 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1379 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:56,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 28 Invalid, 1386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1379 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:32:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2023-12-02 17:32:56,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 970. [2023-12-02 17:32:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.2734778121775028) internal successors, (3172), 969 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 3172 transitions. [2023-12-02 17:32:56,772 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 3172 transitions. Word has length 32 [2023-12-02 17:32:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:56,772 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 3172 transitions. [2023-12-02 17:32:56,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:56,773 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 3172 transitions. [2023-12-02 17:32:56,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:32:56,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:56,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:32:56,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 17:32:56,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:32:56,976 INFO L420 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)] === [2023-12-02 17:32:56,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2011057183, now seen corresponding path program 9 times [2023-12-02 17:32:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:32:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735956657] [2023-12-02 17:32:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:56,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:32:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:57,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:32:57,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735956657] [2023-12-02 17:32:57,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735956657] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:32:57,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577125072] [2023-12-02 17:32:57,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:32:57,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:32:57,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:32:57,156 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:32:57,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 17:32:57,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:32:57,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:32:57,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:32:57,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:57,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:32:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:57,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577125072] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:32:57,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [651352502] [2023-12-02 17:32:57,454 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:32:57,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:32:57,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-12-02 17:32:57,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195322303] [2023-12-02 17:32:57,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:32:57,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 17:32:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:32:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 17:32:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:32:57,455 INFO L87 Difference]: Start difference. First operand 970 states and 3172 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:32:58,779 INFO L93 Difference]: Finished difference Result 2785 states and 9303 transitions. [2023-12-02 17:32:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 17:32:58,779 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 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) Word has length 32 [2023-12-02 17:32:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:32:58,792 INFO L225 Difference]: With dead ends: 2785 [2023-12-02 17:32:58,792 INFO L226 Difference]: Without dead ends: 2785 [2023-12-02 17:32:58,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=772, Unknown=0, NotChecked=0, Total=992 [2023-12-02 17:32:58,793 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 182 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:32:58,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 34 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 17:32:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2023-12-02 17:32:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 1042. [2023-12-02 17:32:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 3.3611911623439) internal successors, (3499), 1041 states have internal predecessors, (3499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 3499 transitions. [2023-12-02 17:32:58,835 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 3499 transitions. Word has length 32 [2023-12-02 17:32:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:32:58,835 INFO L495 AbstractCegarLoop]: Abstraction has 1042 states and 3499 transitions. [2023-12-02 17:32:58,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:32:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 3499 transitions. [2023-12-02 17:32:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:32:58,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:32:58,838 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:32:58,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 17:32:59,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:32:59,039 INFO L420 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)] === [2023-12-02 17:32:59,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:32:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 376429285, now seen corresponding path program 10 times [2023-12-02 17:32:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:32:59,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901421012] [2023-12-02 17:32:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:32:59,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:32:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:59,221 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:32:59,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901421012] [2023-12-02 17:32:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901421012] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:32:59,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763172565] [2023-12-02 17:32:59,221 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:32:59,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:32:59,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:32:59,223 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:32:59,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 17:32:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:32:59,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:32:59,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:32:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:59,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:32:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:32:59,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763172565] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:32:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [474529213] [2023-12-02 17:32:59,584 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:32:59,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:32:59,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-12-02 17:32:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246991760] [2023-12-02 17:32:59,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:32:59,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 17:32:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:32:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 17:32:59,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-12-02 17:32:59,586 INFO L87 Difference]: Start difference. First operand 1042 states and 3499 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:00,897 INFO L93 Difference]: Finished difference Result 3286 states and 11244 transitions. [2023-12-02 17:33:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 17:33:00,897 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 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) Word has length 32 [2023-12-02 17:33:00,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:00,906 INFO L225 Difference]: With dead ends: 3286 [2023-12-02 17:33:00,906 INFO L226 Difference]: Without dead ends: 3286 [2023-12-02 17:33:00,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2023-12-02 17:33:00,907 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 262 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:00,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 26 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 17:33:00,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2023-12-02 17:33:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 1066. [2023-12-02 17:33:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1065 states have (on average 3.4103286384976528) internal successors, (3632), 1065 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:00,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 3632 transitions. [2023-12-02 17:33:00,962 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 3632 transitions. Word has length 32 [2023-12-02 17:33:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:00,962 INFO L495 AbstractCegarLoop]: Abstraction has 1066 states and 3632 transitions. [2023-12-02 17:33:00,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 3632 transitions. [2023-12-02 17:33:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:33:00,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:00,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:00,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 17:33:01,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:01,167 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:01,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:01,167 INFO L85 PathProgramCache]: Analyzing trace with hash -684348805, now seen corresponding path program 11 times [2023-12-02 17:33:01,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:01,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548535274] [2023-12-02 17:33:01,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:01,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:01,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:01,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:01,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548535274] [2023-12-02 17:33:01,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548535274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:01,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455964455] [2023-12-02 17:33:01,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:33:01,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:01,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:01,349 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:01,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 17:33:01,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:33:01,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:01,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:33:01,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:01,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:01,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455964455] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [116278209] [2023-12-02 17:33:01,699 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:01,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:01,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-12-02 17:33:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046834425] [2023-12-02 17:33:01,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:01,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 17:33:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:01,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 17:33:01,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-02 17:33:01,701 INFO L87 Difference]: Start difference. First operand 1066 states and 3632 transitions. Second operand has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:02,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:02,569 INFO L93 Difference]: Finished difference Result 2747 states and 9405 transitions. [2023-12-02 17:33:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 17:33:02,570 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 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) Word has length 32 [2023-12-02 17:33:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:02,578 INFO L225 Difference]: With dead ends: 2747 [2023-12-02 17:33:02,578 INFO L226 Difference]: Without dead ends: 2747 [2023-12-02 17:33:02,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2023-12-02 17:33:02,579 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 263 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1121 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:02,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 20 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1121 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:33:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2023-12-02 17:33:02,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 994. [2023-12-02 17:33:02,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.310171198388721) internal successors, (3287), 993 states have internal predecessors, (3287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3287 transitions. [2023-12-02 17:33:02,611 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 3287 transitions. Word has length 32 [2023-12-02 17:33:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:02,612 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 3287 transitions. [2023-12-02 17:33:02,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 21 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 3287 transitions. [2023-12-02 17:33:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:33:02,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:02,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:02,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-12-02 17:33:02,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 17:33:02,815 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:02,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1404068933, now seen corresponding path program 12 times [2023-12-02 17:33:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:02,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071177367] [2023-12-02 17:33:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:02,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071177367] [2023-12-02 17:33:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071177367] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583242483] [2023-12-02 17:33:02,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:33:02,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:02,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:02,978 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:02,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 17:33:03,126 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:33:03,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:03,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:33:03,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:03,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583242483] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:03,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1954086186] [2023-12-02 17:33:03,353 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:03,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:03,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-12-02 17:33:03,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396758892] [2023-12-02 17:33:03,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:03,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 17:33:03,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:03,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 17:33:03,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:33:03,354 INFO L87 Difference]: Start difference. First operand 994 states and 3287 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:04,554 INFO L93 Difference]: Finished difference Result 2507 states and 8284 transitions. [2023-12-02 17:33:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 17:33:04,555 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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) Word has length 32 [2023-12-02 17:33:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:04,563 INFO L225 Difference]: With dead ends: 2507 [2023-12-02 17:33:04,563 INFO L226 Difference]: Without dead ends: 2507 [2023-12-02 17:33:04,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2023-12-02 17:33:04,564 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 173 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:04,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 38 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 17:33:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2023-12-02 17:33:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1134. [2023-12-02 17:33:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 3.4024713150926744) internal successors, (3855), 1133 states have internal predecessors, (3855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 3855 transitions. [2023-12-02 17:33:04,600 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 3855 transitions. Word has length 32 [2023-12-02 17:33:04,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:04,600 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 3855 transitions. [2023-12-02 17:33:04,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 3855 transitions. [2023-12-02 17:33:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:33:04,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:04,603 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:04,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 17:33:04,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 17:33:04,803 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:04,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash 983417535, now seen corresponding path program 13 times [2023-12-02 17:33:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783009016] [2023-12-02 17:33:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:04,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:04,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783009016] [2023-12-02 17:33:04,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783009016] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:04,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235539141] [2023-12-02 17:33:04,973 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:33:04,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:04,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:04,974 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:04,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 17:33:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:05,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:33:05,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:05,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235539141] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1970039553] [2023-12-02 17:33:05,332 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:05,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:05,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-12-02 17:33:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588717254] [2023-12-02 17:33:05,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:05,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 17:33:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:05,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 17:33:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-12-02 17:33:05,334 INFO L87 Difference]: Start difference. First operand 1134 states and 3855 transitions. Second operand has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:06,883 INFO L93 Difference]: Finished difference Result 3331 states and 11280 transitions. [2023-12-02 17:33:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 17:33:06,884 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 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) Word has length 32 [2023-12-02 17:33:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:06,891 INFO L225 Difference]: With dead ends: 3331 [2023-12-02 17:33:06,892 INFO L226 Difference]: Without dead ends: 3331 [2023-12-02 17:33:06,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=500, Invalid=1756, Unknown=0, NotChecked=0, Total=2256 [2023-12-02 17:33:06,893 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 310 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:06,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 35 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 17:33:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2023-12-02 17:33:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 1158. [2023-12-02 17:33:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 3.4468452895419186) internal successors, (3988), 1157 states have internal predecessors, (3988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 3988 transitions. [2023-12-02 17:33:06,932 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 3988 transitions. Word has length 32 [2023-12-02 17:33:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:06,932 INFO L495 AbstractCegarLoop]: Abstraction has 1158 states and 3988 transitions. [2023-12-02 17:33:06,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 3988 transitions. [2023-12-02 17:33:06,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:33:06,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:06,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:06,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 17:33:07,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-02 17:33:07,135 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:07,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash -77360555, now seen corresponding path program 14 times [2023-12-02 17:33:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:07,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101730964] [2023-12-02 17:33:07,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:07,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:07,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:07,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:07,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101730964] [2023-12-02 17:33:07,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101730964] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40115675] [2023-12-02 17:33:07,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:33:07,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:07,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:07,329 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:07,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 17:33:07,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:33:07,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:07,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:33:07,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:07,583 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40115675] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860175252] [2023-12-02 17:33:07,704 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:07,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:07,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-12-02 17:33:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221024472] [2023-12-02 17:33:07,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:07,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 17:33:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:07,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 17:33:07,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-02 17:33:07,706 INFO L87 Difference]: Start difference. First operand 1158 states and 3988 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:09,107 INFO L93 Difference]: Finished difference Result 3124 states and 10551 transitions. [2023-12-02 17:33:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-02 17:33:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 17:33:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:09,113 INFO L225 Difference]: With dead ends: 3124 [2023-12-02 17:33:09,114 INFO L226 Difference]: Without dead ends: 3124 [2023-12-02 17:33:09,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2023-12-02 17:33:09,115 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 299 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:09,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 54 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-02 17:33:09,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2023-12-02 17:33:09,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 1062. [2023-12-02 17:33:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 3.3251649387370406) internal successors, (3528), 1061 states have internal predecessors, (3528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 3528 transitions. [2023-12-02 17:33:09,150 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 3528 transitions. Word has length 32 [2023-12-02 17:33:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:09,151 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 3528 transitions. [2023-12-02 17:33:09,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 3528 transitions. [2023-12-02 17:33:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:33:09,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:09,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:09,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 17:33:09,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 17:33:09,353 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:09,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1571973947, now seen corresponding path program 15 times [2023-12-02 17:33:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142208335] [2023-12-02 17:33:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:09,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142208335] [2023-12-02 17:33:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142208335] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757933179] [2023-12-02 17:33:09,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:33:09,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:09,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:09,498 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:09,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 17:33:09,627 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:33:09,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:09,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:33:09,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:09,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757933179] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:09,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [96420311] [2023-12-02 17:33:09,836 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:09,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-12-02 17:33:09,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792484883] [2023-12-02 17:33:09,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:09,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-02 17:33:09,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:09,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-02 17:33:09,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-12-02 17:33:09,838 INFO L87 Difference]: Start difference. First operand 1062 states and 3528 transitions. Second operand has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:11,656 INFO L93 Difference]: Finished difference Result 3615 states and 12378 transitions. [2023-12-02 17:33:11,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 17:33:11,657 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 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) Word has length 32 [2023-12-02 17:33:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:11,663 INFO L225 Difference]: With dead ends: 3615 [2023-12-02 17:33:11,663 INFO L226 Difference]: Without dead ends: 3615 [2023-12-02 17:33:11,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=682, Invalid=1970, Unknown=0, NotChecked=0, Total=2652 [2023-12-02 17:33:11,665 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 318 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:11,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 39 Invalid, 2249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2225 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-02 17:33:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3615 states. [2023-12-02 17:33:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3615 to 1110. [2023-12-02 17:33:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1109 states have (on average 3.3994589720468893) internal successors, (3770), 1109 states have internal predecessors, (3770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 3770 transitions. [2023-12-02 17:33:11,706 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 3770 transitions. Word has length 32 [2023-12-02 17:33:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:11,706 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 3770 transitions. [2023-12-02 17:33:11,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 3770 transitions. [2023-12-02 17:33:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:33:11,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:11,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:11,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 17:33:11,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 17:33:11,908 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:11,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash 511195857, now seen corresponding path program 16 times [2023-12-02 17:33:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23307048] [2023-12-02 17:33:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:12,054 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23307048] [2023-12-02 17:33:12,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23307048] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:12,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800043338] [2023-12-02 17:33:12,054 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:33:12,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:12,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:12,055 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:12,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-02 17:33:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:12,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:33:12,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:12,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800043338] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [421235523] [2023-12-02 17:33:12,372 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:12,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-12-02 17:33:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121001485] [2023-12-02 17:33:12,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:12,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 17:33:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:12,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 17:33:12,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-12-02 17:33:12,374 INFO L87 Difference]: Start difference. First operand 1110 states and 3770 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:13,874 INFO L93 Difference]: Finished difference Result 4253 states and 14581 transitions. [2023-12-02 17:33:13,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 17:33:13,874 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 17:33:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:13,883 INFO L225 Difference]: With dead ends: 4253 [2023-12-02 17:33:13,883 INFO L226 Difference]: Without dead ends: 4253 [2023-12-02 17:33:13,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=878, Invalid=2662, Unknown=0, NotChecked=0, Total=3540 [2023-12-02 17:33:13,884 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 502 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:13,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 31 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 17:33:13,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2023-12-02 17:33:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 1086. [2023-12-02 17:33:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 3.352073732718894) internal successors, (3637), 1085 states have internal predecessors, (3637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 3637 transitions. [2023-12-02 17:33:13,929 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 3637 transitions. Word has length 32 [2023-12-02 17:33:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:13,930 INFO L495 AbstractCegarLoop]: Abstraction has 1086 states and 3637 transitions. [2023-12-02 17:33:13,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 21 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 3637 transitions. [2023-12-02 17:33:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-02 17:33:13,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:13,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:13,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-12-02 17:33:14,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:14,132 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:14,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1718067007, now seen corresponding path program 17 times [2023-12-02 17:33:14,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:14,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257102649] [2023-12-02 17:33:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:14,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:14,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:14,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257102649] [2023-12-02 17:33:14,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257102649] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:14,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515268501] [2023-12-02 17:33:14,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:33:14,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:14,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:14,262 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:14,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 17:33:14,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:33:14,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:14,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:33:14,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:14,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 17:33:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515268501] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1286597992] [2023-12-02 17:33:14,586 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:14,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-12-02 17:33:14,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633416471] [2023-12-02 17:33:14,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:14,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 17:33:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:14,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 17:33:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-12-02 17:33:14,588 INFO L87 Difference]: Start difference. First operand 1086 states and 3637 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:15,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:15,474 INFO L93 Difference]: Finished difference Result 2096 states and 6872 transitions. [2023-12-02 17:33:15,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 17:33:15,474 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-12-02 17:33:15,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:15,478 INFO L225 Difference]: With dead ends: 2096 [2023-12-02 17:33:15,478 INFO L226 Difference]: Without dead ends: 2096 [2023-12-02 17:33:15,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2023-12-02 17:33:15,479 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 180 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:15,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 33 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:33:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2023-12-02 17:33:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1000. [2023-12-02 17:33:15,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 999 states have (on average 3.3503503503503502) internal successors, (3347), 999 states have internal predecessors, (3347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:15,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 3347 transitions. [2023-12-02 17:33:15,504 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 3347 transitions. Word has length 32 [2023-12-02 17:33:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:15,505 INFO L495 AbstractCegarLoop]: Abstraction has 1000 states and 3347 transitions. [2023-12-02 17:33:15,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 19 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 3347 transitions. [2023-12-02 17:33:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 17:33:15,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:15,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:15,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-02 17:33:15,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:15,708 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:15,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:15,708 INFO L85 PathProgramCache]: Analyzing trace with hash -955374619, now seen corresponding path program 1 times [2023-12-02 17:33:15,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:15,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644204932] [2023-12-02 17:33:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:33:15,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644204932] [2023-12-02 17:33:15,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644204932] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:15,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094329304] [2023-12-02 17:33:15,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:15,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:15,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:15,812 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:15,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 17:33:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:15,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:33:15,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:15,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:33:15,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:33:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094329304] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:16,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [457586700] [2023-12-02 17:33:16,048 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:16,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-12-02 17:33:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372543822] [2023-12-02 17:33:16,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:16,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:33:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:16,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:33:16,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:33:16,050 INFO L87 Difference]: Start difference. First operand 1000 states and 3347 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:16,270 INFO L93 Difference]: Finished difference Result 1525 states and 4827 transitions. [2023-12-02 17:33:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 17:33:16,271 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 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) Word has length 33 [2023-12-02 17:33:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:16,276 INFO L225 Difference]: With dead ends: 1525 [2023-12-02 17:33:16,276 INFO L226 Difference]: Without dead ends: 1497 [2023-12-02 17:33:16,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:33:16,277 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 148 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:16,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 13 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:33:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2023-12-02 17:33:16,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1294. [2023-12-02 17:33:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 3.2869296210363497) internal successors, (4250), 1293 states have internal predecessors, (4250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 4250 transitions. [2023-12-02 17:33:16,300 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 4250 transitions. Word has length 33 [2023-12-02 17:33:16,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:16,300 INFO L495 AbstractCegarLoop]: Abstraction has 1294 states and 4250 transitions. [2023-12-02 17:33:16,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 4250 transitions. [2023-12-02 17:33:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 17:33:16,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:16,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:16,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 17:33:16,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:16,503 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:16,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash -281688826, now seen corresponding path program 18 times [2023-12-02 17:33:16,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:16,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138196472] [2023-12-02 17:33:16,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:16,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:33:16,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138196472] [2023-12-02 17:33:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138196472] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:16,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916912480] [2023-12-02 17:33:16,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:33:16,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:16,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:16,646 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:16,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-02 17:33:16,754 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:33:16,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:16,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:33:16,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:33:16,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:33:16,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916912480] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1486366667] [2023-12-02 17:33:16,998 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:16,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:16,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2023-12-02 17:33:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444601855] [2023-12-02 17:33:16,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:16,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 17:33:16,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:16,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 17:33:16,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2023-12-02 17:33:16,999 INFO L87 Difference]: Start difference. First operand 1294 states and 4250 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:18,061 INFO L93 Difference]: Finished difference Result 1954 states and 6179 transitions. [2023-12-02 17:33:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 17:33:18,062 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 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) Word has length 33 [2023-12-02 17:33:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:18,066 INFO L225 Difference]: With dead ends: 1954 [2023-12-02 17:33:18,066 INFO L226 Difference]: Without dead ends: 1684 [2023-12-02 17:33:18,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=316, Invalid=1244, Unknown=0, NotChecked=0, Total=1560 [2023-12-02 17:33:18,068 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 332 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:18,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 21 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:33:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2023-12-02 17:33:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1322. [2023-12-02 17:33:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1321 states have (on average 3.2013626040878123) internal successors, (4229), 1321 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:18,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 4229 transitions. [2023-12-02 17:33:18,094 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 4229 transitions. Word has length 33 [2023-12-02 17:33:18,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:18,094 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 4229 transitions. [2023-12-02 17:33:18,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 19 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 4229 transitions. [2023-12-02 17:33:18,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 17:33:18,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:18,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:18,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-12-02 17:33:18,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 17:33:18,297 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:18,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:18,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2071241864, now seen corresponding path program 19 times [2023-12-02 17:33:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67356726] [2023-12-02 17:33:18,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:18,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:33:18,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:18,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67356726] [2023-12-02 17:33:18,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67356726] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:18,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786018083] [2023-12-02 17:33:18,423 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:33:18,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:18,424 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:18,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 17:33:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:18,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:33:18,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:33:18,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:33:18,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786018083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:18,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [688612907] [2023-12-02 17:33:18,669 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:18,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:18,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-12-02 17:33:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298739617] [2023-12-02 17:33:18,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:18,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 17:33:18,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:18,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 17:33:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-12-02 17:33:18,671 INFO L87 Difference]: Start difference. First operand 1322 states and 4229 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:18,884 INFO L93 Difference]: Finished difference Result 1120 states and 3592 transitions. [2023-12-02 17:33:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 17:33:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 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) Word has length 33 [2023-12-02 17:33:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:18,887 INFO L225 Difference]: With dead ends: 1120 [2023-12-02 17:33:18,887 INFO L226 Difference]: Without dead ends: 897 [2023-12-02 17:33:18,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-12-02 17:33:18,888 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 48 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:18,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 12 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:33:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2023-12-02 17:33:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 897. [2023-12-02 17:33:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 896 states have (on average 3.3392857142857144) internal successors, (2992), 896 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 2992 transitions. [2023-12-02 17:33:18,902 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 2992 transitions. Word has length 33 [2023-12-02 17:33:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:18,902 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 2992 transitions. [2023-12-02 17:33:18,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:18,902 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 2992 transitions. [2023-12-02 17:33:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-02 17:33:18,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:18,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:18,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 17:33:19,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-12-02 17:33:19,105 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:19,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1482660607, now seen corresponding path program 2 times [2023-12-02 17:33:19,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:19,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792952550] [2023-12-02 17:33:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:33:19,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:19,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792952550] [2023-12-02 17:33:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792952550] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:19,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582868963] [2023-12-02 17:33:19,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:33:19,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:19,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:19,249 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:19,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 17:33:19,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:33:19,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:19,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 17:33:19,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:33:19,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 17:33:19,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582868963] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:33:19,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2065498485] [2023-12-02 17:33:19,555 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:33:19,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:33:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-12-02 17:33:19,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506347760] [2023-12-02 17:33:19,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:33:19,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 17:33:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:33:19,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 17:33:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-12-02 17:33:19,557 INFO L87 Difference]: Start difference. First operand 897 states and 2992 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:33:19,836 INFO L93 Difference]: Finished difference Result 1457 states and 4912 transitions. [2023-12-02 17:33:19,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 17:33:19,837 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 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) Word has length 35 [2023-12-02 17:33:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:33:19,840 INFO L225 Difference]: With dead ends: 1457 [2023-12-02 17:33:19,840 INFO L226 Difference]: Without dead ends: 1457 [2023-12-02 17:33:19,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2023-12-02 17:33:19,841 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 64 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:33:19,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 29 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:33:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2023-12-02 17:33:19,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1055. [2023-12-02 17:33:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1054 states have (on average 3.342504743833017) internal successors, (3523), 1054 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:19,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 3523 transitions. [2023-12-02 17:33:19,860 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 3523 transitions. Word has length 35 [2023-12-02 17:33:19,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:33:19,860 INFO L495 AbstractCegarLoop]: Abstraction has 1055 states and 3523 transitions. [2023-12-02 17:33:19,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:33:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 3523 transitions. [2023-12-02 17:33:19,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 17:33:19,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:33:19,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:33:19,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 17:33:20,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-12-02 17:33:20,063 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:33:20,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:33:20,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1527862610, now seen corresponding path program 3 times [2023-12-02 17:33:20,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:33:20,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177213652] [2023-12-02 17:33:20,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:33:20,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:33:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:33:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:33:22,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:33:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177213652] [2023-12-02 17:33:22,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177213652] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:33:22,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327862605] [2023-12-02 17:33:22,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 17:33:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:33:22,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:33:22,263 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:33:22,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-12-02 17:33:22,398 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 17:33:22,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:33:22,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-02 17:33:22,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:33:23,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:33:23,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:33:23,126 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:33:23,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 17:33:23,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:33:23,613 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 47 treesize of output 31 [2023-12-02 17:33:23,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:33:23,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:33:23,969 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1091 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1091))) (let ((.cse1 (select .cse3 c_~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse1 c_~B~0.offset) c_~res1~0 (select .cse1 (+ 4 c_~B~0.offset)) (select .cse0 c_~A~0.offset)) (let ((.cse2 (* 4 c_~M~0))) (+ (select .cse1 (+ .cse2 c_~B~0.offset)) c_~res2~0 (select .cse0 (+ c_~A~0.offset .cse2)))))))) is different from false [2023-12-02 17:33:24,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:33:24,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 266 treesize of output 446 [2023-12-02 17:33:24,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:33:24,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 130 treesize of output 210 [2023-12-02 17:34:21,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 17:34:21,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327862605] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:34:21,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1390963702] [2023-12-02 17:34:21,694 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:34:21,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:34:21,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 16] total 54 [2023-12-02 17:34:21,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969045419] [2023-12-02 17:34:21,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:34:21,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-02 17:34:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:34:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-02 17:34:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2670, Unknown=1, NotChecked=104, Total=2970 [2023-12-02 17:34:21,696 INFO L87 Difference]: Start difference. First operand 1055 states and 3523 transitions. Second operand has 55 states, 55 states have (on average 1.709090909090909) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:34:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:34:33,619 INFO L93 Difference]: Finished difference Result 2456 states and 8034 transitions. [2023-12-02 17:34:33,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-12-02 17:34:33,620 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.709090909090909) internal successors, (94), 54 states have internal predecessors, (94), 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) Word has length 38 [2023-12-02 17:34:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:34:33,625 INFO L225 Difference]: With dead ends: 2456 [2023-12-02 17:34:33,625 INFO L226 Difference]: Without dead ends: 2449 [2023-12-02 17:34:33,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 45 SyntacticMatches, 10 SemanticMatches, 115 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=999, Invalid=12344, Unknown=1, NotChecked=228, Total=13572 [2023-12-02 17:34:33,629 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 501 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 7171 mSolverCounterSat, 89 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 7171 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 585 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:34:33,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 171 Invalid, 7858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 7171 Invalid, 13 Unknown, 585 Unchecked, 6.3s Time] [2023-12-02 17:34:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2023-12-02 17:34:33,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 1202. [2023-12-02 17:34:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1201 states have (on average 3.312239800166528) internal successors, (3978), 1201 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:34:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 3978 transitions. [2023-12-02 17:34:33,657 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 3978 transitions. Word has length 38 [2023-12-02 17:34:33,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:34:33,657 INFO L495 AbstractCegarLoop]: Abstraction has 1202 states and 3978 transitions. [2023-12-02 17:34:33,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.709090909090909) internal successors, (94), 54 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:34:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 3978 transitions. [2023-12-02 17:34:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 17:34:33,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:34:33,660 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:34:33,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-12-02 17:34:33,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 17:34:33,860 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:34:33,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:34:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 141275784, now seen corresponding path program 4 times [2023-12-02 17:34:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:34:33,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86806581] [2023-12-02 17:34:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:34:33,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:34:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:34:35,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:34:35,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86806581] [2023-12-02 17:34:35,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86806581] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:34:35,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424523594] [2023-12-02 17:34:35,580 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 17:34:35,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:34:35,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:34:35,581 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:34:35,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 17:34:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:34:35,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 17:34:35,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:34:36,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:34:36,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:34:36,452 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:34:36,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 17:34:36,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:36,958 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 47 treesize of output 31 [2023-12-02 17:34:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:34:36,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:34:37,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:37,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 266 treesize of output 446 [2023-12-02 17:34:37,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:34:37,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 130 treesize of output 210 [2023-12-02 17:36:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:36:44,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424523594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:36:44,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [839068038] [2023-12-02 17:36:44,269 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:36:44,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 17:36:44,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 16] total 50 [2023-12-02 17:36:44,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888013460] [2023-12-02 17:36:44,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 17:36:44,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-02 17:36:44,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:36:44,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-02 17:36:44,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2345, Unknown=18, NotChecked=0, Total=2550 [2023-12-02 17:36:44,271 INFO L87 Difference]: Start difference. First operand 1202 states and 3978 transitions. Second operand has 51 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:36:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:36:51,718 INFO L93 Difference]: Finished difference Result 2703 states and 9097 transitions. [2023-12-02 17:36:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-12-02 17:36:51,718 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 50 states have internal predecessors, (94), 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) Word has length 38 [2023-12-02 17:36:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:36:51,727 INFO L225 Difference]: With dead ends: 2703 [2023-12-02 17:36:51,727 INFO L226 Difference]: Without dead ends: 2696 [2023-12-02 17:36:51,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1244, Invalid=9443, Unknown=25, NotChecked=0, Total=10712 [2023-12-02 17:36:51,728 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 428 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 5260 mSolverCounterSat, 127 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 5392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 5260 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-02 17:36:51,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 140 Invalid, 5392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 5260 Invalid, 5 Unknown, 0 Unchecked, 4.1s Time] [2023-12-02 17:36:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2023-12-02 17:36:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 1378. [2023-12-02 17:36:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1377 states have (on average 3.3718228031953523) internal successors, (4643), 1377 states have internal predecessors, (4643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:36:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 4643 transitions. [2023-12-02 17:36:51,761 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 4643 transitions. Word has length 38 [2023-12-02 17:36:51,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:36:51,761 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 4643 transitions. [2023-12-02 17:36:51,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:36:51,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 4643 transitions. [2023-12-02 17:36:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 17:36:51,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:36:51,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:36:51,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 17:36:51,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 17:36:51,966 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-02 17:36:51,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:36:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash -739682858, now seen corresponding path program 5 times [2023-12-02 17:36:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 17:36:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707318151] [2023-12-02 17:36:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:36:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 17:36:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:36:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 17:36:53,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 17:36:53,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707318151] [2023-12-02 17:36:53,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707318151] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 17:36:53,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976333101] [2023-12-02 17:36:53,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 17:36:53,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:36:53,943 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:36:53,943 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:36:53,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 17:36:54,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 17:36:54,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:36:54,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 74 conjunts are in the unsatisfiable core [2023-12-02 17:36:54,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:36:54,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:54,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-12-02 17:36:54,139 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:36:54,145 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:36:54,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:54,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:36:54,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:54,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:54,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-12-02 17:36:54,199 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:36:54,205 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:36:54,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:54,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:36:54,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:54,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-12-02 17:36:54,255 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:36:54,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:54,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-12-02 17:36:54,295 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:36:54,299 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-02 17:36:54,500 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 [2023-12-02 17:36:54,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 17:36:54,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-12-02 17:36:54,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:54,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 17:36:54,898 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 8 treesize of output 1 [2023-12-02 17:36:55,062 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 8 treesize of output 1 [2023-12-02 17:36:55,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:55,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:36:55,573 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 17:36:55,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2023-12-02 17:36:56,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:56,077 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 47 treesize of output 31 [2023-12-02 17:36:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:36:56,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:36:56,436 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1199 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1199))) (let ((.cse1 (select .cse3 c_~B~0.base)) (.cse0 (select .cse3 c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse1 (+ 4 c_~B~0.offset)) c_~res1~0 (select .cse1 c_~B~0.offset) (select .cse0 c_~A~0.offset)) (let ((.cse2 (* 4 c_~M~0))) (+ c_~res2~0 (select .cse1 (+ .cse2 c_~B~0.offset)) (select .cse0 (+ c_~A~0.offset .cse2)))))))) is different from false [2023-12-02 17:36:56,455 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1199 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1199))) (let ((.cse1 (select .cse4 c_~B~0.base)) (.cse0 (select .cse4 c_~A~0.base))) (= (+ (select .cse0 (+ c_~A~0.offset 4)) (select .cse1 (+ 4 c_~B~0.offset)) c_~res1~0 (select .cse1 c_~B~0.offset) (select .cse0 c_~A~0.offset)) (let ((.cse2 (* 4 c_~M~0)) (.cse3 (* |c_thread2Thread1of1ForFork2_~i~1#1| 4))) (+ c_~res2~0 (select .cse1 (+ .cse2 c_~B~0.offset)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse3 c_~B~0.offset)) (select .cse0 (+ c_~A~0.offset .cse2)) (select (select |c_#memory_int| c_~A~0.base) (+ .cse3 c_~A~0.offset)))))))) is different from false [2023-12-02 17:36:59,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:36:59,542 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 156 [2023-12-02 17:36:59,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:00,811 INFO L349 Elim1Store]: treesize reduction 8, result has 94.3 percent of original size [2023-12-02 17:37:00,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 3095396342 treesize of output 2902458489 [2023-12-02 17:37:03,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:03,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:03,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:03,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 10166 treesize of output 7710 [2023-12-02 17:37:03,792 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:03,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:03,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:03,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 7606 treesize of output 7390 [2023-12-02 17:37:04,148 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:04,157 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:04,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 7286 treesize of output 6110 [2023-12-02 17:37:04,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:04,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 17:37:04,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 17:37:04,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 6006 treesize of output 5470 [2023-12-02 17:37:40,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2023-12-02 17:37:40,930 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-02 17:37:40,931 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/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") [2023-12-02 17:37:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1372372022] [2023-12-02 17:37:40,931 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 17:37:40,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-02 17:37:40,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2023-12-02 17:37:40,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679720991] [2023-12-02 17:37:40,932 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:40,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 17:37:40,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 17:37:40,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 17:37:40,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2262, Unknown=9, NotChecked=194, Total=2652 [2023-12-02 17:37:40,933 INFO L87 Difference]: Start difference. First operand 1378 states and 4643 transitions. Second operand has 22 states, 22 states have (on average 1.6818181818181819) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:40,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=187, Invalid=2262, Unknown=9, NotChecked=194, Total=2652 [2023-12-02 17:37:40,934 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:40,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 17:37:40,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-12-02 17:37:41,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-12-02 17:37:41,135 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:436) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:278) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:365) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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: java.io.IOException: Stream closed at java.base/java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:442) at java.base/java.io.OutputStream.write(OutputStream.java:157) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-12-02 17:37:41,137 INFO L158 Benchmark]: Toolchain (without parser) took 459420.54ms. Allocated memory was 142.6MB in the beginning and 778.0MB in the end (delta: 635.4MB). Free memory was 105.1MB in the beginning and 237.5MB in the end (delta: -132.4MB). Peak memory consumption was 504.4MB. Max. memory is 16.1GB. [2023-12-02 17:37:41,137 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 17:37:41,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.35ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 92.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 17:37:41,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.86ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 90.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:37:41,138 INFO L158 Benchmark]: Boogie Preprocessor took 38.87ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 17:37:41,138 INFO L158 Benchmark]: RCFGBuilder took 999.69ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 87.9MB in the beginning and 87.5MB in the end (delta: 397.5kB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2023-12-02 17:37:41,138 INFO L158 Benchmark]: TraceAbstraction took 458077.82ms. Allocated memory was 178.3MB in the beginning and 778.0MB in the end (delta: 599.8MB). Free memory was 87.5MB in the beginning and 237.5MB in the end (delta: -150.0MB). Peak memory consumption was 450.1MB. Max. memory is 16.1GB. [2023-12-02 17:37:41,140 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.20ms. Allocated memory is still 142.6MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.35ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 92.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.86ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 90.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.87ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 87.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 999.69ms. Allocated memory was 142.6MB in the beginning and 178.3MB in the end (delta: 35.7MB). Free memory was 87.9MB in the beginning and 87.5MB in the end (delta: 397.5kB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * TraceAbstraction took 458077.82ms. Allocated memory was 178.3MB in the beginning and 778.0MB in the end (delta: 599.8MB). Free memory was 87.5MB in the beginning and 237.5MB in the end (delta: -150.0MB). Peak memory consumption was 450.1MB. 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 17:37:42,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 17:37:42,944 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 17:37:42,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 17:37:42,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 17:37:42,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 17:37:42,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 17:37:42,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 17:37:42,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 17:37:42,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 17:37:42,980 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 17:37:42,981 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 17:37:42,981 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 17:37:42,982 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 17:37:42,982 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 17:37:42,983 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 17:37:42,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 17:37:42,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 17:37:42,985 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 17:37:42,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 17:37:42,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 17:37:42,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 17:37:42,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 17:37:42,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 17:37:42,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 17:37:42,989 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 17:37:42,989 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 17:37:42,989 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 17:37:42,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 17:37:42,990 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 17:37:42,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 17:37:42,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 17:37:42,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 17:37:42,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 17:37:42,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:37:42,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 17:37:42,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 17:37:42,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 17:37:42,993 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 17:37:42,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 17:37:42,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 17:37:42,994 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 17:37:42,994 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 17:37:42,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 17:37:42,994 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 6d47c8696b49948f6f8f53dd9eda6f4e0281717fd9a29e264a19ded5493fa577 [2023-12-02 17:37:43,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 17:37:43,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 17:37:43,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 17:37:43,304 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 17:37:43,304 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 17:37:43,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2023-12-02 17:37:46,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 17:37:46,294 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 17:37:46,294 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c [2023-12-02 17:37:46,303 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/data/4682c7ace/ed6e4169245743529103309825141ef0/FLAGa9a8eebb9 [2023-12-02 17:37:46,318 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/data/4682c7ace/ed6e4169245743529103309825141ef0 [2023-12-02 17:37:46,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 17:37:46,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 17:37:46,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 17:37:46,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 17:37:46,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 17:37:46,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee61452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46, skipping insertion in model container [2023-12-02 17:37:46,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,353 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:37:46,515 WARN L240 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-12-02 17:37:46,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:37:46,543 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 17:37:46,548 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 17:37:46,563 WARN L240 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-12-02 17:37:46,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:37:46,574 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 17:37:46,599 WARN L240 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_b0b8e561-b78d-4220-9df9-bf80f9f1d677/sv-benchmarks/c/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-12-02 17:37:46,604 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 17:37:46,614 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 17:37:46,615 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 17:37:46,622 INFO L206 MainTranslator]: Completed translation [2023-12-02 17:37:46,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46 WrapperNode [2023-12-02 17:37:46,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 17:37:46,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 17:37:46,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 17:37:46,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 17:37:46,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,678 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 272 [2023-12-02 17:37:46,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 17:37:46,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 17:37:46,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 17:37:46,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 17:37:46,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 17:37:46,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 17:37:46,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 17:37:46,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 17:37:46,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (1/1) ... [2023-12-02 17:37:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 17:37:46,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:46,765 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 17:37:46,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 17:37:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 17:37:46,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 17:37:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 17:37:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 17:37:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-02 17:37:46,802 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-02 17:37:46,802 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-02 17:37:46,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-02 17:37:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-02 17:37:46,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-02 17:37:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-02 17:37:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-02 17:37:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 17:37:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 17:37:46,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 17:37:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 17:37:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 17:37:46,807 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 17:37:46,957 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 17:37:46,959 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 17:37:47,463 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 17:37:47,957 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 17:37:47,957 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 17:37:47,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:47 BoogieIcfgContainer [2023-12-02 17:37:47,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 17:37:47,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 17:37:47,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 17:37:47,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 17:37:47,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:37:46" (1/3) ... [2023-12-02 17:37:47,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14413b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:37:47, skipping insertion in model container [2023-12-02 17:37:47,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:37:46" (2/3) ... [2023-12-02 17:37:47,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14413b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:37:47, skipping insertion in model container [2023-12-02 17:37:47,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:37:47" (3/3) ... [2023-12-02 17:37:47,965 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2023-12-02 17:37:47,972 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 17:37:47,980 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 17:37:47,980 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 17:37:47,980 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 17:37:48,032 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 17:37:48,055 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 42 places, 37 transitions, 95 flow [2023-12-02 17:37:48,106 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 377 states, 376 states have (on average 3.25531914893617) internal successors, (1224), 376 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:48,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 17:37:48,127 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, 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;@2310ace6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 17:37:48,128 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-02 17:37:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 377 states, 376 states have (on average 3.25531914893617) internal successors, (1224), 376 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:48,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-02 17:37:48,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:48,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:48,147 INFO L420 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)] === [2023-12-02 17:37:48,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1594854437, now seen corresponding path program 1 times [2023-12-02 17:37:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:37:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707202494] [2023-12-02 17:37:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:48,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:48,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:37:48,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:37:48,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 17:37:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:48,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 17:37:48,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:48,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:37:48,560 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:37:48,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707202494] [2023-12-02 17:37:48,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707202494] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:37:48,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:37:48,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 17:37:48,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993828932] [2023-12-02 17:37:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:37:48,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 17:37:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:37:48,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 17:37:48,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:37:48,604 INFO L87 Difference]: Start difference. First operand has 377 states, 376 states have (on average 3.25531914893617) internal successors, (1224), 376 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:48,820 INFO L93 Difference]: Finished difference Result 580 states and 1880 transitions. [2023-12-02 17:37:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 17:37:48,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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) Word has length 22 [2023-12-02 17:37:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:48,840 INFO L225 Difference]: With dead ends: 580 [2023-12-02 17:37:48,841 INFO L226 Difference]: Without dead ends: 573 [2023-12-02 17:37:48,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 17:37:48,845 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:48,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 17:37:48,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2023-12-02 17:37:48,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 467. [2023-12-02 17:37:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 3.242489270386266) internal successors, (1511), 466 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1511 transitions. [2023-12-02 17:37:48,920 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1511 transitions. Word has length 22 [2023-12-02 17:37:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:48,921 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 1511 transitions. [2023-12-02 17:37:48,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1511 transitions. [2023-12-02 17:37:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 17:37:48,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:48,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:48,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 17:37:49,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:49,130 INFO L420 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)] === [2023-12-02 17:37:49,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 324034702, now seen corresponding path program 1 times [2023-12-02 17:37:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:37:49,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263347822] [2023-12-02 17:37:49,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:49,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:49,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:37:49,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:37:49,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 17:37:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:49,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:37:49,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 17:37:49,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:37:49,520 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:37:49,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263347822] [2023-12-02 17:37:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263347822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:37:49,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:37:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 17:37:49,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541918747] [2023-12-02 17:37:49,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:37:49,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 17:37:49,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:37:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 17:37:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-02 17:37:49,524 INFO L87 Difference]: Start difference. First operand 467 states and 1511 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:50,145 INFO L93 Difference]: Finished difference Result 697 states and 2316 transitions. [2023-12-02 17:37:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 17:37:50,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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) Word has length 25 [2023-12-02 17:37:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:50,152 INFO L225 Difference]: With dead ends: 697 [2023-12-02 17:37:50,152 INFO L226 Difference]: Without dead ends: 697 [2023-12-02 17:37:50,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:37:50,154 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 80 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:50,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 3 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 17:37:50,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2023-12-02 17:37:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 513. [2023-12-02 17:37:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 3.2734375) internal successors, (1676), 512 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 1676 transitions. [2023-12-02 17:37:50,187 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 1676 transitions. Word has length 25 [2023-12-02 17:37:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:50,188 INFO L495 AbstractCegarLoop]: Abstraction has 513 states and 1676 transitions. [2023-12-02 17:37:50,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 1676 transitions. [2023-12-02 17:37:50,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-02 17:37:50,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:50,190 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:50,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-02 17:37:50,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:50,395 INFO L420 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)] === [2023-12-02 17:37:50,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:50,396 INFO L85 PathProgramCache]: Analyzing trace with hash -197919316, now seen corresponding path program 2 times [2023-12-02 17:37:50,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:37:50,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737922487] [2023-12-02 17:37:50,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:37:50,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:50,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:37:50,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:37:50,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 17:37:50,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 17:37:50,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:37:50,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 17:37:50,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:37:50,571 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:37:50,571 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:37:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737922487] [2023-12-02 17:37:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737922487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:37:50,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:37:50,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 17:37:50,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579973184] [2023-12-02 17:37:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:37:50,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 17:37:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:37:50,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 17:37:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 17:37:50,574 INFO L87 Difference]: Start difference. First operand 513 states and 1676 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:50,869 INFO L93 Difference]: Finished difference Result 516 states and 1679 transitions. [2023-12-02 17:37:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 17:37:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 25 [2023-12-02 17:37:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:50,875 INFO L225 Difference]: With dead ends: 516 [2023-12-02 17:37:50,875 INFO L226 Difference]: Without dead ends: 515 [2023-12-02 17:37:50,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 17:37:50,877 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:50,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 17:37:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2023-12-02 17:37:50,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2023-12-02 17:37:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 514 states have (on average 3.264591439688716) internal successors, (1678), 514 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1678 transitions. [2023-12-02 17:37:50,902 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1678 transitions. Word has length 25 [2023-12-02 17:37:50,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:50,902 INFO L495 AbstractCegarLoop]: Abstraction has 515 states and 1678 transitions. [2023-12-02 17:37:50,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:50,902 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1678 transitions. [2023-12-02 17:37:50,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:37:50,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:50,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:50,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-02 17:37:51,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:51,106 INFO L420 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)] === [2023-12-02 17:37:51,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1776220398, now seen corresponding path program 1 times [2023-12-02 17:37:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:37:51,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738570832] [2023-12-02 17:37:51,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:51,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:51,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:37:51,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:37:51,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-02 17:37:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:51,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:37:51,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:37:51,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 17:37:51,499 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:37:51,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738570832] [2023-12-02 17:37:51,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738570832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 17:37:51,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 17:37:51,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 17:37:51,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825705209] [2023-12-02 17:37:51,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 17:37:51,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 17:37:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:37:51,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 17:37:51,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-02 17:37:51,501 INFO L87 Difference]: Start difference. First operand 515 states and 1678 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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) [2023-12-02 17:37:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:52,249 INFO L93 Difference]: Finished difference Result 745 states and 2513 transitions. [2023-12-02 17:37:52,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 17:37:52,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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) Word has length 27 [2023-12-02 17:37:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:52,256 INFO L225 Difference]: With dead ends: 745 [2023-12-02 17:37:52,256 INFO L226 Difference]: Without dead ends: 745 [2023-12-02 17:37:52,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-02 17:37:52,258 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:52,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 4 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 17:37:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-12-02 17:37:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 545. [2023-12-02 17:37:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 3.295955882352941) internal successors, (1793), 544 states have internal predecessors, (1793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1793 transitions. [2023-12-02 17:37:52,285 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1793 transitions. Word has length 27 [2023-12-02 17:37:52,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:52,286 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 1793 transitions. [2023-12-02 17:37:52,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 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) [2023-12-02 17:37:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1793 transitions. [2023-12-02 17:37:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-02 17:37:52,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:52,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:52,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-02 17:37:52,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:52,489 INFO L420 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)] === [2023-12-02 17:37:52,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1343256254, now seen corresponding path program 2 times [2023-12-02 17:37:52,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:37:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224625234] [2023-12-02 17:37:52,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:37:52,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:52,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:37:52,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:37:52,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-02 17:37:52,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:37:52,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:37:52,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 17:37:52,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:37:52,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:37:53,111 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 17:37:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224625234] [2023-12-02 17:37:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224625234] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1516252142] [2023-12-02 17:37:53,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:37:53,112 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 17:37:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 17:37:53,115 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 17:37:53,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-02 17:37:53,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:37:53,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:37:53,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 17:37:53,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 17:37:53,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:37:53,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1516252142] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:53,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797638653] [2023-12-02 17:37:53,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 17:37:53,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 17:37:53,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 17:37:53,901 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 17:37:53,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 17:37:54,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 17:37:54,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 17:37:54,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 17:37:54,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:37:54,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:37:54,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:37:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 17:37:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797638653] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 17:37:54,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 17:37:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6, 6, 7, 9] total 27 [2023-12-02 17:37:54,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581757591] [2023-12-02 17:37:54,617 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 17:37:54,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-02 17:37:54,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 17:37:54,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-02 17:37:54,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2023-12-02 17:37:54,619 INFO L87 Difference]: Start difference. First operand 545 states and 1793 transitions. Second operand has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 17:37:59,055 INFO L93 Difference]: Finished difference Result 1867 states and 6286 transitions. [2023-12-02 17:37:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 17:37:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 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) Word has length 27 [2023-12-02 17:37:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 17:37:59,072 INFO L225 Difference]: With dead ends: 1867 [2023-12-02 17:37:59,072 INFO L226 Difference]: Without dead ends: 1867 [2023-12-02 17:37:59,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=754, Invalid=2438, Unknown=0, NotChecked=0, Total=3192 [2023-12-02 17:37:59,074 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 415 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-02 17:37:59,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 11 Invalid, 1439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-02 17:37:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1867 states. [2023-12-02 17:37:59,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 756. [2023-12-02 17:37:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 3.2940397350993376) internal successors, (2487), 755 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 2487 transitions. [2023-12-02 17:37:59,109 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 2487 transitions. Word has length 27 [2023-12-02 17:37:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 17:37:59,110 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 2487 transitions. [2023-12-02 17:37:59,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 27 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 17:37:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 2487 transitions. [2023-12-02 17:37:59,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 17:37:59,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 17:37:59,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 17:37:59,117 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 17:37:59,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 17:37:59,517 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-02 17:37:59,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 17:37:59,714 INFO L420 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)] === [2023-12-02 17:37:59,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 17:37:59,715 INFO L85 PathProgramCache]: Analyzing trace with hash 386691183, now seen corresponding path program 1 times [2023-12-02 17:37:59,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 17:37:59,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276097823] [2023-12-02 17:37:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 17:37:59,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 17:37:59,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 17:37:59,717 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 17:37:59,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0b8e561-b78d-4220-9df9-bf80f9f1d677/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-02 17:37:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 17:37:59,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 17:37:59,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 17:38:00,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:00,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 17:38:01,056 INFO L349 Elim1Store]: treesize reduction 112, result has 56.4 percent of original size [2023-12-02 17:38:01,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 24 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 127 treesize of output 179 [2023-12-02 17:38:40,210 WARN L293 SmtUtils]: Spent 15.18s on a formula simplification that was a NOOP. DAG size: 919 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 17:39:00,467 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse3 (exists ((|thread3Thread1of1ForFork1_~i~2#1| (_ BitVec 32))) (and (bvsge |thread3Thread1of1ForFork1_~i~2#1| (_ bv0 32)) (bvslt |thread3Thread1of1ForFork1_~i~2#1| c_~N~0) (not (= (bvmul (_ bv4 32) |thread3Thread1of1ForFork1_~i~2#1|) (_ bv0 32))))))) (or (and (or (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse1 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) (.cse0 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse0 v_arrayElimCell_16) v_arrayElimCell_8) .cse1) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8))) (= (bvadd .cse1 (concat (concat .cse0 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse2 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) .cse2) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd .cse2 (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))))) .cse3) (and .cse3 (or (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse4 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) .cse4) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) .cse4))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse5 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) .cse5)) (exists ((v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) .cse5)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse6 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse6 v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat .cse6 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse7 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse7 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse7 v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse8 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat .cse8 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse8 v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) .cse9)) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) .cse9) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse10 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse10 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse10 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse11 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse11 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse11 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse12 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat .cse12 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse12 v_arrayElimCell_1) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse13 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse13 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse13 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse14 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse14 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse14 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse15 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse15 v_arrayElimCell_7))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat .cse15 v_arrayElimCell_11)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse16 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse16 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat .cse16 v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse17 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat .cse17 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse17 v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse18 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat .cse18 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse18 v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse19 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse19 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat .cse19 v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse20 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse20 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse20 v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse21 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse21 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse21 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse22 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) .cse22)) (exists ((v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) .cse22) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse23 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) .cse23))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) .cse23))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse24 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd .cse24 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) .cse24))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse25 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd .cse25 (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) .cse25))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse26 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd .cse26 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) .cse26))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse27 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse27 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse27 v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse28 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse28 v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat .cse28 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse29 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse29 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse29 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse30 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse30 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse30 v_arrayElimCell_13) v_arrayElimCell_7))))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse31 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse31 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat .cse31 v_arrayElimCell_13) v_arrayElimCell_7))))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse32 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse32 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat .cse32 v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse33 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat .cse33 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse33 v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse34 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse34 v_arrayElimCell_1) v_arrayElimCell_7))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat .cse34 v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse35 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat .cse35 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse35 v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))))) (and (or (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse37 (concat v_arrayElimCell_10 v_arrayElimCell_9)) (.cse36 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8))) (= (bvadd (concat (concat .cse36 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse37 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= (bvadd (concat (concat .cse37 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse36 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse39 (concat v_arrayElimCell_3 v_arrayElimCell_6)) (.cse38 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= (bvadd .cse38 (concat (concat .cse39 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat .cse39 v_arrayElimCell_13) v_arrayElimCell_11) .cse38)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse40 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse40 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat (concat .cse40 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse42 (concat v_arrayElimCell_3 v_arrayElimCell_6)) (.cse41 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse41 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse42 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8))) (= (bvadd (concat (concat .cse42 v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse41 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse43 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) (.cse44 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= (bvadd .cse43 (concat (concat .cse44 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_13 (_ BitVec 8))) (= (bvadd .cse43 (concat (concat .cse44 v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse45 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse45 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat .cse45 v_arrayElimCell_13) v_arrayElimCell_7))))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse46 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat .cse46 v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse46 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse47 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse47 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse47 v_arrayElimCell_13) v_arrayElimCell_7))))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse49 (concat v_arrayElimCell_3 v_arrayElimCell_6)) (.cse48 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse48 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse49 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8))) (= (bvadd (concat (concat .cse49 v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse48 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse50 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat (concat .cse50 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse50 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse51 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse51 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat (concat .cse51 v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse52 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16)) (.cse53 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= (bvadd (concat .cse52 v_arrayElimCell_8) (concat (concat .cse53 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8))) (= (bvadd (concat .cse52 v_arrayElimCell_14) (concat (concat .cse53 v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse54 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse54 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat (concat .cse54 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse56 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16)) (.cse55 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8))) (= (bvadd (concat (concat .cse55 v_arrayElimCell_13) v_arrayElimCell_11) (concat .cse56 v_arrayElimCell_14)) c_~res1~0)) (= (bvadd (concat .cse56 v_arrayElimCell_8) (concat (concat .cse55 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse58 (concat v_arrayElimCell_10 v_arrayElimCell_9)) (.cse57 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8))) (= (bvadd (concat (concat .cse57 v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse58 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= (bvadd (concat (concat .cse58 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse57 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse59 (concat v_arrayElimCell_3 v_arrayElimCell_6))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat .cse59 v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat .cse59 v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))))) .cse3) (and (or (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse60 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat .cse60 v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse60 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse61 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (= (bvadd (concat .cse61 v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat .cse61 v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse62 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat .cse62 v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat .cse62 v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse63 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse63 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse63 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse64 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse64 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse64 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse65 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= (bvadd .cse65 (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) .cse65)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse66 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (= (bvadd (concat .cse66 v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat .cse66 v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse67 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat .cse67 v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= (bvadd (concat .cse67 v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse68 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) .cse68)) (exists ((v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd .cse68 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse69 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat .cse69 v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat .cse69 v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse70 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse70 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse70 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse71 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse71 v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse71 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse72 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat .cse72 v_arrayElimCell_8))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat .cse72 v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse73 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) .cse73)) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd .cse73 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= (bvadd .cse74 (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd .cse74 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse75 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat .cse75 v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse75 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse76 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse76 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse76 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse77 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat .cse77 v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse77 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse78 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat .cse78 v_arrayElimCell_8))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat .cse78 v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) .cse79)) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) .cse79)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse80 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse80 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse80 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse81 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse81 v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse81 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse82 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse82 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse82 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse83 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse83 v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse83 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse84 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat .cse84 v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse84 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse85 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse85 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= (bvadd (concat (concat .cse85 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse86 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= (bvadd .cse86 (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd .cse86 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse87 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse87 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse87 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse88 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (= (bvadd (concat .cse88 v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat .cse88 v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse89 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse89 v_arrayElimCell_16) v_arrayElimCell_8))) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse89 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse90 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= (bvadd .cse90 (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) .cse90)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_2) v_arrayElimCell_1) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_4) v_arrayElimCell_16) v_arrayElimCell_8))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8))) (let ((.cse91 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_2) v_arrayElimCell_13) v_arrayElimCell_7) .cse91)) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) .cse91))))))) .cse3) (and (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse92 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (and (= .cse92 c_~res2~0) (= .cse92 c_~res1~0)))) (bvslt (_ bv0 32) c_~N~0)) (and (or (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse93 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse93 v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat .cse93 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse95 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13)) (.cse94 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= (bvadd .cse94 (concat .cse95 v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat .cse95 v_arrayElimCell_11) .cse94)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse97 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13)) (.cse96 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse96 v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse97 v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8))) (= (bvadd (concat .cse97 v_arrayElimCell_11) (concat (concat .cse96 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse98 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse98 v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat .cse98 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))))) .cse3) (and .cse3 (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) .cse99)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) .cse99) c_~res2~0))))) (and .cse3 (or (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse100 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse100 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse100 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse101 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat .cse101 v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat .cse101 v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse102 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat .cse102 v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat .cse102 v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse103 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat .cse103 v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= (bvadd (concat .cse103 v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse104 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse104 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse104 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse105 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse105 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat .cse105 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (exists ((v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd .cse106 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0)) (= c_~res2~0 (bvadd .cse106 (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse107 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse107 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse107 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse108 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) .cse108))) (= c_~res2~0 (bvadd .cse108 (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse109 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16))) (and (= (bvadd (concat .cse109 v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat .cse109 v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse110 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) (concat (concat .cse110 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat .cse110 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse111 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse111 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse111 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse112 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= (bvadd .cse112 (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd .cse112 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse113 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse113 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat .cse113 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse114 (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8))) (and (= (bvadd .cse114 (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_1) v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_11) .cse114)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse115 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7) (concat (concat .cse115 v_arrayElimCell_12) v_arrayElimCell_8)) c_~res1~0)) (= c_~res2~0 (bvadd (concat (concat .cse115 v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (exists ((v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)))) (= c_~res2~0 (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat (concat (concat v_arrayElimCell_15 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))))))) (and (or (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse116 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16)) (.cse117 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (= (bvadd (concat .cse116 v_arrayElimCell_8) .cse117) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8))) (= (bvadd (concat .cse116 v_arrayElimCell_14) .cse117) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse118 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) (concat .cse118 v_arrayElimCell_11)) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse118 v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse120 (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16)) (.cse119 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (exists ((v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8))) (= (bvadd (concat .cse119 v_arrayElimCell_11) (concat .cse120 v_arrayElimCell_14)) c_~res1~0)) (= (bvadd (concat .cse120 v_arrayElimCell_8) (concat .cse119 v_arrayElimCell_7)) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse121 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse121 v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat .cse121 v_arrayElimCell_11) (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse122 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_12) v_arrayElimCell_14) .cse122) c_~res1~0)) (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) .cse122) c_~res2~0)))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse123 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7))) (and (= (bvadd (concat (concat (concat v_arrayElimCell_10 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_8) .cse123) c_~res2~0) (exists ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8))) (= c_~res1~0 (bvadd (concat (concat (concat v_arrayElimCell_5 v_arrayElimCell_9) v_arrayElimCell_16) v_arrayElimCell_14) .cse123)))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13) v_arrayElimCell_7)) (.cse124 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse124 v_arrayElimCell_16) v_arrayElimCell_8) .cse125) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8))) (= (bvadd .cse125 (concat (concat .cse124 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0))))) (exists ((v_arrayElimCell_10 (_ BitVec 8)) (v_arrayElimCell_13 (_ BitVec 8)) (v_arrayElimCell_16 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_9 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (let ((.cse127 (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_13)) (.cse126 (concat v_arrayElimCell_10 v_arrayElimCell_9))) (and (= (bvadd (concat (concat .cse126 v_arrayElimCell_16) v_arrayElimCell_8) (concat .cse127 v_arrayElimCell_7)) c_~res2~0) (exists ((v_arrayElimCell_12 (_ BitVec 8)) (v_arrayElimCell_11 (_ BitVec 8)) (v_arrayElimCell_14 (_ BitVec 8))) (= (bvadd (concat .cse127 v_arrayElimCell_11) (concat (concat .cse126 v_arrayElimCell_12) v_arrayElimCell_14)) c_~res1~0)))))) .cse3))) (= (_ bv1 32) |c_thread1Thread1of1ForFork2_~i~0#1|) (bvule c_~N~0 (_ bv1073741823 32))) is different from false [2023-12-02 17:39:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2023-12-02 17:39:14,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 17:39:30,450 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification. DAG size of input: 374 DAG size of output: 290 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 17:39:30,450 INFO L349 Elim1Store]: treesize reduction 336, result has 77.1 percent of original size [2023-12-02 17:39:30,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 173 treesize of output 1162