./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 b03bd7cf 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 a690a19e2d41bbc14b3960c21812e80405a4291ef4154c7125f66fa1ebbf9c8f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-b03bd7c-m [2024-10-28 19:33:24,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-28 19:33:24,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-28 19:33:24,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-28 19:33:24,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-28 19:33:24,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-28 19:33:24,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-28 19:33:24,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-28 19:33:24,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-28 19:33:24,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-28 19:33:24,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-28 19:33:24,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-28 19:33:24,621 INFO L153 SettingsManager]: * Use SBE=true [2024-10-28 19:33:24,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-28 19:33:24,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-28 19:33:24,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-28 19:33:24,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-28 19:33:24,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-28 19:33:24,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-28 19:33:24,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-28 19:33:24,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-28 19:33:24,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-28 19:33:24,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-28 19:33:24,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-28 19:33:24,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-28 19:33:24,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-28 19:33:24,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-28 19:33:24,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-28 19:33:24,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-28 19:33:24,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-28 19:33:24,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 19:33:24,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-28 19:33:24,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-28 19:33:24,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-28 19:33:24,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-28 19:33:24,632 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-28 19:33:24,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-28 19:33:24,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-28 19:33:24,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-28 19:33:24,633 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-28 19:33:24,633 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-28 19:33:24,633 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 -> a690a19e2d41bbc14b3960c21812e80405a4291ef4154c7125f66fa1ebbf9c8f [2024-10-28 19:33:24,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-28 19:33:24,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-28 19:33:24,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-28 19:33:24,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-28 19:33:24,905 INFO L274 PluginConnector]: CDTParser initialized [2024-10-28 19:33:24,906 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-28 19:33:26,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-28 19:33:26,474 INFO L384 CDTParser]: Found 1 translation units. [2024-10-28 19:33:26,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-10-28 19:33:26,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d45c1f573/d1622c72fc3b463ca2f5518ced11270d/FLAG83c735680 [2024-10-28 19:33:26,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d45c1f573/d1622c72fc3b463ca2f5518ced11270d [2024-10-28 19:33:26,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-28 19:33:26,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-28 19:33:26,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-28 19:33:26,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-28 19:33:26,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-28 19:33:26,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 07:33:26" (1/1) ... [2024-10-28 19:33:26,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e16ac4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:26, skipping insertion in model container [2024-10-28 19:33:26,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 07:33:26" (1/1) ... [2024-10-28 19:33:26,890 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-28 19:33:27,096 WARN L251 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[6016,6029] [2024-10-28 19:33:27,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 19:33:27,118 INFO L200 MainTranslator]: Completed pre-run [2024-10-28 19:33:27,155 WARN L251 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[6016,6029] [2024-10-28 19:33:27,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 19:33:27,181 INFO L204 MainTranslator]: Completed translation [2024-10-28 19:33:27,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27 WrapperNode [2024-10-28 19:33:27,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-28 19:33:27,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-28 19:33:27,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-28 19:33:27,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-28 19:33:27,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,228 INFO L138 Inliner]: procedures = 24, calls = 90, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 267 [2024-10-28 19:33:27,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-28 19:33:27,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-28 19:33:27,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-28 19:33:27,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-28 19:33:27,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-28 19:33:27,266 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-28 19:33:27,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-28 19:33:27,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-28 19:33:27,267 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (1/1) ... [2024-10-28 19:33:27,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 19:33:27,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:33:27,291 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-28 19:33:27,293 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-28 19:33:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-28 19:33:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-28 19:33:27,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-28 19:33:27,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-28 19:33:27,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-28 19:33:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-28 19:33:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-28 19:33:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-28 19:33:27,332 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-28 19:33:27,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-28 19:33:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-10-28 19:33:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-10-28 19:33:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-10-28 19:33:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-10-28 19:33:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-28 19:33:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-28 19:33:27,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-28 19:33:27,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-28 19:33:27,335 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-28 19:33:27,433 INFO L238 CfgBuilder]: Building ICFG [2024-10-28 19:33:27,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-28 19:33:27,740 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-28 19:33:27,740 INFO L287 CfgBuilder]: Performing block encoding [2024-10-28 19:33:28,004 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-28 19:33:28,004 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-28 19:33:28,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 07:33:28 BoogieIcfgContainer [2024-10-28 19:33:28,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-28 19:33:28,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-28 19:33:28,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-28 19:33:28,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-28 19:33:28,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 07:33:26" (1/3) ... [2024-10-28 19:33:28,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d15a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 07:33:28, skipping insertion in model container [2024-10-28 19:33:28,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 07:33:27" (2/3) ... [2024-10-28 19:33:28,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d15a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 07:33:28, skipping insertion in model container [2024-10-28 19:33:28,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 07:33:28" (3/3) ... [2024-10-28 19:33:28,013 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2024-10-28 19:33:28,028 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-28 19:33:28,028 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-28 19:33:28,028 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-28 19:33:28,105 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-10-28 19:33:28,159 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 19:33:28,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-28 19:33:28,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 19:33:28,162 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-28 19:33:28,164 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-28 19:33:28,191 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 19:33:28,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork3 ======== [2024-10-28 19:33:28,212 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;@20d7a07c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 19:33:28,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 19:33:30,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 19:33:30,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork3Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-10-28 19:33:30,231 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-10-28 19:33:30,233 INFO L317 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE,SAFE (1/3) [2024-10-28 19:33:30,237 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 19:33:30,238 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 19:33:30,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Thread1of1ForFork1 ======== [2024-10-28 19:33:30,239 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;@20d7a07c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 19:33:30,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-28 19:33:30,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-28 19:33:30,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2024-10-28 19:33:30,308 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-10-28 19:33:30,309 INFO L317 ceAbstractionStarter]: Result for error location thread1Thread1of1ForFork1 was SAFE,SAFE (2/3) [2024-10-28 19:33:30,313 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 19:33:30,316 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 19:33:30,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 19:33:30,317 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;@20d7a07c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 19:33:30,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-28 19:33:30,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:33:30,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:33:30,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1944978665, now seen corresponding path program 1 times [2024-10-28 19:33:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:33:30,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994961626] [2024-10-28 19:33:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:33:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:33:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:33:30,587 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-28 19:33:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:33:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994961626] [2024-10-28 19:33:30,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994961626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 19:33:30,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 19:33:30,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 19:33:30,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711998462] [2024-10-28 19:33:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 19:33:30,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-28 19:33:30,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:33:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-28 19:33:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-28 19:33:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:30,625 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:33:30,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-28 19:33:30,626 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:30,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-28 19:33:30,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:33:30,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:33:30,705 INFO L85 PathProgramCache]: Analyzing trace with hash 958813171, now seen corresponding path program 1 times [2024-10-28 19:33:30,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:33:30,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518746479] [2024-10-28 19:33:30,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:33:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:33:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:33:31,049 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-28 19:33:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:33:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518746479] [2024-10-28 19:33:31,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518746479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 19:33:31,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 19:33:31,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-28 19:33:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612889925] [2024-10-28 19:33:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 19:33:31,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 19:33:31,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:33:31,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 19:33:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 19:33:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,053 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:33:31,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 19:33:31,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-28 19:33:31,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:33:31,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:33:31,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1611008582, now seen corresponding path program 1 times [2024-10-28 19:33:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:33:31,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581271095] [2024-10-28 19:33:31,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:33:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:33:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:33:31,265 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-28 19:33:31,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:33:31,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581271095] [2024-10-28 19:33:31,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581271095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 19:33:31,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 19:33:31,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 19:33:31,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896804117] [2024-10-28 19:33:31,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 19:33:31,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 19:33:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:33:31,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 19:33:31,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 19:33:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,270 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:33:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-28 19:33:31,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,271 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-28 19:33:31,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:33:31,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:33:31,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1716215712, now seen corresponding path program 1 times [2024-10-28 19:33:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:33:31,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959680057] [2024-10-28 19:33:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:33:31,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:33:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:33:31,531 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-28 19:33:31,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:33:31,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959680057] [2024-10-28 19:33:31,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959680057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 19:33:31,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 19:33:31,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 19:33:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239594305] [2024-10-28 19:33:31,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 19:33:31,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 19:33:31,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:33:31,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 19:33:31,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 19:33:31,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,538 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:33:31,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-28 19:33:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-28 19:33:31,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:33:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:33:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1469896729, now seen corresponding path program 1 times [2024-10-28 19:33:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:33:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395188637] [2024-10-28 19:33:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:33:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:33:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 19:33:31,861 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-28 19:33:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 19:33:31,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395188637] [2024-10-28 19:33:31,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395188637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 19:33:31,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 19:33:31,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 19:33:31,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848306149] [2024-10-28 19:33:31,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 19:33:31,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 19:33:31,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 19:33:31,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 19:33:31,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 19:33:31,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,864 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 19:33:31,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-28 19:33:31,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,865 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 19:33:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 19:33:31,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-28 19:33:31,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 19:33:31,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 19:33:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash 595705129, now seen corresponding path program 2 times [2024-10-28 19:33:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 19:33:31,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656776294] [2024-10-28 19:33:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 19:33:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 19:33:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 19:33:32,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 19:33:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 19:33:32,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 19:33:32,099 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 19:33:32,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-10-28 19:33:32,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-10-28 19:33:32,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-10-28 19:33:32,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-28 19:33:32,102 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2024-10-28 19:33:32,102 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (3/3) [2024-10-28 19:33:32,245 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-28 19:33:32,245 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-28 19:33:32,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-10-28 19:33:32,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 07:33:32 BasicIcfg [2024-10-28 19:33:32,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-28 19:33:32,270 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-28 19:33:32,270 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-28 19:33:32,270 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-28 19:33:32,271 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 07:33:28" (3/4) ... [2024-10-28 19:33:32,272 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-28 19:33:32,395 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2024-10-28 19:33:32,395 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-28 19:33:32,395 INFO L158 Benchmark]: Toolchain (without parser) took 5536.29ms. Allocated memory was 167.8MB in the beginning and 266.3MB in the end (delta: 98.6MB). Free memory was 111.3MB in the beginning and 153.9MB in the end (delta: -42.6MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2024-10-28 19:33:32,398 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-28 19:33:32,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.23ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 96.5MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-28 19:33:32,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.74ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 93.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-28 19:33:32,399 INFO L158 Benchmark]: Boogie Preprocessor took 34.83ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-28 19:33:32,399 INFO L158 Benchmark]: RCFGBuilder took 739.14ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 104.8MB in the end (delta: -12.9MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-10-28 19:33:32,399 INFO L158 Benchmark]: TraceAbstraction took 4262.47ms. Allocated memory was 167.8MB in the beginning and 266.3MB in the end (delta: 98.6MB). Free memory was 103.6MB in the beginning and 185.0MB in the end (delta: -81.4MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-28 19:33:32,400 INFO L158 Benchmark]: Witness Printer took 125.14ms. Allocated memory is still 266.3MB. Free memory was 185.0MB in the beginning and 153.9MB in the end (delta: 31.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-28 19:33:32,401 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.13ms. Allocated memory is still 167.8MB. Free memory is still 131.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.23ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 96.5MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.74ms. Allocated memory is still 167.8MB. Free memory was 96.5MB in the beginning and 93.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.83ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 739.14ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 104.8MB in the end (delta: -12.9MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4262.47ms. Allocated memory was 167.8MB in the beginning and 266.3MB in the end (delta: 98.6MB). Free memory was 103.6MB in the beginning and 185.0MB in the end (delta: -81.4MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Witness Printer took 125.14ms. Allocated memory is still 266.3MB. Free memory was 185.0MB in the beginning and 153.9MB in the end (delta: 31.0MB). Peak memory consumption was 29.4MB. 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: 11848, independent: 11200, independent conditional: 5669, independent unconditional: 5531, dependent: 648, dependent conditional: 596, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 5669, independent unconditional: 5531, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 5669, independent unconditional: 5531, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 5669, independent unconditional: 5531, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 0, independent unconditional: 11200, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 0, independent unconditional: 11200, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5323, independent: 5271, independent conditional: 0, independent unconditional: 5271, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5323, independent: 5262, independent conditional: 0, independent unconditional: 5262, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1624, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 1285, dependent conditional: 0, dependent unconditional: 1285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11267, independent: 5929, independent conditional: 0, independent unconditional: 5929, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 5323, unknown conditional: 0, unknown unconditional: 5323] , Statistics on independence cache: Total cache size (in pairs): 5323, Positive cache size: 5271, Positive conditional cache size: 0, Positive unconditional cache size: 5271, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5684, Maximal queried relation: 0, Independence queries for same thread: 581, Persistent sets #1 benchmarks: Persistent set computation time: 1.8s, Number of persistent set computation: 444, Number of trivial persistent sets: 18, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5583, independent: 5531, independent conditional: 0, independent unconditional: 5531, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11848, independent: 11200, independent conditional: 5669, independent unconditional: 5531, dependent: 648, dependent conditional: 596, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 5669, independent unconditional: 5531, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 5669, independent unconditional: 5531, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 5669, independent unconditional: 5531, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 0, independent unconditional: 11200, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11267, independent: 11200, independent conditional: 0, independent unconditional: 11200, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5323, independent: 5271, independent conditional: 0, independent unconditional: 5271, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5323, independent: 5262, independent conditional: 0, independent unconditional: 5262, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 61, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1624, independent: 339, independent conditional: 0, independent unconditional: 339, dependent: 1285, dependent conditional: 0, dependent unconditional: 1285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11267, independent: 5929, independent conditional: 0, independent unconditional: 5929, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 5323, unknown conditional: 0, unknown unconditional: 5323] , Statistics on independence cache: Total cache size (in pairs): 5323, Positive cache size: 5271, Positive conditional cache size: 0, Positive unconditional cache size: 5271, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5684, Maximal queried relation: 0, Independence queries for same thread: 581 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7338, independent: 7067, independent conditional: 1796, independent unconditional: 5271, dependent: 271, dependent conditional: 219, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 1796, independent unconditional: 5271, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 1796, independent unconditional: 5271, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 1796, independent unconditional: 5271, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 0, independent unconditional: 7067, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 0, independent unconditional: 7067, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 310, independent: 310, independent conditional: 0, independent unconditional: 310, 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: 310, independent: 310, independent conditional: 0, independent unconditional: 310, 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: 7134, independent: 6757, independent conditional: 0, independent unconditional: 6757, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 310, unknown conditional: 0, unknown unconditional: 310] , Statistics on independence cache: Total cache size (in pairs): 5633, Positive cache size: 5581, Positive conditional cache size: 0, Positive unconditional cache size: 5581, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1811, Maximal queried relation: 0, Independence queries for same thread: 204, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 141, Number of trivial persistent sets: 6, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5323, independent: 5271, independent conditional: 0, independent unconditional: 5271, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7338, independent: 7067, independent conditional: 1796, independent unconditional: 5271, dependent: 271, dependent conditional: 219, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 1796, independent unconditional: 5271, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 1796, independent unconditional: 5271, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 1796, independent unconditional: 5271, dependent: 67, dependent conditional: 15, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 0, independent unconditional: 7067, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7134, independent: 7067, independent conditional: 0, independent unconditional: 7067, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 310, independent: 310, independent conditional: 0, independent unconditional: 310, 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: 310, independent: 310, independent conditional: 0, independent unconditional: 310, 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: 7134, independent: 6757, independent conditional: 0, independent unconditional: 6757, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 310, unknown conditional: 0, unknown unconditional: 310] , Statistics on independence cache: Total cache size (in pairs): 5633, Positive cache size: 5581, Positive conditional cache size: 0, Positive unconditional cache size: 5581, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1811, Maximal queried relation: 0, Independence queries for same thread: 204 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8768, independent: 8235, independent conditional: 1620, independent unconditional: 6615, dependent: 533, dependent conditional: 487, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8301, independent: 8235, independent conditional: 1620, independent unconditional: 6615, dependent: 66, dependent conditional: 20, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8301, independent: 8235, independent conditional: 1620, independent unconditional: 6615, dependent: 66, dependent conditional: 20, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8325, independent: 8235, independent conditional: 1620, independent unconditional: 6615, dependent: 90, dependent conditional: 44, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8325, independent: 8235, independent conditional: 0, independent unconditional: 8235, dependent: 90, dependent conditional: 8, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8325, independent: 8235, independent conditional: 0, independent unconditional: 8235, dependent: 90, dependent conditional: 8, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1647, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1647, independent: 1627, independent conditional: 0, independent unconditional: 1627, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 105, dependent conditional: 20, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8325, independent: 6602, independent conditional: 0, independent unconditional: 6602, dependent: 76, dependent conditional: 4, dependent unconditional: 72, unknown: 1647, unknown conditional: 4, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 7280, Positive cache size: 7214, Positive conditional cache size: 0, Positive unconditional cache size: 7214, Negative cache size: 66, Negative conditional cache size: 4, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1656, Maximal queried relation: 2, Independence queries for same thread: 467, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 136, Number of trivial persistent sets: 130, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6661, independent: 6615, independent conditional: 0, independent unconditional: 6615, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8768, independent: 8235, independent conditional: 1620, independent unconditional: 6615, dependent: 533, dependent conditional: 487, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8301, independent: 8235, independent conditional: 1620, independent unconditional: 6615, dependent: 66, dependent conditional: 20, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8301, independent: 8235, independent conditional: 1620, independent unconditional: 6615, dependent: 66, dependent conditional: 20, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8325, independent: 8235, independent conditional: 1620, independent unconditional: 6615, dependent: 90, dependent conditional: 44, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8325, independent: 8235, independent conditional: 0, independent unconditional: 8235, dependent: 90, dependent conditional: 8, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8325, independent: 8235, independent conditional: 0, independent unconditional: 8235, dependent: 90, dependent conditional: 8, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1647, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1647, independent: 1627, independent conditional: 0, independent unconditional: 1627, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 132, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 105, dependent conditional: 20, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8325, independent: 6602, independent conditional: 0, independent unconditional: 6602, dependent: 76, dependent conditional: 4, dependent unconditional: 72, unknown: 1647, unknown conditional: 4, unknown unconditional: 1643] , Statistics on independence cache: Total cache size (in pairs): 7280, Positive cache size: 7214, Positive conditional cache size: 0, Positive unconditional cache size: 7214, Negative cache size: 66, Negative conditional cache size: 4, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1656, Maximal queried relation: 2, Independence queries for same thread: 467 - CounterExampleResult [Line: 241]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 unsigned int x_0, y_1, x_8, y_9; [L39] 0 _Bool f1_2, f2_3, f1_10, f2_11; [L40] 0 unsigned int temp_4, temp_5, temp_6, temp_7, temp_12, temp_13, temp_14, temp_15; [L212] 0 pthread_t t1, t4; [L215] 0 x_0 = __VERIFIER_nondet_uint() [L216] 0 y_1 = __VERIFIER_nondet_uint() [L217] 0 x_8 = __VERIFIER_nondet_uint() [L218] 0 y_9 = __VERIFIER_nondet_uint() [L219] 0 temp_4 = __VERIFIER_nondet_uint() [L220] 0 temp_5 = __VERIFIER_nondet_uint() [L221] 0 temp_6 = __VERIFIER_nondet_uint() [L222] 0 temp_7 = __VERIFIER_nondet_uint() [L223] 0 temp_12 = __VERIFIER_nondet_uint() [L224] 0 temp_13 = __VERIFIER_nondet_uint() [L225] 0 temp_14 = __VERIFIER_nondet_uint() [L226] 0 temp_15 = __VERIFIER_nondet_uint() [L227] 0 f1_2 = __VERIFIER_nondet_bool() [L228] 0 f2_3 = __VERIFIER_nondet_bool() [L229] 0 f1_10 = __VERIFIER_nondet_bool() [L230] 0 f2_11 = __VERIFIER_nondet_bool() [L233] CALL 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L35] COND FALSE 0 !(!cond) [L233] RET 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L235] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(_argptr)={0:0}, f1_10=1, f1_2=1, f2_11=0, f2_3=1, t1=-5, x_0=0, x_8=0, y_1=4294967295, y_9=-1] [L112] 1 pthread_t t2, t3; VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=1, f2_11=0, f2_3=1, x_0=0, x_8=0, y_1=4294967295, y_9=-1] [L115] 1 f1_2 = 0 [L116] 1 f2_3 = 0 VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=0, x_8=0, y_1=4294967295, y_9=-1] [L119] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, x_0=0, x_8=0, y_1=4294967295, y_9=-1] [L120] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-4, t3=-3, x_0=0, x_8=0, y_1=4294967295, y_9=-1] [L236] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [\old(_argptr)={0:0}, \old(_argptr)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t1=-5, t2=-4, t3=-3, t4=-2, x_0=0, x_8=0, y_1=4294967295, y_9=-1] [L196] 4 pthread_t t5, t6; VAL [\old(_argptr)={0:0}, \old(_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, x_0=0, x_8=0, y_1=4294967295, y_9=-1] [L199] 4 f1_10 = 0 [L200] 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=0, x_8=0, y_1=4294967295, y_9=-1] [L203] 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=0, x_8=0, y_1=4294967295, y_9=-1] [L204] 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=0, x_8=0, y_1=4294967295, y_9=-1] [L44] COND FALSE 2 !(__VERIFIER_nondet_bool()) [L74] 2 return 0; [L121] 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=0, x_8=0, y_1=4294967295, y_9=-1] [L78] COND FALSE 3 !(__VERIFIER_nondet_bool()) [L108] 3 return 0; [L122] 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=0, x_8=0, y_1=4294967295, y_9=-1] [L124] 1 return 0; [L237] 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=0, x_8=0, y_1=4294967295, y_9=-1] [L128] COND TRUE 5 __VERIFIER_nondet_bool() [L130] 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=0, x_0=0, x_8=0, y_1=4294967295, y_9=-1] [L133] 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=0, x_0=0, x_8=1, y_1=4294967295, y_9=-1] [L137] 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=0, x_0=0, x_8=1, y_1=4294967295, y_9=-1] [L162] COND TRUE 6 __VERIFIER_nondet_bool() [L164] 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=0, temp_14=-1, x_0=0, x_8=1, y_1=4294967295, y_9=-1] [L167] 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=0, temp_14=-1, x_0=0, x_8=1, y_1=4294967295, y_9=0] [L171] 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=0, temp_14=-1, x_0=0, x_8=1, y_1=4294967295, y_9=0] [L140] CALL 5 assume_abort_if_not(f2_11) [L35] COND FALSE 5 !(!cond) [L140] RET 5 assume_abort_if_not(f2_11) [L144] 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=0, temp_13=0, temp_14=-1, x_0=0, x_8=1, y_1=4294967295, y_9=0] [L147] 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=0, temp_13=0, temp_14=-1, x_0=0, x_8=1, y_1=4294967295, y_9=1] [L174] CALL 6 assume_abort_if_not(f1_10) [L35] COND FALSE 6 !(!cond) [L174] RET 6 assume_abort_if_not(f1_10) [L151] 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=0, temp_13=0, temp_14=-1, x_0=0, x_8=1, y_1=4294967295, y_9=1] [L178] 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=0, f1_2=0, f2_11=1, f2_3=0, t2=-4, t3=-3, t5=-1, t6=0, temp_12=0, temp_13=0, temp_14=-1, temp_15=1, x_0=0, x_8=1, y_1=4294967295, y_9=1] [L181] 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=0, temp_13=0, temp_14=-1, temp_15=1, x_0=0, x_8=2, y_1=4294967295, y_9=1] [L185] 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=0, temp_13=0, temp_14=-1, temp_15=1, x_0=0, x_8=2, y_1=4294967295, y_9=1] [L154] CALL 5 assume_abort_if_not(!f2_11) [L35] COND FALSE 5 !(!cond) [L154] RET 5 assume_abort_if_not(!f2_11) [L188] CALL 6 assume_abort_if_not(!f1_10) [L35] COND FALSE 6 !(!cond) [L188] RET 6 assume_abort_if_not(!f1_10) [L128] COND FALSE 5 !(__VERIFIER_nondet_bool()) [L158] 5 return 0; [L205] 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=0, temp_13=0, temp_14=-1, temp_15=1, x_0=0, x_8=2, y_1=4294967295, y_9=1] [L162] COND FALSE 6 !(__VERIFIER_nondet_bool()) [L192] 6 return 0; [L206] 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=0, temp_13=0, temp_14=-1, temp_15=1, x_0=0, x_8=2, y_1=4294967295, y_9=1] [L208] 4 return 0; [L238] 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=0, temp_13=0, temp_14=-1, temp_15=1, x_0=0, x_8=2, y_1=4294967295, y_9=1] [L240] CALL 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L35] COND FALSE 0 !(!cond) [L240] RET 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L241] 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=0, temp_13=0, temp_14=-1, temp_15=1, x_0=0, x_8=2, y_1=4294967295, y_9=1] - UnprovableResult [Line: 236]: 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: 235]: 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, 169 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 2.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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, 169 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, 169 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.7s, 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.6s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 946 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-28 19:33:32,434 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