./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --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-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.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 a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 01:32:07,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 01:32:07,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 01:32:07,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 01:32:07,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 01:32:07,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 01:32:07,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 01:32:07,334 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 01:32:07,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 01:32:07,335 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 01:32:07,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 01:32:07,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 01:32:07,336 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 01:32:07,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 01:32:07,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 01:32:07,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 01:32:07,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 01:32:07,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 01:32:07,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 01:32:07,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 01:32:07,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 01:32:07,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 01:32:07,338 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 01:32:07,338 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 -> a650c00976061981bc34910bafee4d11d94c16289374f008af5a1f8d17e97036 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE [2025-01-23 01:32:07,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 01:32:07,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 01:32:07,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 01:32:07,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 01:32:07,588 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 01:32:07,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-23 01:32:08,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/21794d863/26db3e4937f3447abb9bf7f2074ab401/FLAGccba7e539 [2025-01-23 01:32:08,931 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 01:32:08,935 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/pthread-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-23 01:32:08,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/21794d863/26db3e4937f3447abb9bf7f2074ab401/FLAGccba7e539 [2025-01-23 01:32:09,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/21794d863/26db3e4937f3447abb9bf7f2074ab401 [2025-01-23 01:32:09,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 01:32:09,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 01:32:09,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 01:32:09,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 01:32:09,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 01:32:09,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130803ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09, skipping insertion in model container [2025-01-23 01:32:09,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 01:32:09,429 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-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2025-01-23 01:32:09,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 01:32:09,589 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 01:32:09,626 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-wmm/mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2025-01-23 01:32:09,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 01:32:09,724 INFO L204 MainTranslator]: Completed translation [2025-01-23 01:32:09,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09 WrapperNode [2025-01-23 01:32:09,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 01:32:09,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 01:32:09,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 01:32:09,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 01:32:09,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,770 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2025-01-23 01:32:09,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 01:32:09,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 01:32:09,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 01:32:09,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 01:32:09,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,795 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 01:32:09,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 01:32:09,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 01:32:09,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 01:32:09,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (1/1) ... [2025-01-23 01:32:09,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 01:32:09,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 01:32:09,827 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 01:32:09,830 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 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-23 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-23 01:32:09,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-23 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-23 01:32:09,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-23 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-23 01:32:09,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-23 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2025-01-23 01:32:09,845 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2025-01-23 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-23 01:32:09,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 01:32:09,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 01:32:09,846 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 01:32:09,928 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 01:32:09,929 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 01:32:10,160 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 01:32:10,160 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 01:32:10,302 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 01:32:10,302 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 01:32:10,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 01:32:10 BoogieIcfgContainer [2025-01-23 01:32:10,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 01:32:10,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 01:32:10,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 01:32:10,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 01:32:10,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 01:32:09" (1/3) ... [2025-01-23 01:32:10,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a4d4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 01:32:10, skipping insertion in model container [2025-01-23 01:32:10,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 01:32:09" (2/3) ... [2025-01-23 01:32:10,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a4d4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 01:32:10, skipping insertion in model container [2025-01-23 01:32:10,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 01:32:10" (3/3) ... [2025-01-23 01:32:10,310 INFO L128 eAbstractionObserver]: Analyzing ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-01-23 01:32:10,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 01:32:10,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix057_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 5 procedures, 48 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-01-23 01:32:10,323 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 01:32:10,363 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-23 01:32:10,393 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 01:32:10,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 01:32:10,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 01:32:10,396 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 01:32:10,397 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 01:32:10,453 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 01:32:10,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 01:32:10,464 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;@2fcf3261, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 01:32:10,465 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-23 01:32:17,646 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 2 more)] === [2025-01-23 01:32:17,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 01:32:17,649 INFO L85 PathProgramCache]: Analyzing trace with hash 382788686, now seen corresponding path program 1 times [2025-01-23 01:32:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 01:32:17,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861203654] [2025-01-23 01:32:17,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 01:32:17,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 01:32:17,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-23 01:32:17,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-23 01:32:17,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 01:32:17,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 01:32:18,804 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 01:32:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 01:32:18,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861203654] [2025-01-23 01:32:18,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861203654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 01:32:18,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 01:32:18,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-23 01:32:18,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953633222] [2025-01-23 01:32:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 01:32:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-23 01:32:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 01:32:18,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-23 01:32:18,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-23 01:32:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:18,823 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 01:32:18,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 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 01:32:18,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:21,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 01:32:21,527 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 2 more)] === [2025-01-23 01:32:21,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 01:32:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1014400111, now seen corresponding path program 1 times [2025-01-23 01:32:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 01:32:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469411979] [2025-01-23 01:32:21,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 01:32:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 01:32:21,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-23 01:32:21,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-23 01:32:21,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 01:32:21,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 01:32:21,717 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 01:32:21,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 01:32:21,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469411979] [2025-01-23 01:32:21,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469411979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 01:32:21,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 01:32:21,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 01:32:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101740663] [2025-01-23 01:32:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 01:32:21,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-23 01:32:21,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 01:32:21,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-23 01:32:21,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-23 01:32:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:21,720 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 01:32:21,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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 01:32:21,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:21,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 01:32:21,813 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 2 more)] === [2025-01-23 01:32:21,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 01:32:21,813 INFO L85 PathProgramCache]: Analyzing trace with hash 787066445, now seen corresponding path program 1 times [2025-01-23 01:32:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 01:32:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403960949] [2025-01-23 01:32:21,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 01:32:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 01:32:21,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-23 01:32:21,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-23 01:32:21,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 01:32:21,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 01:32:22,229 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 01:32:22,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 01:32:22,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403960949] [2025-01-23 01:32:22,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403960949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 01:32:22,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 01:32:22,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-23 01:32:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835535597] [2025-01-23 01:32:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 01:32:22,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-23 01:32:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 01:32:22,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-23 01:32:22,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-23 01:32:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:22,231 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 01:32:22,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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 01:32:22,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:22,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:22,231 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:25,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 01:32:25,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 01:32:25,227 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 2 more)] === [2025-01-23 01:32:25,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 01:32:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2090237829, now seen corresponding path program 2 times [2025-01-23 01:32:25,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 01:32:25,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442931130] [2025-01-23 01:32:25,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-23 01:32:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 01:32:25,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 1 equivalence classes. [2025-01-23 01:32:25,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-23 01:32:25,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-23 01:32:25,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 01:32:25,376 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 01:32:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 01:32:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442931130] [2025-01-23 01:32:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442931130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 01:32:25,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 01:32:25,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-23 01:32:25,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503001764] [2025-01-23 01:32:25,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 01:32:25,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-23 01:32:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 01:32:25,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-23 01:32:25,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-23 01:32:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:25,378 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 01:32:25,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 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 01:32:25,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:25,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:25,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 01:32:25,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 01:32:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 01:32:25,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 01:32:25,899 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 2 more)] === [2025-01-23 01:32:25,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 01:32:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1252404961, now seen corresponding path program 3 times [2025-01-23 01:32:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 01:32:25,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201735002] [2025-01-23 01:32:25,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-23 01:32:25,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 01:32:25,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 1 equivalence classes. [2025-01-23 01:32:25,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-23 01:32:25,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-23 01:32:25,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 01:32:26,565 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 01:32:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 01:32:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201735002] [2025-01-23 01:32:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201735002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 01:32:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 01:32:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-23 01:32:26,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776502859] [2025-01-23 01:32:26,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 01:32:26,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-23 01:32:26,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 01:32:26,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-23 01:32:26,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-23 01:32:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:26,567 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 01:32:26,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 8 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 01:32:26,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:26,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:26,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-23 01:32:26,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-01-23 01:32:26,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 01:32:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:27,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-23 01:32:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-23 01:32:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-23 01:32:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-23 01:32:27,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 01:32:27,091 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 2 more)] === [2025-01-23 01:32:27,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 01:32:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1903991121, now seen corresponding path program 4 times [2025-01-23 01:32:27,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 01:32:27,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118758693] [2025-01-23 01:32:27,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-23 01:32:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 01:32:27,099 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-01-23 01:32:27,139 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-23 01:32:27,140 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-23 01:32:27,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 01:32:27,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 01:32:27,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-23 01:32:27,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-23 01:32:27,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 01:32:27,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 01:32:27,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 01:32:27,213 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 01:32:27,213 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-01-23 01:32:27,214 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-01-23 01:32:27,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-01-23 01:32:27,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-01-23 01:32:27,215 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-01-23 01:32:27,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 01:32:27,218 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2025-01-23 01:32:27,219 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2025-01-23 01:32:27,303 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-23 01:32:27,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-23 01:32:27,313 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 01:32:27,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 01:32:27 BasicIcfg [2025-01-23 01:32:27,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-23 01:32:27,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-23 01:32:27,314 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-23 01:32:27,314 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-23 01:32:27,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 01:32:10" (3/4) ... [2025-01-23 01:32:27,315 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-23 01:32:27,385 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-01-23 01:32:27,416 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-01-23 01:32:27,416 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2025-01-23 01:32:27,416 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-23 01:32:27,417 INFO L158 Benchmark]: Toolchain (without parser) took 18141.12ms. Allocated memory was 117.4MB in the beginning and 645.9MB in the end (delta: 528.5MB). Free memory was 90.2MB in the beginning and 473.1MB in the end (delta: -382.9MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. [2025-01-23 01:32:27,417 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 34.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 01:32:27,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.13ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 65.1MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-23 01:32:27,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.11ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 62.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 01:32:27,418 INFO L158 Benchmark]: Boogie Preprocessor took 25.19ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 61.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-23 01:32:27,418 INFO L158 Benchmark]: RCFGBuilder took 504.08ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 64.0MB in the end (delta: -3.0MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-01-23 01:32:27,418 INFO L158 Benchmark]: TraceAbstraction took 17009.04ms. Allocated memory was 117.4MB in the beginning and 645.9MB in the end (delta: 528.5MB). Free memory was 63.3MB in the beginning and 493.3MB in the end (delta: -430.0MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2025-01-23 01:32:27,418 INFO L158 Benchmark]: Witness Printer took 102.26ms. Allocated memory is still 645.9MB. Free memory was 493.3MB in the beginning and 473.1MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-23 01:32:27,419 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.69ms. Allocated memory is still 83.9MB. Free memory was 61.5MB in the beginning and 61.4MB in the end (delta: 34.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.13ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 65.1MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.11ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 62.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.19ms. Allocated memory is still 117.4MB. Free memory was 62.8MB in the beginning and 61.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 504.08ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 64.0MB in the end (delta: -3.0MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17009.04ms. Allocated memory was 117.4MB in the beginning and 645.9MB in the end (delta: 528.5MB). Free memory was 63.3MB in the beginning and 493.3MB in the end (delta: -430.0MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * Witness Printer took 102.26ms. Allocated memory is still 645.9MB. Free memory was 493.3MB in the beginning and 473.1MB in the end (delta: 20.2MB). 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: 133012, independent: 126238, independent conditional: 125129, independent unconditional: 1109, dependent: 6774, dependent conditional: 6741, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132843, independent: 126238, independent conditional: 0, independent unconditional: 126238, dependent: 6605, dependent conditional: 0, dependent unconditional: 6605, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1143, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1143, independent: 1094, independent conditional: 0, independent unconditional: 1094, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 49, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11869, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 11745, dependent conditional: 0, dependent unconditional: 11745, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 132843, independent: 125129, independent conditional: 0, independent unconditional: 125129, dependent: 6571, dependent conditional: 0, dependent unconditional: 6571, unknown: 1143, unknown conditional: 0, unknown unconditional: 1143] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1109, Positive conditional cache size: 0, Positive unconditional cache size: 1109, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 169, Persistent sets #1 benchmarks: Persistent set computation time: 11.9s, Number of persistent set computation: 4289, Number of trivial persistent sets: 2076, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 133012, independent: 126238, independent conditional: 125129, independent unconditional: 1109, dependent: 6774, dependent conditional: 6741, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 132843, independent: 126238, independent conditional: 0, independent unconditional: 126238, dependent: 6605, dependent conditional: 0, dependent unconditional: 6605, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1143, independent: 1109, independent conditional: 0, independent unconditional: 1109, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1143, independent: 1094, independent conditional: 0, independent unconditional: 1094, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 49, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11869, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 11745, dependent conditional: 0, dependent unconditional: 11745, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 132843, independent: 125129, independent conditional: 0, independent unconditional: 125129, dependent: 6571, dependent conditional: 0, dependent unconditional: 6571, unknown: 1143, unknown conditional: 0, unknown unconditional: 1143] , Statistics on independence cache: Total cache size (in pairs): 1143, Positive cache size: 1109, Positive conditional cache size: 0, Positive unconditional cache size: 1109, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 169 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1517; [L835] FCALL, FORK 0 pthread_create(&t1517, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 0 pthread_t t1518; [L837] FCALL, FORK 0 pthread_create(&t1518, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-1, t1518=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t1519; [L839] FCALL, FORK 0 pthread_create(&t1519, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t1520; [L841] FCALL, FORK 0 pthread_create(&t1520, ((void *)0), P3, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, t1520=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L800] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L800] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 4 __unbuffered_p3_EAX = a VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L746] 1 a = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 2 x = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 return 0; [L776] 3 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 3 return 0; [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L821] 4 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, t1520=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, t1520=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1517=-1, t1518=0, t1519=1, t1520=2, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 841]: 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: 839]: 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: 837]: 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: 835]: 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 9 procedures, 81 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 14.0s, 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: 34, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 1248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-23 01:32:27,433 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