./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1c4755c5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1c4755c-m [2024-12-17 14:25:22,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-17 14:25:22,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-12-17 14:25:22,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-17 14:25:22,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-17 14:25:22,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-17 14:25:22,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-17 14:25:22,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-17 14:25:22,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-17 14:25:22,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-17 14:25:22,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-17 14:25:22,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-17 14:25:22,344 INFO L153 SettingsManager]: * Use SBE=true [2024-12-17 14:25:22,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-17 14:25:22,345 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-17 14:25:22,345 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-17 14:25:22,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-12-17 14:25:22,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-17 14:25:22,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-17 14:25:22,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-17 14:25:22,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-17 14:25:22,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-17 14:25:22,346 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-17 14:25:22,346 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-17 14:25:22,346 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-17 14:25:22,346 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-17 14:25:22,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-17 14:25:22,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-17 14:25:22,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-17 14:25:22,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-17 14:25:22,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 14:25:22,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-17 14:25:22,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-17 14:25:22,348 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-17 14:25:22,348 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-17 14:25:22,348 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-17 14:25:22,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-12-17 14:25:22,348 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-17 14:25:22,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-12-17 14:25:22,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-17 14:25:22,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-17 14:25:22,349 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-17 14:25:22,349 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-17 14:25:22,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2024-12-17 14:25:22,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-17 14:25:22,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-17 14:25:22,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-17 14:25:22,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-17 14:25:22,638 INFO L274 PluginConnector]: CDTParser initialized [2024-12-17 14:25:22,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-12-17 14:25:23,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a77907521/60af03a982364ec1987b01b85afc9f01/FLAGcb2261492 [2024-12-17 14:25:24,203 INFO L384 CDTParser]: Found 1 translation units. [2024-12-17 14:25:24,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-12-17 14:25:24,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a77907521/60af03a982364ec1987b01b85afc9f01/FLAGcb2261492 [2024-12-17 14:25:24,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a77907521/60af03a982364ec1987b01b85afc9f01 [2024-12-17 14:25:24,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-17 14:25:24,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-17 14:25:24,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-17 14:25:24,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-17 14:25:24,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-17 14:25:24,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2d95f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24, skipping insertion in model container [2024-12-17 14:25:24,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-17 14:25:24,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-12-17 14:25:24,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 14:25:24,403 INFO L200 MainTranslator]: Completed pre-run [2024-12-17 14:25:24,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-12-17 14:25:24,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 14:25:24,434 INFO L204 MainTranslator]: Completed translation [2024-12-17 14:25:24,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24 WrapperNode [2024-12-17 14:25:24,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-17 14:25:24,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-17 14:25:24,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-17 14:25:24,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-17 14:25:24,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,483 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 247 [2024-12-17 14:25:24,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-17 14:25:24,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-17 14:25:24,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-17 14:25:24,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-17 14:25:24,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-17 14:25:24,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-17 14:25:24,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-17 14:25:24,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-17 14:25:24,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (1/1) ... [2024-12-17 14:25:24,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 14:25:24,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:24,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-17 14:25:24,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-17 14:25:24,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-17 14:25:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-17 14:25:24,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-17 14:25:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-17 14:25:24,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-17 14:25:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-12-17 14:25:24,591 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-12-17 14:25:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-12-17 14:25:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-12-17 14:25:24,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-17 14:25:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-17 14:25:24,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-17 14:25:24,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-12-17 14:25:24,593 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-17 14:25:24,683 INFO L234 CfgBuilder]: Building ICFG [2024-12-17 14:25:24,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-17 14:25:25,116 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-17 14:25:25,116 INFO L283 CfgBuilder]: Performing block encoding [2024-12-17 14:25:25,469 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-17 14:25:25,469 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-17 14:25:25,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:25:25 BoogieIcfgContainer [2024-12-17 14:25:25,470 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-17 14:25:25,472 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-17 14:25:25,472 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-17 14:25:25,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-17 14:25:25,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:25:24" (1/3) ... [2024-12-17 14:25:25,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f39287f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:25:25, skipping insertion in model container [2024-12-17 14:25:25,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:25:24" (2/3) ... [2024-12-17 14:25:25,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f39287f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:25:25, skipping insertion in model container [2024-12-17 14:25:25,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:25:25" (3/3) ... [2024-12-17 14:25:25,478 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-12-17 14:25:25,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-17 14:25:25,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-12-17 14:25:25,492 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-17 14:25:25,545 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-17 14:25:25,587 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 14:25:25,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-17 14:25:25,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:25,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-17 14:25:25,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-17 14:25:25,663 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 14:25:25,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 14:25:25,681 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@701ee161, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 14:25:25,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-12-17 14:25:26,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:26,422 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:26,423 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #1 [2024-12-17 14:25:26,423 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:25:26,424 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:26,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash -101807487, now seen corresponding path program 1 times [2024-12-17 14:25:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884512567] [2024-12-17 14:25:26,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:25:26,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:26,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884512567] [2024-12-17 14:25:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884512567] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 14:25:26,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 14:25:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 14:25:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637680514] [2024-12-17 14:25:26,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:25:26,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 14:25:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:26,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 14:25:26,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 14:25:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:26,949 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:26,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:25:26,951 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:27,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-12-17 14:25:27,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:27,244 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:27,244 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #2 [2024-12-17 14:25:27,244 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:25:27,244 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:25:27,245 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:27,245 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 14:25:27,245 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:27,245 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 14:25:27,260 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:27,260 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 14:25:27,261 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:27,261 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:25:27,261 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:27,261 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2024-12-17 14:25:27,261 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:27,261 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2024-12-17 14:25:27,262 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:27,262 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2024-12-17 14:25:27,262 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:27,262 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:25:27,262 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:27,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:27,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1139583931, now seen corresponding path program 1 times [2024-12-17 14:25:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:27,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049980415] [2024-12-17 14:25:27,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:27,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:25:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049980415] [2024-12-17 14:25:27,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049980415] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 14:25:27,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 14:25:27,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-17 14:25:27,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14035669] [2024-12-17 14:25:27,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:25:27,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-17 14:25:27,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:27,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-17 14:25:27,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-17 14:25:27,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:27,495 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:27,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 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) [2024-12-17 14:25:27,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:27,495 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:27,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-12-17 14:25:27,618 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:27,618 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:27,619 INFO L139 ounterexampleChecker]: Examining path program with hash 1194149698, occurence #3 [2024-12-17 14:25:27,619 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:25:27,619 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:25:27,619 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:27,619 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-12-17 14:25:27,619 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:27,619 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 14:25:27,620 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:27,620 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:25:27,620 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:27,620 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:25:27,620 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:27,620 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2024-12-17 14:25:27,620 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:27,620 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 22 [2024-12-17 14:25:27,620 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:27,620 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2024-12-17 14:25:27,620 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:27,620 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:25:27,620 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:27,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash -419710619, now seen corresponding path program 1 times [2024-12-17 14:25:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143215293] [2024-12-17 14:25:27,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:27,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143215293] [2024-12-17 14:25:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143215293] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397969968] [2024-12-17 14:25:27,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:27,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:27,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:27,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:27,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-17 14:25:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:27,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-17 14:25:27,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:28,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:28,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:28,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397969968] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:28,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:25:28,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-12-17 14:25:28,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475413604] [2024-12-17 14:25:28,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:25:28,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-17 14:25:28,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:28,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-17 14:25:28,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-12-17 14:25:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:28,114 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:28,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 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) [2024-12-17 14:25:28,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:28,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:28,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:28,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:28,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-17 14:25:28,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:28,838 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:28,838 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:28,838 INFO L139 ounterexampleChecker]: Examining path program with hash -933235391, occurence #1 [2024-12-17 14:25:28,838 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:25:28,838 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:28,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1978403039, now seen corresponding path program 1 times [2024-12-17 14:25:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612830988] [2024-12-17 14:25:28,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612830988] [2024-12-17 14:25:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612830988] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253734066] [2024-12-17 14:25:29,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:29,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:29,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:29,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:29,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-17 14:25:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:29,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-17 14:25:29,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:29,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:29,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253734066] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:29,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:25:29,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-12-17 14:25:29,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817950710] [2024-12-17 14:25:29,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:25:29,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-17 14:25:29,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:29,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-17 14:25:29,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-12-17 14:25:29,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:29,242 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:29,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 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) [2024-12-17 14:25:29,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:29,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:29,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:29,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:29,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-17 14:25:30,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:30,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:30,044 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:30,044 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #1 [2024-12-17 14:25:30,044 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:25:30,044 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1275471846, now seen corresponding path program 1 times [2024-12-17 14:25:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:30,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24207415] [2024-12-17 14:25:30,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:30,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:30,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24207415] [2024-12-17 14:25:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24207415] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:30,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259625966] [2024-12-17 14:25:30,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:30,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:30,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:30,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-17 14:25:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:30,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-17 14:25:30,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:30,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:30,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259625966] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:25:30,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-12-17 14:25:30,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341043789] [2024-12-17 14:25:30,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:25:30,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-17 14:25:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:30,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-17 14:25:30,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-12-17 14:25:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:30,404 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:30,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:25:30,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:30,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:30,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:30,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:30,404 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:31,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:31,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-17 14:25:31,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:31,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:31,412 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:31,412 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #1 [2024-12-17 14:25:31,412 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:25:31,412 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:31,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash -922807690, now seen corresponding path program 1 times [2024-12-17 14:25:31,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190677133] [2024-12-17 14:25:31,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:25:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:32,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190677133] [2024-12-17 14:25:32,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190677133] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600530240] [2024-12-17 14:25:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:25:32,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:32,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:32,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:32,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-17 14:25:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:32,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-12-17 14:25:32,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:33,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-17 14:25:33,253 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 28 treesize of output 24 [2024-12-17 14:25:33,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:33,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:45,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-17 14:25:45,407 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 42 treesize of output 95 [2024-12-17 14:25:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:45,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600530240] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:25:45,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 14:25:45,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 24 [2024-12-17 14:25:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178597863] [2024-12-17 14:25:45,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 14:25:45,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-12-17 14:25:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:45,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-12-17 14:25:45,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=480, Unknown=6, NotChecked=0, Total=600 [2024-12-17 14:25:45,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:45,816 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:45,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 24 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:25:45,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:45,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:45,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:45,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:45,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:45,816 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:46,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:46,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-17 14:25:47,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:47,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:47,094 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:47,094 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #2 [2024-12-17 14:25:47,094 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:25:47,094 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:25:47,094 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:47,095 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-12-17 14:25:47,095 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:47,095 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 14:25:47,095 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:47,095 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:25:47,095 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:47,095 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:25:47,095 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:47,095 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2024-12-17 14:25:47,095 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:47,095 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2024-12-17 14:25:47,095 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:47,095 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2024-12-17 14:25:47,095 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:47,095 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:25:47,095 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1458381414, now seen corresponding path program 2 times [2024-12-17 14:25:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030169856] [2024-12-17 14:25:47,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 14:25:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:47,119 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 14:25:47,119 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030169856] [2024-12-17 14:25:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030169856] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:47,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034421869] [2024-12-17 14:25:47,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 14:25:47,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:47,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:47,234 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:47,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-17 14:25:47,351 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 14:25:47,351 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:47,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-17 14:25:47,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:47,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-17 14:25:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034421869] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:47,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:25:47,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 13 [2024-12-17 14:25:47,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569348475] [2024-12-17 14:25:47,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:25:47,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 14:25:47,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:47,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 14:25:47,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-12-17 14:25:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:47,486 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:47,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:25:47,487 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:47,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:47,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:47,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:47,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:47,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:47,489 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:48,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-12-17 14:25:48,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:48,371 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:48,371 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:48,371 INFO L139 ounterexampleChecker]: Examining path program with hash 817181991, occurence #1 [2024-12-17 14:25:48,371 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:25:48,371 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:48,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:48,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2084796771, now seen corresponding path program 3 times [2024-12-17 14:25:48,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:48,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223198768] [2024-12-17 14:25:48,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 14:25:48,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:48,390 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-17 14:25:48,390 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:48,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223198768] [2024-12-17 14:25:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223198768] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367964051] [2024-12-17 14:25:48,504 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 14:25:48,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:48,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:48,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:48,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-17 14:25:48,606 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-17 14:25:48,606 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:48,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-17 14:25:48,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:48,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-17 14:25:48,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367964051] provided 1 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:48,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:25:48,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 7] total 14 [2024-12-17 14:25:48,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163484448] [2024-12-17 14:25:48,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:25:48,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 14:25:48,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:48,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 14:25:48,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-12-17 14:25:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:48,729 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:48,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:25:48,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:48,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:48,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:48,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:48,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:48,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:48,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:48,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:49,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-17 14:25:49,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:49,598 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:49,598 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:49,598 INFO L139 ounterexampleChecker]: Examining path program with hash 1575774055, occurence #1 [2024-12-17 14:25:49,598 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:25:49,598 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:49,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:49,598 INFO L85 PathProgramCache]: Analyzing trace with hash -100311006, now seen corresponding path program 4 times [2024-12-17 14:25:49,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:49,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903071677] [2024-12-17 14:25:49,599 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-17 14:25:49,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:49,622 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-17 14:25:49,622 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-17 14:25:49,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903071677] [2024-12-17 14:25:49,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903071677] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244174951] [2024-12-17 14:25:49,693 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-17 14:25:49,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:49,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:49,697 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:49,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-17 14:25:49,826 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-17 14:25:49,826 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:49,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-12-17 14:25:49,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:25:49,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-12-17 14:25:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244174951] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:25:49,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 14:25:49,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2024-12-17 14:25:49,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213497646] [2024-12-17 14:25:49,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 14:25:49,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-12-17 14:25:49,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:49,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-12-17 14:25:49,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-12-17 14:25:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:49,976 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:49,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:49,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-17 14:25:51,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-12-17 14:25:51,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:51,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:51,297 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:51,298 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #2 [2024-12-17 14:25:51,298 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:25:51,298 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:25:51,298 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:51,298 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-12-17 14:25:51,298 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:51,298 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 14:25:51,298 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:51,298 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:25:51,298 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:51,298 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:25:51,298 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:51,298 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2024-12-17 14:25:51,298 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:51,298 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2024-12-17 14:25:51,298 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:51,298 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:25:51,298 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:51,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -633217275, now seen corresponding path program 5 times [2024-12-17 14:25:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373635752] [2024-12-17 14:25:51,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-17 14:25:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:51,318 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 14:25:51,318 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:51,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:51,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373635752] [2024-12-17 14:25:51,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373635752] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579421432] [2024-12-17 14:25:51,402 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-17 14:25:51,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:51,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:51,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:51,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-17 14:25:51,509 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 14:25:51,509 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:51,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-17 14:25:51,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:51,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:25:51,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579421432] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:25:51,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 14:25:51,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-12-17 14:25:51,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425627164] [2024-12-17 14:25:51,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 14:25:51,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-17 14:25:51,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:51,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-17 14:25:51,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-12-17 14:25:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:51,663 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:51,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:51,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-12-17 14:25:51,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-17 14:25:51,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:25:51,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-12-17 14:25:52,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:52,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:52,013 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:52,013 INFO L139 ounterexampleChecker]: Examining path program with hash -131118396, occurence #3 [2024-12-17 14:25:52,013 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:25:52,013 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:25:52,013 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:52,013 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2024-12-17 14:25:52,013 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:52,013 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:25:52,013 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:52,013 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:25:52,013 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:52,013 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2024-12-17 14:25:52,013 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:52,014 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2024-12-17 14:25:52,014 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:52,014 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2024-12-17 14:25:52,014 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:52,014 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:25:52,014 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 821773723, now seen corresponding path program 6 times [2024-12-17 14:25:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878073752] [2024-12-17 14:25:52,014 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-12-17 14:25:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:52,036 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-12-17 14:25:52,037 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-17 14:25:52,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878073752] [2024-12-17 14:25:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878073752] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:52,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739014289] [2024-12-17 14:25:52,169 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-12-17 14:25:52,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:52,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:52,171 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:52,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-17 14:25:52,291 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-12-17 14:25:52,292 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:25:52,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-17 14:25:52,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-17 14:25:52,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-17 14:25:52,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739014289] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:25:52,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 14:25:52,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2024-12-17 14:25:52,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80850477] [2024-12-17 14:25:52,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 14:25:52,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-12-17 14:25:52,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:25:52,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-12-17 14:25:52,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-12-17 14:25:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:52,466 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:25:52,466 INFO L472 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) [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:25:52,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:25:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:25:53,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-17 14:25:53,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:53,544 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:25:53,544 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:25:53,544 INFO L139 ounterexampleChecker]: Examining path program with hash -1533294132, occurence #3 [2024-12-17 14:25:53,544 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:25:53,544 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:25:53,544 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:53,545 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2024-12-17 14:25:53,545 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:53,545 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:25:53,545 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:53,545 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:25:53,545 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:53,545 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2024-12-17 14:25:53,545 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:53,545 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2024-12-17 14:25:53,545 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:25:53,545 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2024-12-17 14:25:53,545 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:25:53,545 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:25:53,545 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:25:53,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:25:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2102547615, now seen corresponding path program 7 times [2024-12-17 14:25:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-12-17 14:25:53,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026300650] [2024-12-17 14:25:53,545 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-12-17 14:25:53,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-12-17 14:25:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-12-17 14:25:54,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-12-17 14:25:54,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026300650] [2024-12-17 14:25:54,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026300650] provided 0 perfect and 1 imperfect interpolant sequences [2024-12-17 14:25:54,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944200473] [2024-12-17 14:25:54,954 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-12-17 14:25:54,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:25:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:25:54,956 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:25:54,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-17 14:25:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:25:55,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-12-17 14:25:55,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:25:55,421 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2024-12-17 14:25:55,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2024-12-17 14:25:55,725 INFO L349 Elim1Store]: treesize reduction 12, result has 88.6 percent of original size [2024-12-17 14:25:55,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 153 [2024-12-17 14:25:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-17 14:25:55,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:25:58,077 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (let ((.cse1 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse3 (select (select |c_#memory_int| c_~B~0.base) (+ .cse1 c_~B~0.offset))) (.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse1)))) (let ((.cse5 (store |c_#memory_int| ~C~0.base (store (select |c_#memory_int| ~C~0.base) (+ .cse1 ~C~0.offset) (+ .cse3 .cse4))))) (let ((.cse0 (select .cse5 c_~B~0.base)) (.cse2 (select .cse5 c_~A~0.base))) (= (+ (select .cse0 (+ .cse1 4 c_~B~0.offset)) (select .cse2 (+ c_~A~0.offset .cse1 4)) c_~csum~0 .cse3 .cse4) (+ (select .cse0 (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset)) (select .cse2 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~asum~0 c_~bsum~0))))))) is different from false [2024-12-17 14:26:00,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~B~0.offset Int) (~B~0.base Int) (~C~0.base Int)) (let ((.cse2 (select |c_#memory_int| ~B~0.base)) (.cse5 (* 4 |c_thread3Thread1of1ForFork2_~i~2#1|))) (let ((.cse4 (select .cse2 (+ .cse5 ~B~0.offset))) (.cse6 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse5)))) (let ((.cse7 (store |c_#memory_int| ~C~0.base (store (select |c_#memory_int| ~C~0.base) (+ .cse5 ~C~0.offset) (+ .cse4 .cse6))))) (let ((.cse3 (select .cse7 c_~A~0.base)) (.cse0 (select .cse7 ~B~0.base))) (= (let ((.cse1 (* |c_thread2Thread1of1ForFork1_~i~1#1| 4))) (+ (select .cse0 (+ ~B~0.offset 4 .cse1)) c_~asum~0 c_~bsum~0 (select .cse2 (+ ~B~0.offset .cse1)) (select .cse3 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))))) (+ .cse4 (select .cse3 (+ c_~A~0.offset .cse5 4)) (select .cse0 (+ .cse5 ~B~0.offset 4)) c_~csum~0 .cse6))))))) is different from false [2024-12-17 14:26:00,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-17 14:26:00,656 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 1396 treesize of output 1014 [2024-12-17 14:26:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2024-12-17 14:26:46,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944200473] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:26:46,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-12-17 14:26:46,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 10] total 33 [2024-12-17 14:26:46,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21237375] [2024-12-17 14:26:46,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-12-17 14:26:46,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-12-17 14:26:46,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-12-17 14:26:46,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-12-17 14:26:46,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=842, Unknown=2, NotChecked=122, Total=1122 [2024-12-17 14:26:46,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:26:46,330 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:26:46,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 33 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:26:46,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:26:46,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:26:46,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:27:00,150 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] [2024-12-17 14:27:02,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:04,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:07,532 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] [2024-12-17 14:27:10,021 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] [2024-12-17 14:27:12,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:14,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:19,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:21,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:24,062 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] [2024-12-17 14:27:26,445 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] [2024-12-17 14:27:28,991 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] [2024-12-17 14:27:31,465 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] [2024-12-17 14:27:33,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:35,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:37,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-12-17 14:27:45,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2024-12-17 14:27:45,695 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-12-17 14:27:45,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-17 14:27:45,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-12-17 14:27:45,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-12-17 14:27:45,919 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.next(NestedIterator.java:94) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1939) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:151) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:174) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEachOrdered(ReferencePipeline.java:601) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:236) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:362) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:287) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:238) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 63 more [2024-12-17 14:27:45,924 INFO L158 Benchmark]: Toolchain (without parser) took 141699.09ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 113.7MB in the beginning and 448.9MB in the end (delta: -335.2MB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. [2024-12-17 14:27:45,924 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-12-17 14:27:45,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.10ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-17 14:27:45,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.59ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 98.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-12-17 14:27:45,925 INFO L158 Benchmark]: Boogie Preprocessor took 50.08ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-12-17 14:27:45,925 INFO L158 Benchmark]: RCFGBuilder took 932.13ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 83.8MB in the end (delta: 13.6MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2024-12-17 14:27:45,925 INFO L158 Benchmark]: TraceAbstraction took 140451.80ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 83.0MB in the beginning and 448.9MB in the end (delta: -365.9MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2024-12-17 14:27:45,928 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.79ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.10ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.3MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.59ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 98.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.08ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 932.13ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 83.8MB in the end (delta: 13.6MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. * TraceAbstraction took 140451.80ms. Allocated memory was 142.6MB in the beginning and 645.9MB in the end (delta: 503.3MB). Free memory was 83.0MB in the beginning and 448.9MB in the end (delta: -365.9MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --traceabstraction.commutativity.condition.synthesis SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.3.0-dev-1c4755c-m [2024-12-17 14:27:47,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-12-17 14:27:47,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-12-17 14:27:47,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-12-17 14:27:47,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-12-17 14:27:47,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-12-17 14:27:47,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-12-17 14:27:47,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-12-17 14:27:47,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-12-17 14:27:47,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-12-17 14:27:47,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-12-17 14:27:47,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-12-17 14:27:47,913 INFO L153 SettingsManager]: * Use SBE=true [2024-12-17 14:27:47,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-12-17 14:27:47,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-12-17 14:27:47,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 14:27:47,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-12-17 14:27:47,915 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-12-17 14:27:47,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-12-17 14:27:47,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-12-17 14:27:47,916 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-12-17 14:27:47,916 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-12-17 14:27:47,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2024-12-17 14:27:48,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-12-17 14:27:48,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-12-17 14:27:48,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-12-17 14:27:48,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-12-17 14:27:48,186 INFO L274 PluginConnector]: CDTParser initialized [2024-12-17 14:27:48,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-12-17 14:27:49,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/bbc58026a/b58bef46aea842d3bbf7714a00b75f65/FLAG45823aea5 [2024-12-17 14:27:49,733 INFO L384 CDTParser]: Found 1 translation units. [2024-12-17 14:27:49,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-12-17 14:27:49,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/bbc58026a/b58bef46aea842d3bbf7714a00b75f65/FLAG45823aea5 [2024-12-17 14:27:50,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/bbc58026a/b58bef46aea842d3bbf7714a00b75f65 [2024-12-17 14:27:50,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-12-17 14:27:50,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-12-17 14:27:50,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-12-17 14:27:50,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-12-17 14:27:50,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-12-17 14:27:50,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360a61af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50, skipping insertion in model container [2024-12-17 14:27:50,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-12-17 14:27:50,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-12-17 14:27:50,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 14:27:50,255 INFO L200 MainTranslator]: Completed pre-run [2024-12-17 14:27:50,275 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2451,2464] [2024-12-17 14:27:50,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-12-17 14:27:50,304 INFO L204 MainTranslator]: Completed translation [2024-12-17 14:27:50,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50 WrapperNode [2024-12-17 14:27:50,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-12-17 14:27:50,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-12-17 14:27:50,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-12-17 14:27:50,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-12-17 14:27:50,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,349 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 238 [2024-12-17 14:27:50,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-12-17 14:27:50,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-12-17 14:27:50,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-12-17 14:27:50,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-12-17 14:27:50,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,368 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-12-17 14:27:50,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-12-17 14:27:50,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-12-17 14:27:50,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-12-17 14:27:50,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (1/1) ... [2024-12-17 14:27:50,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-12-17 14:27:50,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:27:50,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-12-17 14:27:50,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-12-17 14:27:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-12-17 14:27:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-12-17 14:27:50,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-12-17 14:27:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-12-17 14:27:50,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-12-17 14:27:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-12-17 14:27:50,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-12-17 14:27:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-12-17 14:27:50,432 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-12-17 14:27:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-12-17 14:27:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-12-17 14:27:50,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-12-17 14:27:50,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-12-17 14:27:50,433 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-12-17 14:27:50,526 INFO L234 CfgBuilder]: Building ICFG [2024-12-17 14:27:50,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-12-17 14:27:50,966 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-12-17 14:27:50,966 INFO L283 CfgBuilder]: Performing block encoding [2024-12-17 14:27:51,368 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-12-17 14:27:51,369 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-12-17 14:27:51,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:27:51 BoogieIcfgContainer [2024-12-17 14:27:51,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-12-17 14:27:51,372 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-12-17 14:27:51,372 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-12-17 14:27:51,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-12-17 14:27:51,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 02:27:50" (1/3) ... [2024-12-17 14:27:51,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64804568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:27:51, skipping insertion in model container [2024-12-17 14:27:51,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 02:27:50" (2/3) ... [2024-12-17 14:27:51,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64804568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 02:27:51, skipping insertion in model container [2024-12-17 14:27:51,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:27:51" (3/3) ... [2024-12-17 14:27:51,381 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-12-17 14:27:51,394 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-12-17 14:27:51,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-12-17 14:27:51,396 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-12-17 14:27:51,455 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-12-17 14:27:51,495 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 14:27:51,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-12-17 14:27:51,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:27:51,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-12-17 14:27:51,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-12-17 14:27:51,584 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-12-17 14:27:51,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-12-17 14:27:51,604 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4df21b24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-12-17 14:27:51,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-12-17 14:27:55,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:27:55,334 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:27:55,334 INFO L139 ounterexampleChecker]: Examining path program with hash -2005642007, occurence #1 [2024-12-17 14:27:55,334 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:27:55,334 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:27:55,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:27:55,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1414399275, now seen corresponding path program 1 times [2024-12-17 14:27:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:27:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88953551] [2024-12-17 14:27:55,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:27:55,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:27:55,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:27:55,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:27:55,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-12-17 14:27:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:27:55,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-12-17 14:27:55,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:27:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:27:55,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-17 14:27:55,685 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:27:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88953551] [2024-12-17 14:27:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88953551] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 14:27:55,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 14:27:55,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-12-17 14:27:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858179320] [2024-12-17 14:27:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:27:55,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-12-17 14:27:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:27:55,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-12-17 14:27:55,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-12-17 14:27:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:27:55,709 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:27:55,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:27:55,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:27:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:27:57,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-12-17 14:27:57,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:27:57,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:27:57,404 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:27:57,404 INFO L139 ounterexampleChecker]: Examining path program with hash -2005642007, occurence #2 [2024-12-17 14:27:57,404 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:27:57,405 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:27:57,405 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:27:57,405 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2024-12-17 14:27:57,405 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:27:57,405 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2024-12-17 14:27:57,420 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:27:57,421 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 14:27:57,421 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:27:57,421 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:27:57,421 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:27:57,421 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2024-12-17 14:27:57,421 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:27:57,421 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2024-12-17 14:27:57,421 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:27:57,421 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2024-12-17 14:27:57,421 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:27:57,422 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:27:57,422 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:27:57,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:27:57,422 INFO L85 PathProgramCache]: Analyzing trace with hash 897353279, now seen corresponding path program 1 times [2024-12-17 14:27:57,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:27:57,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076535249] [2024-12-17 14:27:57,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:27:57,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:27:57,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:27:57,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:27:57,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-12-17 14:27:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:27:57,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-17 14:27:57,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:27:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:27:57,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-17 14:27:57,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:27:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076535249] [2024-12-17 14:27:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076535249] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 14:27:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 14:27:57,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-17 14:27:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147543563] [2024-12-17 14:27:57,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:27:57,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 14:27:57,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:27:57,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 14:27:57,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-17 14:27:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:27:57,624 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:27:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2024-12-17 14:27:57,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:27:57,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:27:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:27:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:27:59,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-12-17 14:27:59,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:27:59,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:27:59,891 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:27:59,892 INFO L139 ounterexampleChecker]: Examining path program with hash 344834135, occurence #1 [2024-12-17 14:27:59,892 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:27:59,892 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:27:59,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:27:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1523768636, now seen corresponding path program 1 times [2024-12-17 14:27:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:27:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613088588] [2024-12-17 14:27:59,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:27:59,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:27:59,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:27:59,895 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:27:59,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-12-17 14:27:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:27:59,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-17 14:27:59,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:28:00,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-17 14:28:00,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:00,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613088588] [2024-12-17 14:28:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613088588] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 14:28:00,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 14:28:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-17 14:28:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322717231] [2024-12-17 14:28:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:28:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 14:28:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:00,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 14:28:00,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-17 14:28:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:00,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:00,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2024-12-17 14:28:00,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:00,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:00,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:03,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-12-17 14:28:04,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:04,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:04,049 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:04,049 INFO L139 ounterexampleChecker]: Examining path program with hash -1204864242, occurence #1 [2024-12-17 14:28:04,049 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:28:04,049 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:04,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -661339141, now seen corresponding path program 1 times [2024-12-17 14:28:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:04,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780946942] [2024-12-17 14:28:04,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:28:04,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:04,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:04,052 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:04,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-12-17 14:28:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:28:04,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-17 14:28:04,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:04,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:28:04,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-17 14:28:04,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:04,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780946942] [2024-12-17 14:28:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780946942] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 14:28:04,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 14:28:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-17 14:28:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019761104] [2024-12-17 14:28:04,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:28:04,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 14:28:04,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:04,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 14:28:04,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-17 14:28:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:04,207 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:04,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 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) [2024-12-17 14:28:04,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:04,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:04,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:04,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:08,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:08,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-12-17 14:28:09,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:09,121 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:09,121 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:09,121 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #1 [2024-12-17 14:28:09,121 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:28:09,121 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:09,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash -845220294, now seen corresponding path program 1 times [2024-12-17 14:28:09,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:09,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753508101] [2024-12-17 14:28:09,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:28:09,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:09,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:09,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:09,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-12-17 14:28:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:28:09,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-12-17 14:28:09,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:28:09,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-17 14:28:09,248 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:09,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753508101] [2024-12-17 14:28:09,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753508101] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 14:28:09,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 14:28:09,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-12-17 14:28:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851714250] [2024-12-17 14:28:09,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:28:09,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-12-17 14:28:09,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:09,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-12-17 14:28:09,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-12-17 14:28:09,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:09,250 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:09,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:28:09,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:09,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:09,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:09,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:09,250 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:16,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-12-17 14:28:16,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:16,678 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:16,678 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:16,678 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #1 [2024-12-17 14:28:16,678 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:28:16,678 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:16,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2055212688, now seen corresponding path program 1 times [2024-12-17 14:28:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:16,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046083971] [2024-12-17 14:28:16,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:28:16,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:16,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:16,681 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:16,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-12-17 14:28:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:28:16,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-17 14:28:16,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:16,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-12-17 14:28:16,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-12-17 14:28:16,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:16,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046083971] [2024-12-17 14:28:16,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046083971] provided 1 perfect and 0 imperfect interpolant sequences [2024-12-17 14:28:16,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-12-17 14:28:16,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-12-17 14:28:16,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986871579] [2024-12-17 14:28:16,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-12-17 14:28:16,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-12-17 14:28:16,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:16,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-12-17 14:28:16,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-12-17 14:28:16,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:16,828 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:16,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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) [2024-12-17 14:28:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:16,828 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:16,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-12-17 14:28:17,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:17,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:17,153 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:17,153 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #2 [2024-12-17 14:28:17,153 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:28:17,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:28:17,153 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:17,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-12-17 14:28:17,153 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:17,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 14:28:17,153 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:17,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:28:17,153 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:17,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:28:17,153 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:17,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2024-12-17 14:28:17,153 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:17,153 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2024-12-17 14:28:17,153 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:17,153 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:28:17,153 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:17,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash 564259304, now seen corresponding path program 1 times [2024-12-17 14:28:17,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:17,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400426835] [2024-12-17 14:28:17,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-12-17 14:28:17,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:17,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:17,157 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:17,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-12-17 14:28:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:28:17,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-12-17 14:28:17,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:17,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-17 14:28:17,695 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 28 treesize of output 20 [2024-12-17 14:28:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:28:17,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:28:17,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-12-17 14:28:17,994 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 42 treesize of output 103 [2024-12-17 14:28:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:28:19,206 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:19,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400426835] [2024-12-17 14:28:19,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400426835] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:28:19,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:28:19,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-12-17 14:28:19,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982027688] [2024-12-17 14:28:19,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-17 14:28:19,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-12-17 14:28:19,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:19,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-12-17 14:28:19,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-12-17 14:28:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:19,207 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:19,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 15 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:28:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:19,208 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:24,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-12-17 14:28:24,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:24,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:24,807 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:24,807 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #3 [2024-12-17 14:28:24,807 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:28:24,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:28:24,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:24,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-12-17 14:28:24,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:24,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 14:28:24,807 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:24,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:28:24,807 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:24,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:28:24,807 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:24,807 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2024-12-17 14:28:24,807 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:24,808 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2024-12-17 14:28:24,808 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:24,808 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2024-12-17 14:28:24,808 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:24,808 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:28:24,808 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:24,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash 312817954, now seen corresponding path program 2 times [2024-12-17 14:28:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:24,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1368672470] [2024-12-17 14:28:24,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-12-17 14:28:24,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:24,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:24,812 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:24,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-12-17 14:28:24,949 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 14:28:24,949 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:28:24,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-17 14:28:24,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:28:25,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:28:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:28:25,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368672470] [2024-12-17 14:28:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368672470] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:28:25,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:28:25,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-12-17 14:28:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218037056] [2024-12-17 14:28:25,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-17 14:28:25,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-17 14:28:25,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:25,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-17 14:28:25,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-12-17 14:28:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:25,209 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:25,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:28:25,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:25,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:25,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:25,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:25,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:25,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:25,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:25,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-12-17 14:28:30,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-12-17 14:28:30,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:30,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:30,802 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:30,802 INFO L139 ounterexampleChecker]: Examining path program with hash 1912357603, occurence #1 [2024-12-17 14:28:30,802 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:28:30,802 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash 939233311, now seen corresponding path program 3 times [2024-12-17 14:28:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:30,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1652189593] [2024-12-17 14:28:30,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-12-17 14:28:30,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:30,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:30,805 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:30,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-12-17 14:28:30,916 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-12-17 14:28:30,916 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:28:30,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-17 14:28:30,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:28:31,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:28:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:28:31,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652189593] [2024-12-17 14:28:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652189593] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:28:31,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:28:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-12-17 14:28:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724969741] [2024-12-17 14:28:31,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-17 14:28:31,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-17 14:28:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:31,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-17 14:28:31,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-12-17 14:28:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:31,178 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:31,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 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) [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-12-17 14:28:31,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:40,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-17 14:28:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-17 14:28:40,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-12-17 14:28:40,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:40,840 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:40,840 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:40,840 INFO L139 ounterexampleChecker]: Examining path program with hash 1304145205, occurence #1 [2024-12-17 14:28:40,840 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2024-12-17 14:28:40,840 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:40,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1245874466, now seen corresponding path program 4 times [2024-12-17 14:28:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [452539040] [2024-12-17 14:28:40,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-12-17 14:28:40,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:40,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:40,842 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:40,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-12-17 14:28:40,932 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-12-17 14:28:40,933 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:28:40,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-17 14:28:40,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:28:41,022 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:28:41,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-12-17 14:28:41,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452539040] [2024-12-17 14:28:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452539040] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:28:41,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:28:41,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-12-17 14:28:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885708456] [2024-12-17 14:28:41,118 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-17 14:28:41,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-17 14:28:41,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:41,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-17 14:28:41,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-12-17 14:28:41,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:41,120 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:41,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 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) [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-12-17 14:28:41,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:51,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:28:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:28:51,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-12-17 14:28:51,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:51,704 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:51,704 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:51,704 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #2 [2024-12-17 14:28:51,704 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:28:51,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:28:51,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:51,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2024-12-17 14:28:51,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:51,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2024-12-17 14:28:51,704 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:51,705 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:28:51,705 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:51,705 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:28:51,705 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:51,705 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2024-12-17 14:28:51,705 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:51,705 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2024-12-17 14:28:51,705 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:51,705 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:28:51,705 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:51,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:51,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1785946185, now seen corresponding path program 5 times [2024-12-17 14:28:51,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:51,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [759512170] [2024-12-17 14:28:51,706 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-12-17 14:28:51,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:51,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:51,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:51,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-12-17 14:28:51,838 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-12-17 14:28:51,839 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:28:51,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-12-17 14:28:51,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:28:51,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:28:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-12-17 14:28:52,016 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:52,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759512170] [2024-12-17 14:28:52,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759512170] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:28:52,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:28:52,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-12-17 14:28:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341386570] [2024-12-17 14:28:52,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-17 14:28:52,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-17 14:28:52,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:52,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-17 14:28:52,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-12-17 14:28:52,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:52,018 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:52,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 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) [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:28:52,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:54,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:28:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:28:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:28:54,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-12-17 14:28:54,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:54,926 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:28:54,926 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:28:54,927 INFO L139 ounterexampleChecker]: Examining path program with hash 964057221, occurence #3 [2024-12-17 14:28:54,927 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:28:54,927 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:28:54,927 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:54,927 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2024-12-17 14:28:54,927 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:54,927 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:28:54,927 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:54,927 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:28:54,927 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:54,927 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2024-12-17 14:28:54,927 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:54,927 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2024-12-17 14:28:54,927 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:28:54,927 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2024-12-17 14:28:54,927 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:28:54,927 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:28:54,927 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:28:54,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:28:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash -731946273, now seen corresponding path program 6 times [2024-12-17 14:28:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:28:54,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1190482778] [2024-12-17 14:28:54,928 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-12-17 14:28:54,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:28:54,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:28:54,930 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:28:54,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-12-17 14:28:55,043 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-12-17 14:28:55,043 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-12-17 14:28:55,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-12-17 14:28:55,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:28:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-17 14:28:55,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-12-17 14:28:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-12-17 14:28:55,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-12-17 14:28:55,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190482778] [2024-12-17 14:28:55,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190482778] provided 0 perfect and 2 imperfect interpolant sequences [2024-12-17 14:28:55,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-12-17 14:28:55,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-12-17 14:28:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650051054] [2024-12-17 14:28:55,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-12-17 14:28:55,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-12-17 14:28:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-12-17 14:28:55,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-12-17 14:28:55,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-12-17 14:28:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:28:55,242 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-12-17 14:28:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:28:55,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-12-17 14:29:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-12-17 14:29:06,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-12-17 14:29:07,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:29:07,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-12-17 14:29:07,068 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2024-12-17 14:29:07,068 INFO L139 ounterexampleChecker]: Examining path program with hash -438118539, occurence #4 [2024-12-17 14:29:07,068 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2024-12-17 14:29:07,068 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2024-12-17 14:29:07,068 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:29:07,068 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2024-12-17 14:29:07,068 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:29:07,068 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2024-12-17 14:29:07,068 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:29:07,068 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2024-12-17 14:29:07,068 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:29:07,068 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2024-12-17 14:29:07,069 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:29:07,069 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2024-12-17 14:29:07,069 WARN L190 ounterexampleChecker]: Statements were already independent. [2024-12-17 14:29:07,069 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2024-12-17 14:29:07,069 INFO L209 ounterexampleChecker]: No commutativity condition found. [2024-12-17 14:29:07,069 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2024-12-17 14:29:07,069 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2024-12-17 14:29:07,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-12-17 14:29:07,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1271740043, now seen corresponding path program 7 times [2024-12-17 14:29:07,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-12-17 14:29:07,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537208599] [2024-12-17 14:29:07,069 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-12-17 14:29:07,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-12-17 14:29:07,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2024-12-17 14:29:07,071 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-12-17 14:29:07,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-12-17 14:30:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-12-17 14:30:17,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-12-17 14:30:17,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-12-17 14:30:17,841 INFO L349 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2024-12-17 14:30:17,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 76 [2024-12-17 14:30:20,661 INFO L349 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2024-12-17 14:30:20,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 431 treesize of output 283 [2024-12-17 14:33:28,610 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse6 (bvmul c_~csum~0 (_ bv4294967295 32))) (.cse7 (bvmul (_ bv4294967295 32) c_~bsum~0))) (or (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse3 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse4 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse3))) (.cse5 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse2 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse0 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse1 (bvadd .cse2 c_~bsum~0))) (and (bvsle .cse0 (_ bv0 32)) (bvsle .cse1 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse2 .cse3)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse0)))) (bvsge .cse4 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse4 (bvadd (bvneg ((_ sign_extend 32) .cse5)) (_ bv18446744071562067968 64))) (bvsle .cse5 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse12 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse10 (bvadd .cse7 c_~csum~0 .cse12))) (let ((.cse9 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse8 ((_ sign_extend 32) .cse10))) (and (bvsge .cse8 (bvadd (bvneg ((_ sign_extend 32) .cse9)) (_ bv18446744071562067968 64))) (bvsle .cse10 (bvadd (_ bv2147483647 32) (bvneg .cse9))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse11 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse16 (bvadd .cse11 c_~bsum~0))) (let ((.cse13 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse15 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse14 ((_ sign_extend 32) .cse16))) (and (bvsle (bvadd c_~csum~0 .cse11 .cse12) (bvadd (bvneg .cse13) (_ bv2147483647 32))) (bvsge .cse13 (_ bv0 32)) (bvsge .cse14 .cse15) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse15) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse16 (_ bv0 32)) (bvsge .cse8 (bvadd (_ bv18446744071562067968 64) (bvneg .cse14))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse22 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse23 (bvadd .cse7 c_~csum~0 .cse22))) (let ((.cse17 ((_ sign_extend 32) .cse23)) (.cse18 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse17 (bvadd (bvneg ((_ sign_extend 32) .cse18)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse21 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse19 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse20 (bvadd .cse21 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse19 (_ bv0 32)) (bvsle .cse20 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse21 .cse22)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse19)))) (bvsge .cse17 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse20)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse23 (bvadd (_ bv2147483647 32) (bvneg .cse18)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse28 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse24 ((_ sign_extend 32) .cse28)) (.cse25 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse24 (bvadd (bvneg ((_ sign_extend 32) .cse25)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse26 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse27 ((_ sign_extend 32) .cse26))) (and (bvsle .cse26 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse27 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse26 (_ bv0 32)) (bvsge .cse24 (bvadd (_ bv18446744071562067968 64) (bvneg .cse27))))))) (bvsle .cse28 (bvadd (_ bv2147483647 32) (bvneg .cse25))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse37 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse38 (bvadd .cse7 c_~csum~0 .cse37))) (let ((.cse29 ((_ sign_extend 32) .cse38)) (.cse30 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse29 (bvadd (bvneg ((_ sign_extend 32) .cse30)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse36 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse35 (bvadd .cse36 c_~bsum~0))) (let ((.cse34 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse31 (bvadd c_~csum~0 .cse36 .cse37)) (.cse32 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse33 ((_ sign_extend 32) .cse35))) (and (bvsle .cse31 (bvadd (bvneg .cse32) (_ bv2147483647 32))) (bvsge .cse33 .cse34) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse34) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse35 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse31) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse32)))) (bvsge .cse29 (bvadd (_ bv18446744071562067968 64) (bvneg .cse33)))))))) (bvsle .cse38 (bvadd (_ bv2147483647 32) (bvneg .cse30)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse44 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse39 ((_ sign_extend 32) .cse44)) (.cse40 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse39 (bvadd (bvneg ((_ sign_extend 32) .cse40)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse43 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse41 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse42 ((_ sign_extend 32) .cse43))) (and (bvsge .cse41 (_ bv0 32)) (bvsge .cse42 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse41 (_ bv0 32)) (bvsle .cse43 (_ bv0 32)) (bvsge .cse39 (bvadd (_ bv18446744071562067968 64) (bvneg .cse42))))))) (bvsle .cse44 (bvadd (_ bv2147483647 32) (bvneg .cse40))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse46 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse48 (bvadd .cse7 c_~csum~0 .cse46))) (let ((.cse49 ((_ sign_extend 32) .cse48)) (.cse50 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse45 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse47 (bvadd .cse45 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse45 .cse46) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse47 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse48 (bvadd (_ bv2147483647 32) (bvneg .cse47))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse49 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse47)))))))) (bvsge .cse49 (bvadd (bvneg ((_ sign_extend 32) .cse50)) (_ bv18446744071562067968 64))) (bvsle .cse48 (bvadd (_ bv2147483647 32) (bvneg .cse50)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse57 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse54 (bvadd .cse7 c_~csum~0 .cse57))) (let ((.cse51 ((_ sign_extend 32) .cse54)) (.cse52 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse51 (bvadd (bvneg ((_ sign_extend 32) .cse52)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse56 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse55 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse53 (bvadd .cse56 c_~bsum~0))) (and (bvsle .cse53 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse54 (bvadd (_ bv2147483647 32) (bvneg .cse53))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse55 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse56 .cse57)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse55)))) (bvsge .cse51 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse53)))))))) (bvsle .cse54 (bvadd (_ bv2147483647 32) (bvneg .cse52)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse60 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse58 ((_ sign_extend 32) .cse60)) (.cse59 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse58 (bvadd (bvneg ((_ sign_extend 32) .cse59)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse61 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse60 (bvadd (_ bv2147483647 32) (bvneg .cse61))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse58 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse61)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse59 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse66 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse62 ((_ sign_extend 32) .cse66)) (.cse63 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse62 (bvadd (bvneg ((_ sign_extend 32) .cse63)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse65 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse64 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse64 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse65 (_ bv0 32)) (bvsle .cse66 (bvadd (_ bv2147483647 32) (bvneg .cse64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse65 (_ bv0 32)) (bvsge .cse62 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse64))))))) (bvsle .cse66 (bvadd (_ bv2147483647 32) (bvneg .cse63))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse68 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse69 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse67 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse67 (_ bv0 32)) (bvsge .cse68 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse67)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse68 (bvadd (bvneg ((_ sign_extend 32) .cse69)) (_ bv18446744071562067968 64))) (bvsle .cse69 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse75 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse72 (bvadd .cse7 c_~csum~0 .cse75))) (let ((.cse70 ((_ sign_extend 32) .cse72)) (.cse71 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse70 (bvadd (bvneg ((_ sign_extend 32) .cse71)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse74 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse73 (bvadd .cse74 c_~bsum~0))) (and (bvsle .cse72 (bvadd (_ bv2147483647 32) (bvneg .cse73))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse74 .cse75)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse70 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse73)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse71 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse80 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse81 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse80))) (.cse82 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse79 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse76 (bvadd .cse79 c_~bsum~0))) (let ((.cse78 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse77 ((_ sign_extend 32) .cse76))) (and (bvsle .cse76 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse77 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse78 (_ bv0 32)) (bvsle .cse76 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse79 .cse80)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse78)))) (bvsge .cse81 (bvadd (_ bv18446744071562067968 64) (bvneg .cse77)))))))) (bvsge .cse81 (bvadd (bvneg ((_ sign_extend 32) .cse82)) (_ bv18446744071562067968 64))) (bvsle .cse82 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse89 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse86 (bvadd .cse7 c_~csum~0 .cse89))) (let ((.cse87 ((_ sign_extend 32) .cse86)) (.cse90 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse88 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse83 (bvadd c_~csum~0 .cse88 .cse89)) (.cse84 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse85 (bvadd .cse88 c_~bsum~0))) (and (bvsle .cse83 (bvadd (bvneg .cse84) (_ bv2147483647 32))) (bvsle .cse85 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse86 (bvadd (_ bv2147483647 32) (bvneg .cse85))) (bvsge ((_ sign_extend 32) .cse83) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse84)))) (bvsge .cse87 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse85)))))))) (bvsge .cse87 (bvadd (bvneg ((_ sign_extend 32) .cse90)) (_ bv18446744071562067968 64))) (bvsle .cse86 (bvadd (_ bv2147483647 32) (bvneg .cse90)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse98 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse96 (bvadd .cse7 c_~csum~0 .cse98))) (let ((.cse91 ((_ sign_extend 32) .cse96)) (.cse92 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse91 (bvadd (bvneg ((_ sign_extend 32) .cse92)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse97 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse93 (bvadd c_~csum~0 .cse97 .cse98)) (.cse94 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse95 (bvadd .cse97 c_~bsum~0))) (and (bvsle .cse93 (bvadd (bvneg .cse94) (_ bv2147483647 32))) (bvsle .cse95 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse96 (bvadd (_ bv2147483647 32) (bvneg .cse95))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse93) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse94)))) (bvsge .cse91 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse95)))))))) (bvsle .cse96 (bvadd (_ bv2147483647 32) (bvneg .cse92)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse106 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse107 (bvadd .cse7 c_~csum~0 .cse106))) (let ((.cse99 ((_ sign_extend 32) .cse107)) (.cse100 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse99 (bvadd (bvneg ((_ sign_extend 32) .cse100)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse105 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse103 (bvadd .cse105 c_~bsum~0))) (let ((.cse101 (bvadd c_~csum~0 .cse105 .cse106)) (.cse102 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse104 ((_ sign_extend 32) .cse103))) (and (bvsle .cse101 (bvadd (bvneg .cse102) (_ bv2147483647 32))) (bvsle .cse103 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse104 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse103 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse101) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse102)))) (bvsge .cse99 (bvadd (_ bv18446744071562067968 64) (bvneg .cse104)))))))) (bvsle .cse107 (bvadd (_ bv2147483647 32) (bvneg .cse100)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse111 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse109 ((_ sign_extend 32) .cse111)) (.cse110 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse108 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse108 (_ bv0 32)) (bvsge .cse109 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse108)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsge .cse109 (bvadd (bvneg ((_ sign_extend 32) .cse110)) (_ bv18446744071562067968 64))) (bvsle .cse111 (bvadd (_ bv2147483647 32) (bvneg .cse110))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse113 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse114 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse112 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse112 (_ bv0 32)) (bvsge .cse113 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse112))))))) (bvsge .cse113 (bvadd (bvneg ((_ sign_extend 32) .cse114)) (_ bv18446744071562067968 64))) (bvsle .cse114 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse116 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse121 (bvadd .cse7 c_~csum~0 .cse116))) (let ((.cse119 ((_ sign_extend 32) .cse121)) (.cse120 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse115 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse117 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse118 (bvadd .cse115 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse115 .cse116) (bvadd (bvneg .cse117) (_ bv2147483647 32))) (bvsge .cse117 (_ bv0 32)) (bvsle .cse118 (_ bv0 32)) (bvsge .cse119 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse118)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse119 (bvadd (bvneg ((_ sign_extend 32) .cse120)) (_ bv18446744071562067968 64))) (bvsle .cse121 (bvadd (_ bv2147483647 32) (bvneg .cse120)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse129 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse127 (bvadd .cse7 c_~csum~0 .cse129))) (let ((.cse122 ((_ sign_extend 32) .cse127)) (.cse123 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse122 (bvadd (bvneg ((_ sign_extend 32) .cse123)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse128 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse124 (bvadd c_~csum~0 .cse128 .cse129)) (.cse125 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse126 (bvadd .cse128 c_~bsum~0))) (and (bvsle .cse124 (bvadd (bvneg .cse125) (_ bv2147483647 32))) (bvsle .cse126 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse127 (bvadd (_ bv2147483647 32) (bvneg .cse126))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse124) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse125)))) (bvsge .cse122 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse126)))))))) (bvsle .cse123 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse130 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse131 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse130 (bvadd (bvneg ((_ sign_extend 32) .cse131)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse132 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse133 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse132 (_ bv0 32)) (bvsle .cse132 (_ bv0 32)) (bvsle .cse133 (_ bv0 32)) (bvsge .cse130 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse133)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse131 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse138 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse139 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse138))) (.cse140 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse137 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse136 (bvadd .cse137 c_~bsum~0))) (let ((.cse135 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (.cse134 ((_ sign_extend 32) .cse136))) (and (bvsge .cse134 .cse135) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) .cse135) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse136 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse137 .cse138)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse139 (bvadd (_ bv18446744071562067968 64) (bvneg .cse134)))))))) (bvsge .cse139 (bvadd (bvneg ((_ sign_extend 32) .cse140)) (_ bv18446744071562067968 64))) (bvsle .cse140 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse146 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse143 (bvadd .cse7 c_~csum~0 .cse146))) (let ((.cse142 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse141 ((_ sign_extend 32) .cse143))) (and (bvsge .cse141 (bvadd (bvneg ((_ sign_extend 32) .cse142)) (_ bv18446744071562067968 64))) (bvsle .cse143 (bvadd (_ bv2147483647 32) (bvneg .cse142))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse145 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse144 (bvadd .cse145 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse144 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse145 .cse146)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse141 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse144)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse149 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse148 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse147 ((_ sign_extend 32) .cse149))) (and (bvsge .cse147 (bvadd (bvneg ((_ sign_extend 32) .cse148)) (_ bv18446744071562067968 64))) (bvsle .cse149 (bvadd (_ bv2147483647 32) (bvneg .cse148))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse150 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse151 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse152 ((_ sign_extend 32) .cse150))) (and (bvsle .cse150 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse151 (_ bv0 32)) (bvsge .cse152 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse151 (_ bv0 32)) (bvsle .cse150 (_ bv0 32)) (bvsge .cse147 (bvadd (_ bv18446744071562067968 64) (bvneg .cse152))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse155 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse154 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse153 ((_ sign_extend 32) .cse155))) (and (bvsge .cse153 (bvadd (bvneg ((_ sign_extend 32) .cse154)) (_ bv18446744071562067968 64))) (bvsle .cse155 (bvadd (_ bv2147483647 32) (bvneg .cse154))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse156 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse157 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse156 (_ bv0 32)) (bvsle .cse156 (_ bv0 32)) (bvsle .cse157 (_ bv0 32)) (bvsge .cse153 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse157)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse160 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse161 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse158 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse159 ((_ sign_extend 32) .cse158))) (and (bvsle .cse158 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse159 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse158 (_ bv0 32)) (bvsge .cse160 (bvadd (_ bv18446744071562067968 64) (bvneg .cse159))))))) (bvsge .cse160 (bvadd (bvneg ((_ sign_extend 32) .cse161)) (_ bv18446744071562067968 64))) (bvsle .cse161 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse168 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse164 (bvadd .cse7 c_~csum~0 .cse168))) (let ((.cse166 ((_ sign_extend 32) .cse164)) (.cse169 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse167 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse162 (bvadd c_~csum~0 .cse167 .cse168)) (.cse163 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse165 (bvadd .cse167 c_~bsum~0))) (and (bvsle .cse162 (bvadd (bvneg .cse163) (_ bv2147483647 32))) (bvsle .cse164 (bvadd (_ bv2147483647 32) (bvneg .cse165))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse162) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse163)))) (bvsge .cse166 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse165)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse166 (bvadd (bvneg ((_ sign_extend 32) .cse169)) (_ bv18446744071562067968 64))) (bvsle .cse169 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse173 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse175 (bvadd .cse7 c_~csum~0 .cse173))) (let ((.cse170 ((_ sign_extend 32) .cse175)) (.cse171 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse170 (bvadd (bvneg ((_ sign_extend 32) .cse171)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse172 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse174 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse176 (bvadd .cse172 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse172 .cse173) (bvadd (bvneg .cse174) (_ bv2147483647 32))) (bvsge .cse174 (_ bv0 32)) (bvsle .cse175 (bvadd (_ bv2147483647 32) (bvneg .cse176))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse170 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse176)))))))) (bvsle .cse175 (bvadd (_ bv2147483647 32) (bvneg .cse171)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse182 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse177 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse182))) (.cse178 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse177 (bvadd (bvneg ((_ sign_extend 32) .cse178)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse181 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse179 (bvadd .cse181 c_~bsum~0))) (let ((.cse180 ((_ sign_extend 32) .cse179))) (and (bvsle .cse179 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse180 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse179 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse181 .cse182)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse177 (bvadd (_ bv18446744071562067968 64) (bvneg .cse180)))))))) (bvsle .cse178 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse189 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse185 (bvadd .cse7 c_~csum~0 .cse189))) (let ((.cse187 ((_ sign_extend 32) .cse185)) (.cse190 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse188 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse183 (bvadd c_~csum~0 .cse188 .cse189)) (.cse184 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse186 (bvadd .cse188 c_~bsum~0))) (and (bvsle .cse183 (bvadd (bvneg .cse184) (_ bv2147483647 32))) (bvsle .cse185 (bvadd (_ bv2147483647 32) (bvneg .cse186))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse183) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse184)))) (bvsge .cse187 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse186)))))))) (bvsge .cse187 (bvadd (bvneg ((_ sign_extend 32) .cse190)) (_ bv18446744071562067968 64))) (bvsle .cse190 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse195 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse198 (bvadd .cse7 c_~csum~0 .cse195))) (let ((.cse196 ((_ sign_extend 32) .cse198)) (.cse197 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse194 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse191 (bvadd .cse194 c_~bsum~0))) (let ((.cse193 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse192 ((_ sign_extend 32) .cse191))) (and (bvsle .cse191 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse192 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse193 (_ bv0 32)) (bvsle .cse191 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse194 .cse195)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse193)))) (bvsge .cse196 (bvadd (_ bv18446744071562067968 64) (bvneg .cse192)))))))) (bvsge .cse196 (bvadd (bvneg ((_ sign_extend 32) .cse197)) (_ bv18446744071562067968 64))) (bvsle .cse198 (bvadd (_ bv2147483647 32) (bvneg .cse197)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse203 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse199 ((_ sign_extend 32) .cse203)) (.cse200 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse199 (bvadd (bvneg ((_ sign_extend 32) .cse200)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse202 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse201 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse201 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse202 (_ bv0 32)) (bvsle .cse203 (bvadd (_ bv2147483647 32) (bvneg .cse201))) (bvsle .cse202 (_ bv0 32)) (bvsge .cse199 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse201))))))) (bvsle .cse200 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse211 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse204 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse211))) (.cse205 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse204 (bvadd (bvneg ((_ sign_extend 32) .cse205)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse210 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse208 (bvadd .cse210 c_~bsum~0))) (let ((.cse206 (bvadd c_~csum~0 .cse210 .cse211)) (.cse207 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse209 ((_ sign_extend 32) .cse208))) (and (bvsle .cse206 (bvadd (bvneg .cse207) (_ bv2147483647 32))) (bvsle .cse208 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse209 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse208 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse206) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse207)))) (bvsge .cse204 (bvadd (_ bv18446744071562067968 64) (bvneg .cse209)))))))) (bvsle .cse205 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse216 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse212 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse216))) (.cse213 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse212 (bvadd (bvneg ((_ sign_extend 32) .cse213)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse215 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse214 (bvadd .cse215 c_~bsum~0))) (and (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse214 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse215 .cse216)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse212 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse214)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse213 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse224 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse219 (bvadd .cse7 c_~csum~0 .cse224))) (let ((.cse218 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse217 ((_ sign_extend 32) .cse219))) (and (bvsge .cse217 (bvadd (bvneg ((_ sign_extend 32) .cse218)) (_ bv18446744071562067968 64))) (bvsle .cse219 (bvadd (_ bv2147483647 32) (bvneg .cse218))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse223 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse220 (bvadd c_~csum~0 .cse223 .cse224)) (.cse221 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse222 (bvadd .cse223 c_~bsum~0))) (and (bvsle .cse220 (bvadd (bvneg .cse221) (_ bv2147483647 32))) (bvsle .cse222 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse220) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse221)))) (bvsge .cse217 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse222)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse227 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse226 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse225 ((_ sign_extend 32) .cse227))) (and (bvsge .cse225 (bvadd (bvneg ((_ sign_extend 32) .cse226)) (_ bv18446744071562067968 64))) (bvsle .cse227 (bvadd (_ bv2147483647 32) (bvneg .cse226))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse228 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse229 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse228 (_ bv0 32)) (bvsle .cse227 (bvadd (_ bv2147483647 32) (bvneg .cse229))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse228 (_ bv0 32)) (bvsge .cse225 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse229)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse232 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse231 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse230 ((_ sign_extend 32) .cse232))) (and (bvsge .cse230 (bvadd (bvneg ((_ sign_extend 32) .cse231)) (_ bv18446744071562067968 64))) (bvsle .cse231 (_ bv0 32)) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse233 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse232 (bvadd (_ bv2147483647 32) (bvneg .cse233))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse230 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse233))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse235 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse236 ((_ sign_extend 32) .cse235)) (.cse237 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse234 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse234 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse235 (bvadd (_ bv2147483647 32) (bvneg .cse234))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse236 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse234))))))) (bvsge .cse236 (bvadd (bvneg ((_ sign_extend 32) .cse237)) (_ bv18446744071562067968 64))) (bvsle .cse237 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse239 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse242 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse239))) (.cse243 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse238 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse240 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse241 (bvadd .cse238 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse238 .cse239) (bvadd (bvneg .cse240) (_ bv2147483647 32))) (bvsge .cse240 (_ bv0 32)) (bvsle .cse241 (_ bv0 32)) (bvsge .cse242 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse241)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse242 (bvadd (bvneg ((_ sign_extend 32) .cse243)) (_ bv18446744071562067968 64))) (bvsle .cse243 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse245 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse246 (bvadd .cse7 c_~csum~0 .cse245))) (let ((.cse248 ((_ sign_extend 32) .cse246)) (.cse249 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse244 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse247 (bvadd .cse244 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse244 .cse245) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse246 (bvadd (_ bv2147483647 32) (bvneg .cse247))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse248 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse247)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse248 (bvadd (bvneg ((_ sign_extend 32) .cse249)) (_ bv18446744071562067968 64))) (bvsle .cse249 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse255 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse252 (bvadd .cse7 c_~csum~0 .cse255))) (let ((.cse250 ((_ sign_extend 32) .cse252)) (.cse251 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse250 (bvadd (bvneg ((_ sign_extend 32) .cse251)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse254 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse253 (bvadd .cse254 c_~bsum~0))) (and (bvsle .cse252 (bvadd (_ bv2147483647 32) (bvneg .cse253))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse254 .cse255)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) (bvadd v_arrayElimCell_10 v_arrayElimCell_11))))) (bvsge .cse250 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse253)))))))) (bvsle .cse251 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse263 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse260 (bvadd .cse7 c_~csum~0 .cse263))) (let ((.cse256 ((_ sign_extend 32) .cse260)) (.cse257 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse256 (bvadd (bvneg ((_ sign_extend 32) .cse257)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse262 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse258 (bvadd c_~csum~0 .cse262 .cse263)) (.cse259 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse261 (bvadd .cse262 c_~bsum~0))) (and (bvsle .cse258 (bvadd (bvneg .cse259) (_ bv2147483647 32))) (bvsle .cse260 (bvadd (_ bv2147483647 32) (bvneg .cse261))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse258) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse259)))) (bvsge .cse256 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse261)))))))) (bvsle .cse260 (bvadd (_ bv2147483647 32) (bvneg .cse257)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse270 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse264 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse270))) (.cse265 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse264 (bvadd (bvneg ((_ sign_extend 32) .cse265)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse269 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse266 (bvadd c_~csum~0 .cse269 .cse270)) (.cse267 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse268 (bvadd .cse269 c_~bsum~0))) (and (bvsle .cse266 (bvadd (bvneg .cse267) (_ bv2147483647 32))) (bvsge ((_ sign_extend 32) v_arrayElimCell_11) (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse268 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse266) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse267)))) (bvsge .cse264 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse268)))))))) (bvsle .cse265 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse277 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse271 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse277))) (.cse272 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse271 (bvadd (bvneg ((_ sign_extend 32) .cse272)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse276 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse273 (bvadd c_~csum~0 .cse276 .cse277)) (.cse274 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse275 (bvadd .cse276 c_~bsum~0))) (and (bvsle .cse273 (bvadd (bvneg .cse274) (_ bv2147483647 32))) (bvsle .cse275 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse273) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse274)))) (bvsge .cse271 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse275)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse272 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse280 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse279 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse278 ((_ sign_extend 32) .cse280))) (and (bvsge .cse278 (bvadd (bvneg ((_ sign_extend 32) .cse279)) (_ bv18446744071562067968 64))) (bvsle .cse280 (bvadd (_ bv2147483647 32) (bvneg .cse279))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse282 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse281 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse281 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse282 (_ bv0 32)) (bvsle .cse280 (bvadd (_ bv2147483647 32) (bvneg .cse281))) (bvsle .cse282 (_ bv0 32)) (bvsge .cse278 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse281))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse287 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse290 (bvadd .cse7 c_~csum~0 .cse287))) (let ((.cse288 ((_ sign_extend 32) .cse290)) (.cse289 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse286 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse285 (bvadd .cse286 c_~bsum~0))) (let ((.cse284 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse283 ((_ sign_extend 32) .cse285))) (and (bvsge .cse283 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse284 (_ bv0 32)) (bvsle .cse285 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse286 .cse287)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse284)))) (bvsge .cse288 (bvadd (_ bv18446744071562067968 64) (bvneg .cse283)))))))) (bvsge .cse288 (bvadd (bvneg ((_ sign_extend 32) .cse289)) (_ bv18446744071562067968 64))) (bvsle .cse290 (bvadd (_ bv2147483647 32) (bvneg .cse289)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse292 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse296 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse292))) (.cse297 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse291 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse294 (bvadd .cse291 c_~bsum~0))) (let ((.cse293 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse295 ((_ sign_extend 32) .cse294))) (and (bvsle (bvadd c_~csum~0 .cse291 .cse292) (bvadd (bvneg .cse293) (_ bv2147483647 32))) (bvsle .cse294 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse293 (_ bv0 32)) (bvsge .cse295 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse294 (_ bv0 32)) (bvsge .cse296 (bvadd (_ bv18446744071562067968 64) (bvneg .cse295)))))))) (bvsge .cse296 (bvadd (bvneg ((_ sign_extend 32) .cse297)) (_ bv18446744071562067968 64))) (bvsle .cse297 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse302 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse300 (bvadd .cse7 c_~csum~0 .cse302))) (let ((.cse299 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse298 ((_ sign_extend 32) .cse300))) (and (bvsge .cse298 (bvadd (bvneg ((_ sign_extend 32) .cse299)) (_ bv18446744071562067968 64))) (bvsle .cse300 (bvadd (_ bv2147483647 32) (bvneg .cse299))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse301 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse303 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse304 (bvadd .cse301 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse301 .cse302) (bvadd (bvneg .cse303) (_ bv2147483647 32))) (bvsle .cse304 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse303 (_ bv0 32)) (bvsle .cse300 (bvadd (_ bv2147483647 32) (bvneg .cse304))) (bvsge .cse298 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse304))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse309 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse307 (bvadd .cse7 c_~csum~0 .cse309))) (let ((.cse306 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse305 ((_ sign_extend 32) .cse307))) (and (bvsge .cse305 (bvadd (bvneg ((_ sign_extend 32) .cse306)) (_ bv18446744071562067968 64))) (bvsle .cse307 (bvadd (_ bv2147483647 32) (bvneg .cse306))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse308 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse310 (bvadd .cse308 c_~bsum~0))) (let ((.cse311 ((_ sign_extend 32) .cse310))) (and (bvsle (bvadd c_~csum~0 .cse308 .cse309) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse310 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse311 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse310 (_ bv0 32)) (bvsge .cse305 (bvadd (_ bv18446744071562067968 64) (bvneg .cse311))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse314 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse312 ((_ sign_extend 32) .cse314)) (.cse313 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse312 (bvadd (bvneg ((_ sign_extend 32) .cse313)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse315 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse314 (bvadd (_ bv2147483647 32) (bvneg .cse315))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsge .cse312 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse315)))) (bvsge v_arrayElimCell_10 (_ bv0 32))))) (bvsle .cse314 (bvadd (_ bv2147483647 32) (bvneg .cse313))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse317 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse318 (bvadd .cse7 c_~csum~0 .cse317))) (let ((.cse320 ((_ sign_extend 32) .cse318)) (.cse321 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse316 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse319 (bvadd .cse316 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse316 .cse317) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse318 (bvadd (_ bv2147483647 32) (bvneg .cse319))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse320 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse319)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsge .cse320 (bvadd (bvneg ((_ sign_extend 32) .cse321)) (_ bv18446744071562067968 64))) (bvsle .cse318 (bvadd (_ bv2147483647 32) (bvneg .cse321)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse327 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse328 (bvadd .cse7 c_~csum~0 .cse327))) (let ((.cse322 ((_ sign_extend 32) .cse328)) (.cse323 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse322 (bvadd (bvneg ((_ sign_extend 32) .cse323)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse326 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse324 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse325 (bvadd .cse326 c_~bsum~0))) (and (bvsle .cse324 (_ bv0 32)) (bvsle v_arrayElimCell_11 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse325 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse326 .cse327)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse324)))) (bvsge .cse322 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse325)))))))) (bvsle .cse328 (bvadd (_ bv2147483647 32) (bvneg .cse323)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse335 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse329 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse335))) (.cse330 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse329 (bvadd (bvneg ((_ sign_extend 32) .cse330)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse334 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse331 (bvadd c_~csum~0 .cse334 .cse335)) (.cse332 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse333 (bvadd .cse334 c_~bsum~0))) (and (bvsle .cse331 (bvadd (bvneg .cse332) (_ bv2147483647 32))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse333 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse331) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse332)))) (bvsge .cse329 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse333)))) (bvsge v_arrayElimCell_10 (_ bv0 32)))))) (bvsle .cse330 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse342 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse340 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 .cse342))) (.cse343 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse341 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse338 (bvadd .cse341 c_~bsum~0))) (let ((.cse336 (bvadd c_~csum~0 .cse341 .cse342)) (.cse337 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse339 ((_ sign_extend 32) .cse338))) (and (bvsle .cse336 (bvadd (bvneg .cse337) (_ bv2147483647 32))) (bvsle .cse338 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse339 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse338 (_ bv0 32)) (bvsge ((_ sign_extend 32) .cse336) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse337)))) (bvsge .cse340 (bvadd (_ bv18446744071562067968 64) (bvneg .cse339)))))))) (bvsge .cse340 (bvadd (bvneg ((_ sign_extend 32) .cse343)) (_ bv18446744071562067968 64))) (bvsle .cse343 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse347 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse344 ((_ sign_extend 32) .cse347)) (.cse345 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse344 (bvadd (bvneg ((_ sign_extend 32) .cse345)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse346 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle .cse346 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle .cse347 (bvadd (_ bv2147483647 32) (bvneg .cse346))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse344 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse346))))))) (bvsle .cse345 (_ bv0 32)))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse354 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse351 (bvadd .cse7 c_~csum~0 .cse354))) (let ((.cse352 ((_ sign_extend 32) .cse351)) (.cse355 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse353 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse348 (bvadd c_~csum~0 .cse353 .cse354)) (.cse349 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse350 (bvadd .cse353 c_~bsum~0))) (and (bvsle .cse348 (bvadd (bvneg .cse349) (_ bv2147483647 32))) (bvsle .cse350 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse351 (bvadd (_ bv2147483647 32) (bvneg .cse350))) (bvsge ((_ sign_extend 32) .cse348) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse349)))) (bvsge .cse352 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse350)))))))) (bvsge .cse352 (bvadd (bvneg ((_ sign_extend 32) .cse355)) (_ bv18446744071562067968 64))) (bvsle .cse355 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse358 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse357 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse356 ((_ sign_extend 32) .cse358))) (and (bvsge .cse356 (bvadd (bvneg ((_ sign_extend 32) .cse357)) (_ bv18446744071562067968 64))) (bvsle .cse358 (bvadd (_ bv2147483647 32) (bvneg .cse357))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse359 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsle (bvadd v_arrayElimCell_10 v_arrayElimCell_11) (_ bv0 32)) (bvsle v_arrayElimCell_11 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse359 (_ bv0 32)) (bvsge .cse356 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse359))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse360 ((_ sign_extend 32) (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (.cse361 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse360 (bvadd (bvneg ((_ sign_extend 32) .cse361)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse362 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse363 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse364 ((_ sign_extend 32) .cse362))) (and (bvsle .cse362 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse363 (_ bv0 32)) (bvsge .cse364 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse363 (_ bv0 32)) (bvsle .cse362 (_ bv0 32)) (bvsge .cse360 (bvadd (_ bv18446744071562067968 64) (bvneg .cse364))))))) (bvsle .cse361 (_ bv0 32))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse366 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse372 (bvadd .cse7 c_~csum~0 .cse366))) (let ((.cse370 ((_ sign_extend 32) .cse372)) (.cse371 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse365 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse368 (bvadd .cse365 c_~bsum~0))) (let ((.cse367 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse369 ((_ sign_extend 32) .cse368))) (and (bvsle (bvadd c_~csum~0 .cse365 .cse366) (bvadd (bvneg .cse367) (_ bv2147483647 32))) (bvsle .cse368 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse367 (_ bv0 32)) (bvsge .cse369 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle .cse368 (_ bv0 32)) (bvsge .cse370 (bvadd (_ bv18446744071562067968 64) (bvneg .cse369)))))))) (bvsge .cse370 (bvadd (bvneg ((_ sign_extend 32) .cse371)) (_ bv18446744071562067968 64))) (bvsle .cse372 (bvadd (_ bv2147483647 32) (bvneg .cse371)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse374 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse376 (bvadd .cse7 c_~csum~0 .cse374))) (let ((.cse377 ((_ sign_extend 32) .cse376)) (.cse378 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse373 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse375 (bvadd .cse373 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse373 .cse374) (bvadd (bvneg (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (_ bv2147483647 32))) (bvsle .cse375 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse376 (bvadd (_ bv2147483647 32) (bvneg .cse375))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsge .cse377 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse375)))))))) (bvsge .cse377 (bvadd (bvneg ((_ sign_extend 32) .cse378)) (_ bv18446744071562067968 64))) (bvsle .cse378 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse386 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse381 (bvadd .cse7 c_~csum~0 .cse386))) (let ((.cse380 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse379 ((_ sign_extend 32) .cse381))) (and (bvsge .cse379 (bvadd (bvneg ((_ sign_extend 32) .cse380)) (_ bv18446744071562067968 64))) (bvsle .cse381 (bvadd (_ bv2147483647 32) (bvneg .cse380))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse385 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse383 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (.cse384 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse382 (bvadd .cse385 c_~bsum~0))) (and (bvsle .cse382 .cse383) (bvsle .cse381 (bvadd (_ bv2147483647 32) (bvneg .cse382))) (bvsle .cse384 (_ bv0 32)) (bvsle v_arrayElimCell_11 .cse383) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse385 .cse386)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse384)))) (bvsge .cse379 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse382))))))))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse390 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse393 (bvadd .cse7 c_~csum~0 .cse390))) (let ((.cse387 ((_ sign_extend 32) .cse393)) (.cse388 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse387 (bvadd (bvneg ((_ sign_extend 32) .cse388)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse389 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse391 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse392 (bvadd .cse389 c_~bsum~0))) (and (bvsle (bvadd c_~csum~0 .cse389 .cse390) (bvadd (bvneg .cse391) (_ bv2147483647 32))) (bvsle .cse392 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse391 (_ bv0 32)) (bvsle .cse393 (bvadd (_ bv2147483647 32) (bvneg .cse392))) (bvsge .cse387 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse392)))))))) (bvsle .cse388 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse400 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse396 (bvadd .cse7 c_~csum~0 .cse400))) (let ((.cse394 ((_ sign_extend 32) .cse396)) (.cse395 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse394 (bvadd (bvneg ((_ sign_extend 32) .cse395)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse399 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse398 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse397 (bvadd .cse399 c_~bsum~0))) (and (bvsle .cse396 (bvadd (_ bv2147483647 32) (bvneg .cse397))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse398 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse399 .cse400)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse398)))) (bvsge .cse394 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse397)))))))) (bvsle .cse396 (bvadd (_ bv2147483647 32) (bvneg .cse395)))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse407 (bvmul v_arrayElimCell_11 (_ bv4294967295 32)))) (let ((.cse404 (bvadd .cse7 c_~csum~0 .cse407))) (let ((.cse401 ((_ sign_extend 32) .cse404)) (.cse402 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse401 (bvadd (bvneg ((_ sign_extend 32) .cse402)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse406 (bvmul v_arrayElimCell_10 (_ bv4294967295 32)))) (let ((.cse405 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse403 (bvadd .cse406 c_~bsum~0))) (and (bvsle .cse403 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsle .cse404 (bvadd (_ bv2147483647 32) (bvneg .cse403))) (bvsle .cse405 (_ bv0 32)) (bvsge ((_ sign_extend 32) (bvadd c_~csum~0 .cse406 .cse407)) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse405)))) (bvsge .cse401 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse403)))))))) (bvsle .cse402 (_ bv0 32))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse411 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse408 ((_ sign_extend 32) .cse411)) (.cse409 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0))) (and (bvsge .cse408 (bvadd (bvneg ((_ sign_extend 32) .cse409)) (_ bv18446744071562067968 64))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse410 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse412 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (and (bvsge .cse410 (_ bv0 32)) (bvsle .cse411 (bvadd (_ bv2147483647 32) (bvneg .cse412))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse410 (_ bv0 32)) (bvsge .cse408 (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse412))))))) (bvsle .cse411 (bvadd (_ bv2147483647 32) (bvneg .cse409))))))) (exists ((v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse415 (bvadd .cse7 c_~csum~0 (bvmul v_arrayElimCell_11 (_ bv4294967295 32))))) (let ((.cse414 (bvadd c_~asum~0 .cse6 v_arrayElimCell_11 c_~bsum~0)) (.cse413 ((_ sign_extend 32) .cse415))) (and (bvsge .cse413 (bvadd (bvneg ((_ sign_extend 32) .cse414)) (_ bv18446744071562067968 64))) (bvsle .cse415 (bvadd (_ bv2147483647 32) (bvneg .cse414))) (exists ((v_arrayElimCell_10 (_ BitVec 32))) (let ((.cse416 (bvadd (bvmul v_arrayElimCell_10 (_ bv4294967295 32)) c_~bsum~0))) (let ((.cse417 (bvadd v_arrayElimCell_10 v_arrayElimCell_11)) (.cse418 ((_ sign_extend 32) .cse416))) (and (bvsle .cse416 (bvadd (_ bv2147483647 32) (bvneg v_arrayElimCell_10))) (bvsge .cse417 (_ bv0 32)) (bvsge .cse418 (bvadd (bvneg ((_ sign_extend 32) v_arrayElimCell_10)) (_ bv18446744071562067968 64))) (bvsle v_arrayElimCell_10 (_ bv0 32)) (bvsle .cse417 (_ bv0 32)) (bvsle .cse416 (_ bv0 32)) (bvsge .cse413 (bvadd (_ bv18446744071562067968 64) (bvneg .cse418))))))))))))) (= c_~csum~0 (bvadd c_~asum~0 c_~bsum~0))) is different from false Killed by 15