./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 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-three-array-sum.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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 21:01:03,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 21:01:03,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 21:01:03,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 21:01:03,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 21:01:03,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 21:01:03,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 21:01:03,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 21:01:03,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 21:01:03,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 21:01:03,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 21:01:03,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 21:01:03,858 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 21:01:03,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 21:01:03,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 21:01:03,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 21:01:03,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 21:01:03,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 21:01:03,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 21:01:03,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 21:01:03,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 21:01:03,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 21:01:03,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 21:01:03,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 21:01:03,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 21:01:03,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 21:01:03,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 21:01:03,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 21:01:03,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 21:01:03,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 21:01:03,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 21:01:03,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 21:01:03,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 21:01:03,861 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 21:01:03,862 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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> SUFFICIENT [2025-01-23 21:01:04,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 21:01:04,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 21:01:04,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 21:01:04,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 21:01:04,091 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 21:01:04,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2025-01-23 21:01:05,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/edfd70428/30946d379b5544ef8fa320f98943a6ad/FLAG9f7857c9b [2025-01-23 21:01:05,363 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 21:01:05,363 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2025-01-23 21:01:05,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/edfd70428/30946d379b5544ef8fa320f98943a6ad/FLAG9f7857c9b [2025-01-23 21:01:05,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/edfd70428/30946d379b5544ef8fa320f98943a6ad [2025-01-23 21:01:05,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 21:01:05,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 21:01:05,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 21:01:05,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 21:01:05,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 21:01:05,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339bfa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05, skipping insertion in model container [2025-01-23 21:01:05,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 21:01:05,856 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-three-array-sum.wvr.c[2730,2743] [2025-01-23 21:01:05,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 21:01:05,866 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 21:01:05,898 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-three-array-sum.wvr.c[2730,2743] [2025-01-23 21:01:05,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 21:01:05,913 INFO L204 MainTranslator]: Completed translation [2025-01-23 21:01:05,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05 WrapperNode [2025-01-23 21:01:05,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 21:01:05,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 21:01:05,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 21:01:05,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 21:01:05,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,944 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 129 [2025-01-23 21:01:05,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 21:01:05,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 21:01:05,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 21:01:05,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 21:01:05,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,972 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 21:01:05,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 21:01:05,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 21:01:05,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 21:01:05,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (1/1) ... [2025-01-23 21:01:05,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 21:01:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:01:06,003 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) [2025-01-23 21:01:06,007 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 [2025-01-23 21:01:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 21:01:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-23 21:01:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-23 21:01:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-23 21:01:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-23 21:01:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-23 21:01:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-23 21:01:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 21:01:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-23 21:01:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-23 21:01:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-23 21:01:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-23 21:01:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 21:01:06,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 21:01:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-23 21:01:06,025 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 21:01:06,094 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 21:01:06,095 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 21:01:06,304 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 21:01:06,304 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 21:01:06,471 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 21:01:06,471 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 21:01:06,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 09:01:06 BoogieIcfgContainer [2025-01-23 21:01:06,472 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 21:01:06,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 21:01:06,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 21:01:06,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 21:01:06,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 09:01:05" (1/3) ... [2025-01-23 21:01:06,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e713518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 09:01:06, skipping insertion in model container [2025-01-23 21:01:06,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:01:05" (2/3) ... [2025-01-23 21:01:06,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e713518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 09:01:06, skipping insertion in model container [2025-01-23 21:01:06,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 09:01:06" (3/3) ... [2025-01-23 21:01:06,479 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-01-23 21:01:06,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 21:01:06,489 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 33 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-23 21:01:06,490 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 21:01:06,534 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-23 21:01:06,563 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 21:01:06,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 21:01:06,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:01:06,565 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) [2025-01-23 21:01:06,567 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 [2025-01-23 21:01:06,634 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 21:01:06,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 21:01:06,651 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;@16aeed78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 21:01:06,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-23 21:01:07,040 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)] === [2025-01-23 21:01:07,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:07,042 INFO L139 ounterexampleChecker]: Examining path program with hash -152741962, occurence #1 [2025-01-23 21:01:07,042 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:01:07,042 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:07,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1656455225, now seen corresponding path program 1 times [2025-01-23 21:01:07,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:07,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337428782] [2025-01-23 21:01:07,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:07,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:07,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-23 21:01:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-23 21:01:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 21:01:07,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337428782] [2025-01-23 21:01:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337428782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:01:07,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:01:07,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 21:01:07,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058165773] [2025-01-23 21:01:07,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:01:07,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 21:01:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:01:07,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 21:01:07,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-23 21:01:07,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:07,431 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:01:07,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:01:07,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:07,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 21:01:07,518 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)] === [2025-01-23 21:01:07,518 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:07,519 INFO L139 ounterexampleChecker]: Examining path program with hash -152741962, occurence #2 [2025-01-23 21:01:07,520 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-23 21:01:07,520 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-23 21:01:07,521 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:07,521 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-01-23 21:01:07,521 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:07,522 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-01-23 21:01:07,532 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:07,532 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-01-23 21:01:07,532 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:07,532 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-23 21:01:07,532 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:07,532 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-01-23 21:01:07,598 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 21:01:07,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 61 [2025-01-23 21:01:07,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-01-23 21:01:07,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 21:01:07,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2025-01-23 21:01:07,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 21:01:07,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2025-01-23 21:01:07,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2025-01-23 21:01:07,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-01-23 21:01:07,712 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-01-23 21:01:07,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 1 [2025-01-23 21:01:07,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 21:01:07,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2025-01-23 21:01:07,788 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-23 21:01:07,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2025-01-23 21:01:07,794 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-23 21:01:07,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2025-01-23 21:01:08,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1893962161, now seen corresponding path program 1 times [2025-01-23 21:01:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-23 21:01:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878117114] [2025-01-23 21:01:08,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:08,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:08,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-23 21:01:08,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-23 21:01:08,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:08,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 21:01:09,027 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-01-23 21:01:09,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878117114] [2025-01-23 21:01:09,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878117114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:01:09,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [490286258] [2025-01-23 21:01:09,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:09,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:09,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-23 21:01:09,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-23 21:01:09,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:09,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:09,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 21:01:09,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 21:01:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 21:01:09,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [490286258] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:01:09,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-23 21:01:09,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-23 21:01:09,181 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-01-23 21:01:09,181 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-01-23 21:01:09,181 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:09,181 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-01-23 21:01:09,181 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:09,182 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-01-23 21:01:09,182 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:09,182 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-23 21:01:09,182 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:09,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1422748963, now seen corresponding path program 1 times [2025-01-23 21:01:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974340392] [2025-01-23 21:01:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:09,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:09,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 21:01:09,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 21:01:09,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:09,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:09,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 21:01:09,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974340392] [2025-01-23 21:01:09,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974340392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:01:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307059551] [2025-01-23 21:01:09,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:01:09,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:01:09,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) [2025-01-23 21:01:09,356 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 [2025-01-23 21:01:09,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-23 21:01:09,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-23 21:01:09,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:09,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:09,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 21:01:09,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 21:01:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 21:01:09,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 21:01:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 21:01:09,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307059551] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 21:01:09,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 21:01:09,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-23 21:01:09,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451814390] [2025-01-23 21:01:09,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 21:01:09,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-23 21:01:09,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:01:09,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-23 21:01:09,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-23 21:01:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:09,571 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:01:09,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:01:09,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:09,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:09,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:09,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-23 21:01:09,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:01:09,907 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)] === [2025-01-23 21:01:09,907 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:09,908 INFO L139 ounterexampleChecker]: Examining path program with hash -152741962, occurence #3 [2025-01-23 21:01:09,908 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-23 21:01:09,908 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-23 21:01:09,908 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:09,909 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-01-23 21:01:09,909 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:09,909 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 10 [2025-01-23 21:01:09,909 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:09,909 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-23 21:01:09,909 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:09,909 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-23 21:01:09,909 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:09,909 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-01-23 21:01:09,961 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 21:01:09,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 61 [2025-01-23 21:01:09,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2025-01-23 21:01:10,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-23 21:01:10,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2025-01-23 21:01:10,039 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-23 21:01:10,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2025-01-23 21:01:10,043 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-01-23 21:01:10,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 1 [2025-01-23 21:01:10,051 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-23 21:01:10,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 1 [2025-01-23 21:01:10,058 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-01-23 21:01:10,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2025-01-23 21:01:10,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2025-01-23 21:01:10,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2025-01-23 21:01:10,073 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-23 21:01:10,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2025-01-23 21:01:11,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash 217592566, now seen corresponding path program 1 times [2025-01-23 21:01:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-01-23 21:01:11,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982046075] [2025-01-23 21:01:11,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:11,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:11,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-23 21:01:11,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-23 21:01:11,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:11,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-23 21:01:11,233 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-01-23 21:01:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982046075] [2025-01-23 21:01:11,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982046075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:01:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1891931570] [2025-01-23 21:01:11,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:11,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:11,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-23 21:01:11,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-23 21:01:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:11,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-23 21:01:11,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 21:01:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-23 21:01:11,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1891931570] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:01:11,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-23 21:01:11,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-01-23 21:01:11,329 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-01-23 21:01:11,329 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-01-23 21:01:11,329 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:11,329 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 38 [2025-01-23 21:01:11,329 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:11,329 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-01-23 21:01:11,330 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:11,330 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-23 21:01:11,330 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:11,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2004052423, now seen corresponding path program 2 times [2025-01-23 21:01:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23549996] [2025-01-23 21:01:11,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 21:01:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:11,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-01-23 21:01:11,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 40 of 46 statements. [2025-01-23 21:01:11,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 21:01:11,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-23 21:01:11,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23549996] [2025-01-23 21:01:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23549996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:01:11,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:01:11,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-23 21:01:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942308060] [2025-01-23 21:01:11,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:01:11,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 21:01:11,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:01:11,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 21:01:11,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-23 21:01:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:11,461 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:01:11,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:01:11,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:11,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:11,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:11,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:11,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2025-01-23 21:01:11,597 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)] === [2025-01-23 21:01:11,597 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:11,597 INFO L139 ounterexampleChecker]: Examining path program with hash -326228791, occurence #1 [2025-01-23 21:01:11,597 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:01:11,598 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:11,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1086210327, now seen corresponding path program 3 times [2025-01-23 21:01:11,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:11,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601290202] [2025-01-23 21:01:11,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 21:01:11,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:11,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 3 equivalence classes. [2025-01-23 21:01:11,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 50 statements. [2025-01-23 21:01:11,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-23 21:01:11,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-23 21:01:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:11,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601290202] [2025-01-23 21:01:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601290202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:01:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:01:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-23 21:01:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081998036] [2025-01-23 21:01:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:01:11,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-23 21:01:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:01:11,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-23 21:01:11,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-23 21:01:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:11,803 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:01:11,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:01:11,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:11,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:11,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:11,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:12,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:12,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-23 21:01:12,132 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)] === [2025-01-23 21:01:12,132 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:12,132 INFO L139 ounterexampleChecker]: Examining path program with hash -1659180464, occurence #1 [2025-01-23 21:01:12,132 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:01:12,132 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:12,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:12,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1122561590, now seen corresponding path program 1 times [2025-01-23 21:01:12,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:12,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160830791] [2025-01-23 21:01:12,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:12,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-23 21:01:12,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-23 21:01:12,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:12,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-23 21:01:12,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:12,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160830791] [2025-01-23 21:01:12,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160830791] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:01:12,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722598081] [2025-01-23 21:01:12,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:01:12,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:01:12,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:01:12,305 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) [2025-01-23 21:01:12,306 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 [2025-01-23 21:01:12,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-23 21:01:12,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-23 21:01:12,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:01:12,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:12,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-23 21:01:12,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 21:01:12,524 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-23 21:01:12,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 21:01:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-23 21:01:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722598081] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 21:01:12,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 21:01:12,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-23 21:01:12,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075252783] [2025-01-23 21:01:12,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 21:01:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-23 21:01:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:01:12,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-23 21:01:12,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-01-23 21:01:12,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:12,619 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:01:12,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.2631578947368425) internal successors, (100), 18 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:01:12,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:12,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:12,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:12,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:12,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:12,758 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 [2025-01-23 21:01:12,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:01:12,950 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)] === [2025-01-23 21:01:12,950 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:12,950 INFO L139 ounterexampleChecker]: Examining path program with hash -1659180464, occurence #2 [2025-01-23 21:01:12,950 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-23 21:01:12,950 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-23 21:01:12,950 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:12,950 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-23 21:01:12,950 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:12,950 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-23 21:01:12,950 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:12,950 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-23 21:01:12,950 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:12,950 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-01-23 21:01:12,950 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:12,950 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-01-23 21:01:12,950 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:12,950 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-01-23 21:01:12,950 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:12,950 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-01-23 21:01:12,950 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:12,951 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 58 [2025-01-23 21:01:12,951 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:12,951 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 60 [2025-01-23 21:01:12,951 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:12,951 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-23 21:01:12,951 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:12,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1575301266, now seen corresponding path program 2 times [2025-01-23 21:01:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856924805] [2025-01-23 21:01:12,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 21:01:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:12,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-23 21:01:12,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-01-23 21:01:12,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 21:01:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-23 21:01:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856924805] [2025-01-23 21:01:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856924805] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:01:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246339630] [2025-01-23 21:01:13,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 21:01:13,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:01:13,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:01:13,116 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) [2025-01-23 21:01:13,117 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 [2025-01-23 21:01:13,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-01-23 21:01:13,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-01-23 21:01:13,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 21:01:13,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:13,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-23 21:01:13,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 21:01:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-23 21:01:13,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-23 21:01:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-23 21:01:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246339630] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-23 21:01:13,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-23 21:01:13,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-01-23 21:01:13,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860090589] [2025-01-23 21:01:13,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-23 21:01:13,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-23 21:01:13,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:01:13,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-23 21:01:13,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-01-23 21:01:13,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:13,453 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:01:13,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 18 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:01:13,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:13,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:13,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:13,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:13,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:13,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-23 21:01:13,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-23 21:01:13,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:01:13,875 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)] === [2025-01-23 21:01:13,875 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:13,875 INFO L139 ounterexampleChecker]: Examining path program with hash -1659180464, occurence #3 [2025-01-23 21:01:13,875 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-01-23 21:01:13,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-01-23 21:01:13,875 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:13,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-01-23 21:01:13,875 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:13,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-01-23 21:01:13,875 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:13,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-01-23 21:01:13,875 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:13,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-01-23 21:01:13,875 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:13,875 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-01-23 21:01:13,876 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:13,876 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-01-23 21:01:13,876 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:13,876 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 50 [2025-01-23 21:01:13,876 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:13,876 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 67 [2025-01-23 21:01:13,876 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:13,876 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 68 [2025-01-23 21:01:13,876 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-01-23 21:01:13,876 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 70 [2025-01-23 21:01:13,876 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-01-23 21:01:13,876 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-01-23 21:01:13,876 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:13,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash -948620021, now seen corresponding path program 3 times [2025-01-23 21:01:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449094539] [2025-01-23 21:01:13,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 21:01:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:13,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 4 equivalence classes. [2025-01-23 21:01:13,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 50 of 73 statements. [2025-01-23 21:01:13,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-23 21:01:13,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-23 21:01:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449094539] [2025-01-23 21:01:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449094539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:01:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:01:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 21:01:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435171933] [2025-01-23 21:01:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:01:14,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 21:01:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:01:14,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 21:01:14,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-23 21:01:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:14,075 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:01:14,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:01:14,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:14,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:14,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:14,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:14,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:14,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-23 21:01:14,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-23 21:01:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:14,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-23 21:01:14,225 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)] === [2025-01-23 21:01:14,225 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:14,225 INFO L139 ounterexampleChecker]: Examining path program with hash 508836552, occurence #1 [2025-01-23 21:01:14,225 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:01:14,225 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:14,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1202575151, now seen corresponding path program 4 times [2025-01-23 21:01:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:14,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594857031] [2025-01-23 21:01:14,226 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 21:01:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:14,239 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 80 statements into 2 equivalence classes. [2025-01-23 21:01:14,251 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 70 of 80 statements. [2025-01-23 21:01:14,251 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-23 21:01:14,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-23 21:01:14,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:14,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594857031] [2025-01-23 21:01:14,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594857031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:01:14,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:01:14,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 21:01:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171548900] [2025-01-23 21:01:14,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:01:14,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 21:01:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:01:14,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 21:01:14,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-23 21:01:14,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:14,351 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:01:14,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:01:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-01-23 21:01:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:14,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:01:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:01:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-23 21:01:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 21:01:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-23 21:01:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:01:14,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-23 21:01:14,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-23 21:01:14,484 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)] === [2025-01-23 21:01:14,484 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:01:14,485 INFO L139 ounterexampleChecker]: Examining path program with hash -328756146, occurence #1 [2025-01-23 21:01:14,485 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:01:14,485 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:01:14,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:01:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1084224370, now seen corresponding path program 4 times [2025-01-23 21:01:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:01:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303283034] [2025-01-23 21:01:14,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 21:01:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:01:14,493 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-01-23 21:01:14,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-01-23 21:01:14,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-23 21:01:14,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-23 21:01:15,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:01:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303283034] [2025-01-23 21:01:15,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303283034] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:01:15,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126965849] [2025-01-23 21:01:15,933 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 21:01:15,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:01:15,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:01:15,934 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) [2025-01-23 21:01:15,936 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 [2025-01-23 21:01:15,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 60 statements into 2 equivalence classes. [2025-01-23 21:01:16,134 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-01-23 21:01:16,134 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-23 21:01:16,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:01:16,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-01-23 21:01:16,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 21:01:16,613 INFO L349 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-01-23 21:01:16,613 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 54 [2025-01-23 21:01:17,342 INFO L349 Elim1Store]: treesize reduction 132, result has 35.6 percent of original size [2025-01-23 21:01:17,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 121 treesize of output 144 [2025-01-23 21:01:19,253 INFO L349 Elim1Store]: treesize reduction 370, result has 27.6 percent of original size [2025-01-23 21:01:19,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 3 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 53 case distinctions, treesize of input 304 treesize of output 310 [2025-01-23 21:14:18,185 WARN L286 SmtUtils]: Spent 12.88m on a formula simplification. DAG size of input: 7493 DAG size of output: 6773 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-01-23 21:14:18,189 INFO L349 Elim1Store]: treesize reduction 4560, result has 81.3 percent of original size [2025-01-23 21:14:18,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 127 select indices, 127 select index equivalence classes, 6 disjoint index pairs (out of 8001 index pairs), introduced 127 new quantified variables, introduced 8001 case distinctions, treesize of input 2720 treesize of output 20856 [2025-01-23 21:14:26,271 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 7080 DAG size of output: 7079 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-23 21:14:34,450 WARN L286 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 7083 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15