./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 163a010c Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.atomic-types2-163a010-m [2024-10-31 11:27:46,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 11:27:46,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-31 11:27:46,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 11:27:46,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 11:27:46,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 11:27:46,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 11:27:46,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 11:27:46,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 11:27:46,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 11:27:46,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 11:27:46,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 11:27:46,595 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 11:27:46,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 11:27:46,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 11:27:46,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 11:27:46,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 11:27:46,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 11:27:46,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 11:27:46,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 11:27:46,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 11:27:46,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 11:27:46,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 11:27:46,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 11:27:46,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 11:27:46,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 11:27:46,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 11:27:46,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 11:27:46,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 11:27:46,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 11:27:46,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-31 11:27:46,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 11:27:46,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 11:27:46,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 11:27:46,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 11:27:46,606 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-31 11:27:46,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 11:27:46,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 11:27:46,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-31 11:27:46,608 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-31 11:27:46,608 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-31 11:27:46,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a [2024-10-31 11:27:46,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 11:27:46,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 11:27:46,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 11:27:46,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 11:27:46,872 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 11:27:46,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-10-31 11:27:48,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 11:27:48,481 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 11:27:48,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-10-31 11:27:48,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/70073e109/ab9a98121506401fac2d657072cba64b/FLAG5f6f03374 [2024-10-31 11:27:48,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/70073e109/ab9a98121506401fac2d657072cba64b [2024-10-31 11:27:48,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 11:27:48,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 11:27:48,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 11:27:48,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 11:27:48,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 11:27:48,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7924ed98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48, skipping insertion in model container [2024-10-31 11:27:48,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 11:27:48,791 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c[3922,3935] [2024-10-31 11:27:48,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 11:27:48,812 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 11:27:48,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c[3922,3935] [2024-10-31 11:27:48,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 11:27:48,873 INFO L204 MainTranslator]: Completed translation [2024-10-31 11:27:48,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48 WrapperNode [2024-10-31 11:27:48,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 11:27:48,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 11:27:48,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 11:27:48,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 11:27:48,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,935 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 227 [2024-10-31 11:27:48,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 11:27:48,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 11:27:48,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 11:27:48,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 11:27:48,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:48,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 11:27:48,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 11:27:48,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 11:27:48,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 11:27:48,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (1/1) ... [2024-10-31 11:27:49,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-31 11:27:49,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-31 11:27:49,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-31 11:27:49,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-31 11:27:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 11:27:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 11:27:49,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 11:27:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 11:27:49,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 11:27:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 11:27:49,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 11:27:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-31 11:27:49,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-31 11:27:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 11:27:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-10-31 11:27:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-10-31 11:27:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-10-31 11:27:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-10-31 11:27:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 11:27:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 11:27:49,103 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 11:27:49,250 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 11:27:49,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 11:27:49,706 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 11:27:49,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 11:27:49,894 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 11:27:49,894 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-31 11:27:49,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 11:27:49 BoogieIcfgContainer [2024-10-31 11:27:49,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 11:27:49,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 11:27:49,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 11:27:49,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 11:27:49,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 11:27:48" (1/3) ... [2024-10-31 11:27:49,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0b70dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 11:27:49, skipping insertion in model container [2024-10-31 11:27:49,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 11:27:48" (2/3) ... [2024-10-31 11:27:49,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0b70dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 11:27:49, skipping insertion in model container [2024-10-31 11:27:49,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 11:27:49" (3/3) ... [2024-10-31 11:27:49,904 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2024-10-31 11:27:49,922 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 11:27:49,923 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 11:27:49,923 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 11:27:50,011 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-10-31 11:27:50,079 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 11:27:50,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-31 11:27:50,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-31 11:27:50,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-31 11:27:50,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-31 11:27:50,117 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-31 11:27:50,130 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2024-10-31 11:27:50,137 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;@b107e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 11:27:50,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-31 11:27:52,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-31 11:27:52,504 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-10-31 11:27:52,512 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-10-31 11:27:52,515 INFO L317 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2024-10-31 11:27:52,523 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 11:27:52,524 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-31 11:27:52,524 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Thread1of1ForFork1 ======== [2024-10-31 11:27:52,527 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;@b107e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 11:27:52,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-31 11:27:52,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-31 11:27:52,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-10-31 11:27:52,617 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-10-31 11:27:52,617 INFO L317 ceAbstractionStarter]: Result for error location thread1Thread1of1ForFork1 was SAFE,SAFE (2/3) [2024-10-31 11:27:52,621 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 11:27:52,622 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-31 11:27:52,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-31 11:27:52,623 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;@b107e65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 11:27:52,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-31 11:27:52,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-31 11:27:52,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 11:27:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash 977037292, now seen corresponding path program 1 times [2024-10-31 11:27:52,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 11:27:52,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146171249] [2024-10-31 11:27:52,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 11:27:52,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 11:27:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 11:27:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 11:27:52,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 11:27:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146171249] [2024-10-31 11:27:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146171249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 11:27:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 11:27:52,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 11:27:52,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804264291] [2024-10-31 11:27:52,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 11:27:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 11:27:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 11:27:52,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 11:27:52,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 11:27:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:52,989 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-31 11:27:52,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 11:27:52,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 11:27:53,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-31 11:27:53,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 11:27:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash -609680778, now seen corresponding path program 1 times [2024-10-31 11:27:53,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 11:27:53,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364639427] [2024-10-31 11:27:53,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 11:27:53,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 11:27:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 11:27:53,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 11:27:53,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 11:27:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364639427] [2024-10-31 11:27:53,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364639427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 11:27:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 11:27:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 11:27:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789018770] [2024-10-31 11:27:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 11:27:53,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 11:27:53,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 11:27:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 11:27:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 11:27:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,490 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-31 11:27:53,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 11:27:53,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,491 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:53,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 11:27:53,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-31 11:27:53,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 11:27:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1611002948, now seen corresponding path program 1 times [2024-10-31 11:27:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 11:27:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229238939] [2024-10-31 11:27:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 11:27:53,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 11:27:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 11:27:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 11:27:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 11:27:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229238939] [2024-10-31 11:27:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229238939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 11:27:53,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 11:27:53,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 11:27:53,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492543952] [2024-10-31 11:27:53,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 11:27:53,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 11:27:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 11:27:53,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 11:27:53,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 11:27:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,754 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-31 11:27:53,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 11:27:53,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:53,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:53,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:53,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 11:27:53,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-31 11:27:53,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 11:27:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1428626902, now seen corresponding path program 1 times [2024-10-31 11:27:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 11:27:53,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296752895] [2024-10-31 11:27:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 11:27:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 11:27:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 11:27:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 11:27:54,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 11:27:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296752895] [2024-10-31 11:27:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296752895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 11:27:54,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 11:27:54,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 11:27:54,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582459770] [2024-10-31 11:27:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 11:27:54,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 11:27:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 11:27:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 11:27:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 11:27:54,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:54,055 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-31 11:27:54,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 11:27:54,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:54,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:54,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:54,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 11:27:54,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-31 11:27:54,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 11:27:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash 359051778, now seen corresponding path program 1 times [2024-10-31 11:27:54,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 11:27:54,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783555041] [2024-10-31 11:27:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 11:27:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 11:27:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 11:27:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 11:27:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 11:27:54,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783555041] [2024-10-31 11:27:54,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783555041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 11:27:54,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 11:27:54,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 11:27:54,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522257234] [2024-10-31 11:27:54,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 11:27:54,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 11:27:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 11:27:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 11:27:54,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 11:27:54,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:54,502 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-31 11:27:54,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 11:27:54,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:54,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 11:27:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 11:27:54,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 11:27:54,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-31 11:27:54,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 11:27:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1833662850, now seen corresponding path program 2 times [2024-10-31 11:27:54,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 11:27:54,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259618924] [2024-10-31 11:27:54,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 11:27:54,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 11:27:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 11:27:54,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 11:27:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 11:27:54,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 11:27:54,831 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 11:27:54,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-31 11:27:54,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-31 11:27:54,832 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-31 11:27:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 11:27:54,834 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-10-31 11:27:54,834 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (3/3) [2024-10-31 11:27:54,980 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 11:27:54,980 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 11:27:55,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-10-31 11:27:55,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 11:27:55 BasicIcfg [2024-10-31 11:27:55,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 11:27:55,003 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 11:27:55,003 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 11:27:55,003 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 11:27:55,004 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 11:27:49" (3/4) ... [2024-10-31 11:27:55,005 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 11:27:55,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-31 11:27:55,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 11:27:55,133 INFO L158 Benchmark]: Toolchain (without parser) took 6615.69ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 98.2MB in the beginning and 121.7MB in the end (delta: -23.5MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2024-10-31 11:27:55,133 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 11:27:55,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.41ms. Allocated memory is still 153.1MB. Free memory was 98.2MB in the beginning and 84.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 11:27:55,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.94ms. Allocated memory is still 153.1MB. Free memory was 83.8MB in the beginning and 81.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 11:27:55,134 INFO L158 Benchmark]: Boogie Preprocessor took 51.72ms. Allocated memory is still 153.1MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 11:27:55,134 INFO L158 Benchmark]: RCFGBuilder took 905.44ms. Allocated memory was 153.1MB in the beginning and 195.0MB in the end (delta: 41.9MB). Free memory was 79.7MB in the beginning and 139.7MB in the end (delta: -60.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-10-31 11:27:55,134 INFO L158 Benchmark]: TraceAbstraction took 5105.40ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 138.6MB in the beginning and 153.6MB in the end (delta: -15.0MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-10-31 11:27:55,134 INFO L158 Benchmark]: Witness Printer took 129.27ms. Allocated memory is still 234.9MB. Free memory was 153.6MB in the beginning and 121.7MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-31 11:27:55,137 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.21ms. Allocated memory is still 153.1MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.41ms. Allocated memory is still 153.1MB. Free memory was 98.2MB in the beginning and 84.2MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.94ms. Allocated memory is still 153.1MB. Free memory was 83.8MB in the beginning and 81.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.72ms. Allocated memory is still 153.1MB. Free memory was 81.8MB in the beginning and 80.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 905.44ms. Allocated memory was 153.1MB in the beginning and 195.0MB in the end (delta: 41.9MB). Free memory was 79.7MB in the beginning and 139.7MB in the end (delta: -60.0MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5105.40ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 138.6MB in the beginning and 153.6MB in the end (delta: -15.0MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Witness Printer took 129.27ms. Allocated memory is still 234.9MB. Free memory was 153.6MB in the beginning and 121.7MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. 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: 10789, independent: 10192, independent conditional: 5241, independent unconditional: 4951, dependent: 597, dependent conditional: 543, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 5241, independent unconditional: 4951, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 5241, independent unconditional: 4951, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 5241, independent unconditional: 4951, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 0, independent unconditional: 10192, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 0, independent unconditional: 10192, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4797, independent: 4743, independent conditional: 0, independent unconditional: 4743, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4797, independent: 4734, independent conditional: 0, independent unconditional: 4734, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1935, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 1541, dependent conditional: 0, dependent unconditional: 1541, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10261, independent: 5449, independent conditional: 0, independent unconditional: 5449, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4797, unknown conditional: 0, unknown unconditional: 4797] , Statistics on independence cache: Total cache size (in pairs): 4797, Positive cache size: 4743, Positive conditional cache size: 0, Positive unconditional cache size: 4743, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5256, Maximal queried relation: 0, Independence queries for same thread: 528, Persistent sets #1 benchmarks: Persistent set computation time: 2.1s, Number of persistent set computation: 437, Number of trivial persistent sets: 36, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5005, independent: 4951, independent conditional: 0, independent unconditional: 4951, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10789, independent: 10192, independent conditional: 5241, independent unconditional: 4951, dependent: 597, dependent conditional: 543, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 5241, independent unconditional: 4951, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 5241, independent unconditional: 4951, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 5241, independent unconditional: 4951, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 0, independent unconditional: 10192, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10261, independent: 10192, independent conditional: 0, independent unconditional: 10192, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4797, independent: 4743, independent conditional: 0, independent unconditional: 4743, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4797, independent: 4734, independent conditional: 0, independent unconditional: 4734, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1935, independent: 394, independent conditional: 0, independent unconditional: 394, dependent: 1541, dependent conditional: 0, dependent unconditional: 1541, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 10261, independent: 5449, independent conditional: 0, independent unconditional: 5449, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4797, unknown conditional: 0, unknown unconditional: 4797] , Statistics on independence cache: Total cache size (in pairs): 4797, Positive cache size: 4743, Positive conditional cache size: 0, Positive unconditional cache size: 4743, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5256, Maximal queried relation: 0, Independence queries for same thread: 528 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6737, independent: 6466, independent conditional: 1766, independent unconditional: 4700, dependent: 271, dependent conditional: 217, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 1766, independent unconditional: 4700, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 1766, independent unconditional: 4700, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 1766, independent unconditional: 4700, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 0, independent unconditional: 6466, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 0, independent unconditional: 6466, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6535, independent: 6183, independent conditional: 0, independent unconditional: 6183, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 283, unknown conditional: 0, unknown unconditional: 283] , Statistics on independence cache: Total cache size (in pairs): 5080, Positive cache size: 5026, Positive conditional cache size: 0, Positive unconditional cache size: 5026, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1781, Maximal queried relation: 0, Independence queries for same thread: 202, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 156, Number of trivial persistent sets: 22, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4754, independent: 4700, independent conditional: 0, independent unconditional: 4700, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6737, independent: 6466, independent conditional: 1766, independent unconditional: 4700, dependent: 271, dependent conditional: 217, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 1766, independent unconditional: 4700, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 1766, independent unconditional: 4700, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 1766, independent unconditional: 4700, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 0, independent unconditional: 6466, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6535, independent: 6466, independent conditional: 0, independent unconditional: 6466, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 283, independent: 283, independent conditional: 0, independent unconditional: 283, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6535, independent: 6183, independent conditional: 0, independent unconditional: 6183, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 283, unknown conditional: 0, unknown unconditional: 283] , Statistics on independence cache: Total cache size (in pairs): 5080, Positive cache size: 5026, Positive conditional cache size: 0, Positive unconditional cache size: 5026, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1781, Maximal queried relation: 0, Independence queries for same thread: 202 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8042, independent: 7497, independent conditional: 1640, independent unconditional: 5857, dependent: 545, dependent conditional: 494, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7568, independent: 7497, independent conditional: 1640, independent unconditional: 5857, dependent: 71, dependent conditional: 20, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7568, independent: 7497, independent conditional: 1640, independent unconditional: 5857, dependent: 71, dependent conditional: 20, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7593, independent: 7497, independent conditional: 1640, independent unconditional: 5857, dependent: 96, dependent conditional: 45, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7593, independent: 7497, independent conditional: 1, independent unconditional: 7496, dependent: 96, dependent conditional: 8, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7593, independent: 7497, independent conditional: 1, independent unconditional: 7496, dependent: 96, dependent conditional: 8, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1381, independent: 1366, independent conditional: 1, independent unconditional: 1365, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1381, independent: 1359, independent conditional: 0, independent unconditional: 1359, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 51, independent conditional: 13, independent unconditional: 38, dependent: 177, dependent conditional: 30, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7593, independent: 6131, independent conditional: 0, independent unconditional: 6131, dependent: 81, dependent conditional: 4, dependent unconditional: 77, unknown: 1381, unknown conditional: 5, unknown unconditional: 1376] , Statistics on independence cache: Total cache size (in pairs): 6461, Positive cache size: 6392, Positive conditional cache size: 1, Positive unconditional cache size: 6391, Negative cache size: 69, Negative conditional cache size: 4, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1676, Maximal queried relation: 2, Independence queries for same thread: 474, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 139, Number of trivial persistent sets: 132, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5908, independent: 5857, independent conditional: 0, independent unconditional: 5857, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8042, independent: 7497, independent conditional: 1640, independent unconditional: 5857, dependent: 545, dependent conditional: 494, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7568, independent: 7497, independent conditional: 1640, independent unconditional: 5857, dependent: 71, dependent conditional: 20, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7568, independent: 7497, independent conditional: 1640, independent unconditional: 5857, dependent: 71, dependent conditional: 20, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7593, independent: 7497, independent conditional: 1640, independent unconditional: 5857, dependent: 96, dependent conditional: 45, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7593, independent: 7497, independent conditional: 1, independent unconditional: 7496, dependent: 96, dependent conditional: 8, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7593, independent: 7497, independent conditional: 1, independent unconditional: 7496, dependent: 96, dependent conditional: 8, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1381, independent: 1366, independent conditional: 1, independent unconditional: 1365, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1381, independent: 1359, independent conditional: 0, independent unconditional: 1359, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 15, dependent conditional: 4, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 229, independent: 51, independent conditional: 13, independent unconditional: 38, dependent: 177, dependent conditional: 30, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7593, independent: 6131, independent conditional: 0, independent unconditional: 6131, dependent: 81, dependent conditional: 4, dependent unconditional: 77, unknown: 1381, unknown conditional: 5, unknown unconditional: 1376] , Statistics on independence cache: Total cache size (in pairs): 6461, Positive cache size: 6392, Positive conditional cache size: 1, Positive unconditional cache size: 6391, Negative cache size: 69, Negative conditional cache size: 4, Negative unconditional cache size: 65, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1676, Maximal queried relation: 2, Independence queries for same thread: 474 - CounterExampleResult [Line: 171]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] 0 _Atomic unsigned int x_0, y_1, x_8, y_9; [L37] 0 _Atomic _Bool f1_2, f2_3, f1_10, f2_11; [L38] 0 unsigned int temp_4, temp_5, temp_6, temp_7, temp_12, temp_13, temp_14, temp_15; [L142] 0 pthread_t t1, t4; [L145] 0 x_0 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=4294967299, x_8=0, y_1=0, y_9=0] [L146] 0 y_1 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=4294967299, x_8=0, y_1=-4294967292, y_9=0] [L147] 0 x_8 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=0] [L148] 0 y_9 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L149] 0 temp_4 = __VERIFIER_nondet_uint() [L150] 0 temp_5 = __VERIFIER_nondet_uint() [L151] 0 temp_6 = __VERIFIER_nondet_uint() [L152] 0 temp_7 = __VERIFIER_nondet_uint() [L153] 0 temp_12 = __VERIFIER_nondet_uint() [L154] 0 temp_13 = __VERIFIER_nondet_uint() [L155] 0 temp_14 = __VERIFIER_nondet_uint() [L156] 0 temp_15 = __VERIFIER_nondet_uint() [L157] 0 f1_2 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=1, f2_11=0, f2_3=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L158] 0 f2_3 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=1, f2_11=0, f2_3=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L159] 0 f1_10 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=1, f2_11=0, f2_3=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L160] 0 f2_11 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=1, f2_11=0, f2_3=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L163] CALL 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L33] COND FALSE 0 !(!cond) [L163] RET 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L165] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(_argptr)={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, t1=-5, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L78] 1 pthread_t t2, t3; VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=0, f1_2=1, f2_11=0, f2_3=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L80] 1 f1_2 = 0 VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L81] 1 f2_3 = 0 VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L83] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L84] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L166] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L128] 4 pthread_t t5, t6; VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L130] 4 f1_10 = 0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L131] 4 f2_11 = 0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L133] FCALL, FORK 4 pthread_create(&t5, 0, thread5, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L134] FCALL, FORK 4 pthread_create(&t6, 0, thread6, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L42] COND FALSE 2 !(__VERIFIER_nondet_bool()) [L56] 2 return 0; [L85] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L60] COND FALSE 3 !(__VERIFIER_nondet_bool()) [L74] 3 return 0; [L86] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L88] 1 return 0; [L167] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L92] COND TRUE 5 __VERIFIER_nondet_bool() [L93] 5 temp_12 = x_8 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, x_0=4294967299, x_8=3, y_1=-4294967292, y_9=4] [L94] 5 x_8 = temp_12 + 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=4] [L96] 5 f1_10 = 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=4] [L110] COND TRUE 6 __VERIFIER_nondet_bool() [L111] 6 temp_14 = y_9 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_14=4, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=4] [L112] 6 y_9 = temp_14 + 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_14=4, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=5] [L114] 6 f2_11 = 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_14=4, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=5] [L97] CALL 5 assume_abort_if_not(f2_11) [L33] COND FALSE 5 !(!cond) [L97] RET 5 assume_abort_if_not(f2_11) [L99] 5 temp_13 = y_9 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=5] [L100] 5 y_9 = temp_13 + 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=6] [L115] CALL 6 assume_abort_if_not(f1_10) [L33] COND FALSE 6 !(!cond) [L115] RET 6 assume_abort_if_not(f1_10) [L117] 6 temp_15 = x_8 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=6] [L102] 5 f1_10 = 0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=4294967299, x_8=4, y_1=-4294967292, y_9=6] [L118] 6 x_8 = temp_15 + 1 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=4294967299, x_8=5, y_1=-4294967292, y_9=6] [L120] 6 f2_11 = 0 VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=4294967299, x_8=5, y_1=-4294967292, y_9=6] [L103] CALL 5 assume_abort_if_not(!f2_11) [L33] COND FALSE 5 !(!cond) [L103] RET 5 assume_abort_if_not(!f2_11) [L121] CALL 6 assume_abort_if_not(!f1_10) [L33] COND FALSE 6 !(!cond) [L121] RET 6 assume_abort_if_not(!f1_10) [L92] COND FALSE 5 !(__VERIFIER_nondet_bool()) [L106] 5 return 0; [L135] FCALL, JOIN 5 pthread_join(t5, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=4294967299, x_8=5, y_1=-4294967292, y_9=6] [L110] COND FALSE 6 !(__VERIFIER_nondet_bool()) [L124] 6 return 0; [L136] FCALL, JOIN 6 pthread_join(t6, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=4294967299, x_8=5, y_1=-4294967292, y_9=6] [L138] 4 return 0; [L168] FCALL, JOIN 4 pthread_join(t4, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=4294967299, x_8=5, y_1=-4294967292, y_9=6] [L170] CALL 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L33] COND FALSE 0 !(!cond) [L170] RET 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L171] 0 reach_error() VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, t5=-1, t6=0, temp_12=3, temp_13=5, temp_14=4, temp_15=4, x_0=4294967299, x_8=5, y_1=-4294967292, y_9=6] - UnprovableResult [Line: 165]: 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: 166]: 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: thread4Thread1of1ForFork3 with 1 thread instances CFG has 13 procedures, 173 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 2.4s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread1Thread1of1ForFork1 with 1 thread instances CFG has 13 procedures, 173 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 173 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.9s, 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: 14, 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.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 338 ConstructedInterpolants, 0 QuantifiedInterpolants, 1044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 8/8 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-31 11:27:55,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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