./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i --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/pthread-deagle/arithmetic_prog_bad.i -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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --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:24:32,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 21:24:32,359 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:24:32,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 21:24:32,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 21:24:32,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 21:24:32,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 21:24:32,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 21:24:32,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 21:24:32,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 21:24:32,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 21:24:32,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 21:24:32,384 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 21:24:32,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 21:24:32,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 21:24:32,384 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 21:24:32,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 21:24:32,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 21:24:32,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 21:24:32,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 21:24:32,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 21:24:32,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 21:24:32,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 21:24:32,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 21:24:32,385 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 21:24:32,385 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 21:24:32,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 21:24:32,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 21:24:32,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 21:24:32,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 21:24:32,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 21:24:32,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 21:24:32,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 21:24:32,387 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 21:24:32,388 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 21:24:32,388 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 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:24:32,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 21:24:32,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 21:24:32,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 21:24:32,696 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 21:24:32,697 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 21:24:32,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2025-01-23 21:24:33,976 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/43dea9c2e/698178606a4e4b66ba1e2ae43de2c37b/FLAG437232224 [2025-01-23 21:24:34,253 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 21:24:34,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2025-01-23 21:24:34,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/43dea9c2e/698178606a4e4b66ba1e2ae43de2c37b/FLAG437232224 [2025-01-23 21:24:34,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/43dea9c2e/698178606a4e4b66ba1e2ae43de2c37b [2025-01-23 21:24:34,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 21:24:34,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 21:24:34,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 21:24:34,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 21:24:34,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 21:24:34,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:34,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dcfdd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34, skipping insertion in model container [2025-01-23 21:24:34,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:34,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 21:24:34,701 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/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2025-01-23 21:24:34,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 21:24:34,732 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 21:24:34,860 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/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2025-01-23 21:24:34,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 21:24:34,963 INFO L204 MainTranslator]: Completed translation [2025-01-23 21:24:34,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34 WrapperNode [2025-01-23 21:24:34,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 21:24:34,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 21:24:34,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 21:24:34,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 21:24:34,971 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:24:34" (1/1) ... [2025-01-23 21:24:34,987 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:24:34" (1/1) ... [2025-01-23 21:24:35,012 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2025-01-23 21:24:35,012 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 21:24:35,013 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 21:24:35,013 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 21:24:35,013 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 21:24:35,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,030 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,045 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,055 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 21:24:35,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 21:24:35,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 21:24:35,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 21:24:35,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (1/1) ... [2025-01-23 21:24:35,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 21:24:35,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:24:35,094 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:24:35,096 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:24:35,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-23 21:24:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-23 21:24:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-23 21:24:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-23 21:24:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-23 21:24:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-23 21:24:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-23 21:24:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 21:24:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 21:24:35,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 21:24:35,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 21:24:35,112 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:24:35,232 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 21:24:35,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 21:24:35,565 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 21:24:35,565 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 21:24:36,491 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 21:24:36,492 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 21:24:36,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 09:24:36 BoogieIcfgContainer [2025-01-23 21:24:36,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 21:24:36,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 21:24:36,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 21:24:36,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 21:24:36,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 09:24:34" (1/3) ... [2025-01-23 21:24:36,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4288dd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 09:24:36, skipping insertion in model container [2025-01-23 21:24:36,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 09:24:34" (2/3) ... [2025-01-23 21:24:36,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4288dd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 09:24:36, skipping insertion in model container [2025-01-23 21:24:36,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 09:24:36" (3/3) ... [2025-01-23 21:24:36,504 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2025-01-23 21:24:36,517 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 21:24:36,519 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_bad.i that has 3 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-23 21:24:36,520 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 21:24:36,585 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-23 21:24:36,625 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 21:24:36,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 21:24:36,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:24:36,629 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:24:36,630 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:24:36,715 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 21:24:36,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 21:24:36,739 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;@52fb6961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 21:24:36,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-23 21:24:37,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 21:24:37,329 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:24:37,329 INFO L139 ounterexampleChecker]: Examining path program with hash -1543240832, occurence #1 [2025-01-23 21:24:37,329 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:24:37,331 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:24:37,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:24:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1594770461, now seen corresponding path program 1 times [2025-01-23 21:24:37,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:24:37,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94774784] [2025-01-23 21:24:37,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:24:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:24:37,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 21:24:37,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 21:24:37,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:24:37,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:24:38,248 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:24:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:24:38,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94774784] [2025-01-23 21:24:38,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94774784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:24:38,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:24:38,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 21:24:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915335759] [2025-01-23 21:24:38,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:24:38,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 21:24:38,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:24:38,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 21:24:38,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 21:24:38,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:38,278 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:24:38,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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:24:38,280 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:38,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:38,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 21:24:38,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 21:24:38,465 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:24:38,465 INFO L139 ounterexampleChecker]: Examining path program with hash -1335530178, occurence #1 [2025-01-23 21:24:38,466 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:24:38,466 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:24:38,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:24:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1506141637, now seen corresponding path program 2 times [2025-01-23 21:24:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:24:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727237000] [2025-01-23 21:24:38,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 21:24:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:24:38,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-01-23 21:24:38,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-01-23 21:24:38,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-23 21:24:38,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:24:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-23 21:24:39,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:24:39,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727237000] [2025-01-23 21:24:39,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727237000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:24:39,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:24:39,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 21:24:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387154102] [2025-01-23 21:24:39,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:24:39,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 21:24:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:24:39,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 21:24:39,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 21:24:39,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:39,100 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:24:39,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 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:24:39,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:39,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:39,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:39,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 21:24:39,330 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 21:24:39,330 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:24:39,331 INFO L139 ounterexampleChecker]: Examining path program with hash -1444688592, occurence #1 [2025-01-23 21:24:39,331 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:24:39,331 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:24:39,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:24:39,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1238355879, now seen corresponding path program 3 times [2025-01-23 21:24:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:24:39,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554682447] [2025-01-23 21:24:39,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 21:24:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:24:39,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 2 equivalence classes. [2025-01-23 21:24:39,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-01-23 21:24:39,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-23 21:24:39,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:24:39,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-23 21:24:39,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:24:39,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554682447] [2025-01-23 21:24:39,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554682447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:24:39,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:24:39,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 21:24:39,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488543601] [2025-01-23 21:24:39,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:24:39,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 21:24:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:24:39,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 21:24:39,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 21:24:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:39,937 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:24:39,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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:24:39,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:39,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:39,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:40,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:24:40,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 21:24:40,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 21:24:40,139 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:24:40,139 INFO L139 ounterexampleChecker]: Examining path program with hash -932942640, occurence #1 [2025-01-23 21:24:40,139 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:24:40,139 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:24:40,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:24:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1793141826, now seen corresponding path program 1 times [2025-01-23 21:24:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:24:40,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484894114] [2025-01-23 21:24:40,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:24:40,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:24:40,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 21:24:40,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 21:24:40,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:24:40,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:24:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 21:24:40,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:24:40,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484894114] [2025-01-23 21:24:40,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484894114] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:24:40,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495193781] [2025-01-23 21:24:40,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:24:40,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:24:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:24:40,496 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:24:40,498 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:24:40,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-23 21:24:40,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-23 21:24:40,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:24:40,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:24:40,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-23 21:24:40,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 21:24:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-23 21:24:40,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 21:24:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495193781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:24:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-23 21:24:40,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-01-23 21:24:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56514105] [2025-01-23 21:24:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:24:40,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 21:24:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:24:40,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 21:24:40,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-23 21:24:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:40,978 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:24:40,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:24:40,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:40,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:40,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:24:40,978 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:41,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:24:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:41,060 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:24:41,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:24:41,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 21:24:41,253 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:24:41,254 INFO L139 ounterexampleChecker]: Examining path program with hash -446763882, occurence #1 [2025-01-23 21:24:41,254 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:24:41,254 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:24:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:24:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash 575408954, now seen corresponding path program 4 times [2025-01-23 21:24:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:24:41,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762850007] [2025-01-23 21:24:41,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 21:24:41,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:24:41,524 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-01-23 21:24:41,532 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 63 of 65 statements. [2025-01-23 21:24:41,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-23 21:24:41,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:24:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 21:24:41,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:24:41,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762850007] [2025-01-23 21:24:41,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762850007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:24:41,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 21:24:41,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 21:24:41,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428002329] [2025-01-23 21:24:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:24:41,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 21:24:41,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:24:41,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 21:24:41,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-23 21:24:41,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:41,637 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:24:41,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 21:24:41,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:41,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:41,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:24:41,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:41,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:24:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:24:41,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 21:24:41,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 21:24:41,746 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:24:41,746 INFO L139 ounterexampleChecker]: Examining path program with hash 1770943812, occurence #1 [2025-01-23 21:24:41,746 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:24:41,746 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:24:41,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:24:41,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1611594138, now seen corresponding path program 1 times [2025-01-23 21:24:41,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:24:41,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385176390] [2025-01-23 21:24:41,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:24:41,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:24:41,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-23 21:24:41,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-23 21:24:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:24:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:24:42,025 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-23 21:24:42,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 21:24:42,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385176390] [2025-01-23 21:24:42,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385176390] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-23 21:24:42,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976198777] [2025-01-23 21:24:42,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:24:42,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:24:42,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 21:24:42,028 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:24:42,031 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:24:42,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-23 21:24:42,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-23 21:24:42,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:24:42,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 21:24:42,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-23 21:24:42,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-23 21:24:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-23 21:24:42,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-23 21:24:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976198777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 21:24:42,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-23 21:24:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-23 21:24:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616827320] [2025-01-23 21:24:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 21:24:42,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 21:24:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 21:24:42,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 21:24:42,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-23 21:24:42,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:42,521 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 21:24:42,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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:24:42,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:42,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:42,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:24:42,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:42,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:24:42,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 21:24:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 21:24:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 21:24:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 21:24:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 21:24:42,598 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:24:42,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-23 21:24:42,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-23 21:24:42,790 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 21:24:42,790 INFO L139 ounterexampleChecker]: Examining path program with hash 1841703526, occurence #1 [2025-01-23 21:24:42,790 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 21:24:42,790 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 21:24:42,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 21:24:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1279918394, now seen corresponding path program 1 times [2025-01-23 21:24:42,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 21:24:42,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871100789] [2025-01-23 21:24:42,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 21:24:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 21:24:43,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-23 21:24:43,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-23 21:24:43,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:24:43,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 21:24:43,043 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 21:24:43,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-23 21:24:43,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-23 21:24:43,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 21:24:43,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 21:24:43,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 21:24:43,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 21:24:43,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-01-23 21:24:43,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-01-23 21:24:43,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-01-23 21:24:43,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-23 21:24:43,108 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2025-01-23 21:24:43,189 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-23 21:24:43,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-23 21:24:43,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-23 21:24:43,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 09:24:43 BasicIcfg [2025-01-23 21:24:43,200 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-23 21:24:43,201 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-23 21:24:43,201 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-23 21:24:43,201 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-23 21:24:43,202 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 09:24:36" (3/4) ... [2025-01-23 21:24:43,202 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-23 21:24:43,279 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 17. [2025-01-23 21:24:43,337 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-01-23 21:24:43,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2025-01-23 21:24:43,338 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-23 21:24:43,339 INFO L158 Benchmark]: Toolchain (without parser) took 9045.42ms. Allocated memory was 83.9MB in the beginning and 427.8MB in the end (delta: 343.9MB). Free memory was 55.1MB in the beginning and 300.8MB in the end (delta: -245.7MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2025-01-23 21:24:43,340 INFO L158 Benchmark]: CDTParser took 1.70ms. Allocated memory is still 83.9MB. Free memory was 52.6MB in the beginning and 52.6MB in the end (delta: 18.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 21:24:43,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.45ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 53.5MB in the end (delta: 1.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2025-01-23 21:24:43,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.90ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 51.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 21:24:43,341 INFO L158 Benchmark]: Boogie Preprocessor took 48.58ms. Allocated memory is still 83.9MB. Free memory was 51.1MB in the beginning and 48.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 21:24:43,341 INFO L158 Benchmark]: RCFGBuilder took 1431.16ms. Allocated memory was 83.9MB in the beginning and 218.1MB in the end (delta: 134.2MB). Free memory was 48.6MB in the beginning and 130.5MB in the end (delta: -81.8MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2025-01-23 21:24:43,342 INFO L158 Benchmark]: TraceAbstraction took 6704.84ms. Allocated memory was 218.1MB in the beginning and 427.8MB in the end (delta: 209.7MB). Free memory was 129.4MB in the beginning and 316.3MB in the end (delta: -186.9MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2025-01-23 21:24:43,342 INFO L158 Benchmark]: Witness Printer took 136.89ms. Allocated memory is still 427.8MB. Free memory was 316.3MB in the beginning and 300.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-23 21:24:43,345 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.70ms. Allocated memory is still 83.9MB. Free memory was 52.6MB in the beginning and 52.6MB in the end (delta: 18.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.45ms. Allocated memory is still 83.9MB. Free memory was 54.9MB in the beginning and 53.5MB in the end (delta: 1.4MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.90ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 51.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.58ms. Allocated memory is still 83.9MB. Free memory was 51.1MB in the beginning and 48.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1431.16ms. Allocated memory was 83.9MB in the beginning and 218.1MB in the end (delta: 134.2MB). Free memory was 48.6MB in the beginning and 130.5MB in the end (delta: -81.8MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6704.84ms. Allocated memory was 218.1MB in the beginning and 427.8MB in the end (delta: 209.7MB). Free memory was 129.4MB in the beginning and 316.3MB in the end (delta: -186.9MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * Witness Printer took 136.89ms. Allocated memory is still 427.8MB. Free memory was 316.3MB in the beginning and 300.8MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1859, independent: 1378, independent conditional: 879, independent unconditional: 499, dependent: 481, dependent conditional: 461, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1477, independent: 1378, independent conditional: 879, independent unconditional: 499, dependent: 99, dependent conditional: 79, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1477, independent: 1378, independent conditional: 879, independent unconditional: 499, dependent: 99, dependent conditional: 79, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1593, independent: 1378, independent conditional: 879, independent unconditional: 499, dependent: 215, dependent conditional: 195, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1593, independent: 1378, independent conditional: 3, independent unconditional: 1375, dependent: 215, dependent conditional: 31, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1593, independent: 1378, independent conditional: 3, independent unconditional: 1375, dependent: 215, dependent conditional: 31, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 424, independent: 388, independent conditional: 2, independent unconditional: 386, dependent: 36, dependent conditional: 13, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 424, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 36, dependent conditional: 13, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 36, dependent conditional: 13, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 669, independent: 180, independent conditional: 12, independent unconditional: 168, dependent: 489, dependent conditional: 148, dependent unconditional: 341, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1593, independent: 990, independent conditional: 1, independent unconditional: 989, dependent: 179, dependent conditional: 18, dependent unconditional: 161, unknown: 424, unknown conditional: 15, unknown unconditional: 409] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 388, Positive conditional cache size: 2, Positive unconditional cache size: 386, Negative cache size: 36, Negative conditional cache size: 13, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1040, Maximal queried relation: 5, Independence queries for same thread: 382, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 133, Number of trivial persistent sets: 105, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 519, independent: 499, independent conditional: 0, independent unconditional: 499, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1859, independent: 1378, independent conditional: 879, independent unconditional: 499, dependent: 481, dependent conditional: 461, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1477, independent: 1378, independent conditional: 879, independent unconditional: 499, dependent: 99, dependent conditional: 79, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1477, independent: 1378, independent conditional: 879, independent unconditional: 499, dependent: 99, dependent conditional: 79, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1593, independent: 1378, independent conditional: 879, independent unconditional: 499, dependent: 215, dependent conditional: 195, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1593, independent: 1378, independent conditional: 3, independent unconditional: 1375, dependent: 215, dependent conditional: 31, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1593, independent: 1378, independent conditional: 3, independent unconditional: 1375, dependent: 215, dependent conditional: 31, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 424, independent: 388, independent conditional: 2, independent unconditional: 386, dependent: 36, dependent conditional: 13, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 424, independent: 368, independent conditional: 0, independent unconditional: 368, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 56, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 36, dependent conditional: 13, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 56, independent: 20, independent conditional: 2, independent unconditional: 18, dependent: 36, dependent conditional: 13, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 669, independent: 180, independent conditional: 12, independent unconditional: 168, dependent: 489, dependent conditional: 148, dependent unconditional: 341, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1593, independent: 990, independent conditional: 1, independent unconditional: 989, dependent: 179, dependent conditional: 18, dependent unconditional: 161, unknown: 424, unknown conditional: 15, unknown unconditional: 409] , Statistics on independence cache: Total cache size (in pairs): 424, Positive cache size: 388, Positive conditional cache size: 2, Positive unconditional cache size: 386, Negative cache size: 36, Negative conditional cache size: 13, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1040, Maximal queried relation: 5, Independence queries for same thread: 382 - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(arg, Pre)={0:0}, flag=0, m={3:0}, num=0, t1=-2, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-2, t2=-1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L900] 2 j++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L885] 1 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L900] 2 j++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L878] COND TRUE 1 i < 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L885] 1 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L900] 2 j++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L917] COND TRUE 0 \read(flag) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L919] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] - UnprovableResult [Line: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 914]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 55 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 489 NumberOfCodeBlocks, 487 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 65/86 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-01-23 21:24:43,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE