./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/floating_read-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version ffaa4be6 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/pthread-deagle/floating_read-25.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-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 ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 778e3ae04d32637f959b85d1a08971a3e61432e093e04b2798423806241a3f5a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-ffaa4be-m [2024-10-29 13:59:39,914 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-29 13:59:39,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-10-29 13:59:39,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-29 13:59:39,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-29 13:59:40,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-29 13:59:40,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-29 13:59:40,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-29 13:59:40,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-29 13:59:40,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-29 13:59:40,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-29 13:59:40,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-29 13:59:40,013 INFO L153 SettingsManager]: * Use SBE=true [2024-10-29 13:59:40,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-29 13:59:40,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-29 13:59:40,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-29 13:59:40,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-29 13:59:40,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-29 13:59:40,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-29 13:59:40,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-29 13:59:40,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-29 13:59:40,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-29 13:59:40,017 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-29 13:59:40,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-29 13:59:40,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-29 13:59:40,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-29 13:59:40,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-29 13:59:40,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-29 13:59:40,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-29 13:59:40,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-29 13:59:40,020 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-10-29 13:59:40,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-29 13:59:40,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-29 13:59:40,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-29 13:59:40,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-29 13:59:40,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-29 13:59:40,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-29 13:59:40,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-29 13:59:40,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-29 13:59:40,023 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-10-29 13:59:40,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-29 13:59:40,024 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-29 13:59:40,024 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-29 13:59:40,025 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 ! data-race) ) 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 -> 778e3ae04d32637f959b85d1a08971a3e61432e093e04b2798423806241a3f5a [2024-10-29 13:59:40,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-29 13:59:40,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-29 13:59:40,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-29 13:59:40,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-29 13:59:40,308 INFO L274 PluginConnector]: CDTParser initialized [2024-10-29 13:59:40,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-deagle/floating_read-25.i [2024-10-29 13:59:41,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-29 13:59:42,018 INFO L384 CDTParser]: Found 1 translation units. [2024-10-29 13:59:42,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/floating_read-25.i [2024-10-29 13:59:42,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c3a993add/204f27efc0674a739c2197925a388242/FLAG63ca7f250 [2024-10-29 13:59:42,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c3a993add/204f27efc0674a739c2197925a388242 [2024-10-29 13:59:42,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-29 13:59:42,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-29 13:59:42,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-29 13:59:42,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-29 13:59:42,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-29 13:59:42,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15006c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42, skipping insertion in model container [2024-10-29 13:59:42,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-29 13:59:42,417 WARN L1657 CHandler]: Possible shadowing of function thread [2024-10-29 13:59:42,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 13:59:42,450 INFO L200 MainTranslator]: Completed pre-run [2024-10-29 13:59:42,494 WARN L1657 CHandler]: Possible shadowing of function thread [2024-10-29 13:59:42,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-29 13:59:42,548 INFO L204 MainTranslator]: Completed translation [2024-10-29 13:59:42,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42 WrapperNode [2024-10-29 13:59:42,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-29 13:59:42,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-29 13:59:42,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-29 13:59:42,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-29 13:59:42,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,599 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2024-10-29 13:59:42,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-29 13:59:42,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-29 13:59:42,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-29 13:59:42,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-29 13:59:42,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-29 13:59:42,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-29 13:59:42,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-29 13:59:42,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-29 13:59:42,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (1/1) ... [2024-10-29 13:59:42,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-29 13:59:42,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-29 13:59:42,673 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-29 13:59:42,680 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-29 13:59:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-29 13:59:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-29 13:59:42,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-29 13:59:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-29 13:59:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-29 13:59:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-29 13:59:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-29 13:59:42,728 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-29 13:59:42,728 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-29 13:59:42,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-29 13:59:42,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-29 13:59:42,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-29 13:59:42,732 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-29 13:59:42,887 INFO L238 CfgBuilder]: Building ICFG [2024-10-29 13:59:42,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-29 13:59:43,103 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-29 13:59:43,103 INFO L287 CfgBuilder]: Performing block encoding [2024-10-29 13:59:43,130 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-29 13:59:43,131 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-29 13:59:43,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 01:59:43 BoogieIcfgContainer [2024-10-29 13:59:43,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-29 13:59:43,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-29 13:59:43,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-29 13:59:43,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-29 13:59:43,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 01:59:42" (1/3) ... [2024-10-29 13:59:43,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e349935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 01:59:43, skipping insertion in model container [2024-10-29 13:59:43,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 01:59:42" (2/3) ... [2024-10-29 13:59:43,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e349935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 01:59:43, skipping insertion in model container [2024-10-29 13:59:43,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 01:59:43" (3/3) ... [2024-10-29 13:59:43,139 INFO L112 eAbstractionObserver]: Analyzing ICFG floating_read-25.i [2024-10-29 13:59:43,155 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-29 13:59:43,155 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-29 13:59:43,155 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-29 13:59:43,213 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-29 13:59:43,264 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:43,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-29 13:59:43,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-29 13:59:43,266 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-29 13:59:43,267 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-29 13:59:43,298 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:43,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2024-10-29 13:59:43,316 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:43,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:43,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:43,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash -733918974, now seen corresponding path program 1 times [2024-10-29 13:59:43,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054481536] [2024-10-29 13:59:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:43,749 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-29 13:59:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054481536] [2024-10-29 13:59:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054481536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385497375] [2024-10-29 13:59:43,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:43,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:43,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:43,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:43,804 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:43,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 29.0) internal successors, (29), 2 states have internal predecessors, (29), 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-29 13:59:43,804 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:43,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:43,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-29 13:59:43,907 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:43,909 INFO L317 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2024-10-29 13:59:43,914 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:43,916 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:43,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-29 13:59:43,917 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:43,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-29 13:59:43,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:43,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1413199819, now seen corresponding path program 1 times [2024-10-29 13:59:43,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:43,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325577746] [2024-10-29 13:59:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:43,961 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-29 13:59:43,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:43,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325577746] [2024-10-29 13:59:43,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325577746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:43,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:43,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165840041] [2024-10-29 13:59:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:43,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:43,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:43,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:43,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:43,968 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:43,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 14.0) internal successors, (14), 2 states have internal predecessors, (14), 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-29 13:59:43,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:43,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-29 13:59:43,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:43,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:43,980 INFO L85 PathProgramCache]: Analyzing trace with hash 305169799, now seen corresponding path program 1 times [2024-10-29 13:59:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:43,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465250210] [2024-10-29 13:59:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:44,503 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-29 13:59:44,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:44,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465250210] [2024-10-29 13:59:44,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465250210] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:44,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:44,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:59:44,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298487589] [2024-10-29 13:59:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:44,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:59:44,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:44,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:59:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:59:44,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:44,511 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:44,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-29 13:59:44,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:44,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:59:44,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-29 13:59:44,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:44,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash -684794120, now seen corresponding path program 1 times [2024-10-29 13:59:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:44,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075561156] [2024-10-29 13:59:44,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:44,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:44,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 13:59:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:44,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 13:59:44,711 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 13:59:44,711 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-29 13:59:44,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-29 13:59:44,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-29 13:59:44,712 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-29 13:59:44,713 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-29 13:59:44,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-29 13:59:44,721 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-29 13:59:44,725 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-10-29 13:59:44,726 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 13:59:44,726 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-29 13:59:44,741 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-29 13:59:44,746 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:44,750 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:44,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2024-10-29 13:59:44,751 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:44,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:44,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:44,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:44,803 INFO L85 PathProgramCache]: Analyzing trace with hash -226162229, now seen corresponding path program 1 times [2024-10-29 13:59:44,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:44,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354909162] [2024-10-29 13:59:44,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:44,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:44,829 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-29 13:59:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354909162] [2024-10-29 13:59:44,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354909162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:44,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:44,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764327465] [2024-10-29 13:59:44,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:44,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:44,835 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:44,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 29.0) internal successors, (29), 2 states have internal predecessors, (29), 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-29 13:59:44,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,026 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:45,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-29 13:59:45,028 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:45,028 INFO L317 ceAbstractionStarter]: Result for error location threadThread1of2ForFork0 was SAFE (1/3) [2024-10-29 13:59:45,031 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:45,032 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:45,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-29 13:59:45,032 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:45,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-29 13:59:45,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:45,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:45,036 INFO L85 PathProgramCache]: Analyzing trace with hash 218895595, now seen corresponding path program 1 times [2024-10-29 13:59:45,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:45,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549770691] [2024-10-29 13:59:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:45,051 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-29 13:59:45,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:45,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549770691] [2024-10-29 13:59:45,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549770691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:45,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:45,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:45,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947741248] [2024-10-29 13:59:45,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:45,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:45,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:45,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:45,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,056 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:45,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 14.0) internal successors, (14), 2 states have internal predecessors, (14), 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-29 13:59:45,057 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-29 13:59:45,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:45,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:45,066 INFO L85 PathProgramCache]: Analyzing trace with hash 948703190, now seen corresponding path program 1 times [2024-10-29 13:59:45,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:45,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55421176] [2024-10-29 13:59:45,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:45,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:45,388 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-29 13:59:45,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:45,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55421176] [2024-10-29 13:59:45,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55421176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:45,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:45,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:59:45,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479581860] [2024-10-29 13:59:45,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:45,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:59:45,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:45,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:59:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:59:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,393 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:45,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-29 13:59:45,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,394 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:59:45,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-29 13:59:45,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:45,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash -701957406, now seen corresponding path program 1 times [2024-10-29 13:59:45,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:45,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981212682] [2024-10-29 13:59:45,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:45,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 13:59:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:45,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 13:59:45,570 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 13:59:45,570 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-29 13:59:45,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-29 13:59:45,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-29 13:59:45,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-29 13:59:45,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-29 13:59:45,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-29 13:59:45,577 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-29 13:59:45,578 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-10-29 13:59:45,578 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 13:59:45,578 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-29 13:59:45,598 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-29 13:59:45,601 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:45,603 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:45,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-29 13:59:45,603 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:45,603 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-29 13:59:45,609 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:45,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:45,611 INFO L85 PathProgramCache]: Analyzing trace with hash -141022581, now seen corresponding path program 1 times [2024-10-29 13:59:45,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:45,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288750733] [2024-10-29 13:59:45,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:45,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:45,629 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-29 13:59:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288750733] [2024-10-29 13:59:45,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288750733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:45,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:45,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134161080] [2024-10-29 13:59:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:45,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:45,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:45,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:45,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 14.0) internal successors, (14), 2 states have internal predecessors, (14), 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-29 13:59:45,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-29 13:59:45,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:45,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1907519553, now seen corresponding path program 1 times [2024-10-29 13:59:45,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:45,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698953941] [2024-10-29 13:59:45,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:45,901 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-29 13:59:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698953941] [2024-10-29 13:59:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698953941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:59:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933454762] [2024-10-29 13:59:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:45,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:59:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:45,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:59:45,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:59:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,904 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:45,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-29 13:59:45,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:45,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:46,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:46,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:59:46,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-29 13:59:46,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:46,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:46,023 INFO L85 PathProgramCache]: Analyzing trace with hash 78786905, now seen corresponding path program 1 times [2024-10-29 13:59:46,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:46,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250597147] [2024-10-29 13:59:46,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:46,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:46,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 13:59:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:46,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 13:59:46,080 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 13:59:46,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-29 13:59:46,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-29 13:59:46,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-29 13:59:46,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-29 13:59:46,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-29 13:59:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-29 13:59:46,087 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-29 13:59:46,087 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/4) [2024-10-29 13:59:46,088 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 13:59:46,088 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-29 13:59:46,107 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-29 13:59:46,110 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:46,111 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:46,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread3of4ForFork0 ======== [2024-10-29 13:59:46,112 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:46,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:46,214 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:46,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:46,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1256820971, now seen corresponding path program 1 times [2024-10-29 13:59:46,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:46,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89748361] [2024-10-29 13:59:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:46,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-29 13:59:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:46,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89748361] [2024-10-29 13:59:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89748361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:46,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:46,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:46,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067581984] [2024-10-29 13:59:46,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:46,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:46,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:46,259 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:46,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 34.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 13:59:46,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:46,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:46,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-29 13:59:46,708 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:46,709 INFO L317 ceAbstractionStarter]: Result for error location threadThread3of4ForFork0 was SAFE (1/5) [2024-10-29 13:59:46,711 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:46,712 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:46,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of4ForFork0 ======== [2024-10-29 13:59:46,712 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:46,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:46,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:46,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:46,744 INFO L85 PathProgramCache]: Analyzing trace with hash 360992102, now seen corresponding path program 1 times [2024-10-29 13:59:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:46,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289784368] [2024-10-29 13:59:46,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:46,761 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-29 13:59:46,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:46,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289784368] [2024-10-29 13:59:46,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289784368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:46,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:46,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:46,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798997231] [2024-10-29 13:59:46,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:46,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:46,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:46,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:46,765 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:46,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 29.0) internal successors, (29), 2 states have internal predecessors, (29), 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-29 13:59:46,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:47,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-29 13:59:47,231 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:47,231 INFO L317 ceAbstractionStarter]: Result for error location threadThread1of4ForFork0 was SAFE (2/5) [2024-10-29 13:59:47,235 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:47,236 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:47,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread2of4ForFork0 ======== [2024-10-29 13:59:47,237 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:47,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:47,278 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:47,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:47,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1930388702, now seen corresponding path program 1 times [2024-10-29 13:59:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799673818] [2024-10-29 13:59:47,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-29 13:59:47,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:47,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799673818] [2024-10-29 13:59:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799673818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:47,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802513363] [2024-10-29 13:59:47,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:47,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:47,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:47,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:47,301 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:47,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 33.0) internal successors, (33), 2 states have internal predecessors, (33), 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-29 13:59:47,302 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:47,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:47,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-29 13:59:47,681 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:47,681 INFO L317 ceAbstractionStarter]: Result for error location threadThread2of4ForFork0 was SAFE (3/5) [2024-10-29 13:59:47,683 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:47,684 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:47,684 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread4of4ForFork0 ======== [2024-10-29 13:59:47,684 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:47,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:47,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:47,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1374598833, now seen corresponding path program 1 times [2024-10-29 13:59:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759303255] [2024-10-29 13:59:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-29 13:59:47,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:47,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759303255] [2024-10-29 13:59:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759303255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:47,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:47,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855678259] [2024-10-29 13:59:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:47,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:47,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:47,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:47,768 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:47,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 35.0) internal successors, (35), 2 states have internal predecessors, (35), 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-29 13:59:47,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,127 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:48,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-29 13:59:48,128 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:48,129 INFO L317 ceAbstractionStarter]: Result for error location threadThread4of4ForFork0 was SAFE (4/5) [2024-10-29 13:59:48,132 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:48,133 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:48,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-29 13:59:48,135 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:48,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-29 13:59:48,136 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash 987519435, now seen corresponding path program 1 times [2024-10-29 13:59:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434368695] [2024-10-29 13:59:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:48,146 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-29 13:59:48,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:48,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434368695] [2024-10-29 13:59:48,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434368695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:48,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:48,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677199830] [2024-10-29 13:59:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:48,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:48,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,149 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:48,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 14.0) internal successors, (14), 2 states have internal predecessors, (14), 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-29 13:59:48,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-29 13:59:48,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:48,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1809375223, now seen corresponding path program 1 times [2024-10-29 13:59:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193823148] [2024-10-29 13:59:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:48,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:48,322 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-29 13:59:48,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:48,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193823148] [2024-10-29 13:59:48,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193823148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:48,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:48,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:59:48,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612864121] [2024-10-29 13:59:48,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:48,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:59:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:48,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:59:48,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:59:48,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,326 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:48,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-29 13:59:48,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,326 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:59:48,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-29 13:59:48,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:48,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:48,446 INFO L85 PathProgramCache]: Analyzing trace with hash -376350851, now seen corresponding path program 1 times [2024-10-29 13:59:48,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:48,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709730038] [2024-10-29 13:59:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:48,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:48,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 13:59:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:48,517 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 13:59:48,517 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 13:59:48,518 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-29 13:59:48,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-29 13:59:48,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-29 13:59:48,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-29 13:59:48,518 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-29 13:59:48,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-29 13:59:48,523 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-29 13:59:48,524 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (5/5) [2024-10-29 13:59:48,524 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 13:59:48,524 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-29 13:59:48,546 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-29 13:59:48,548 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:48,549 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:48,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of5ForFork0 ======== [2024-10-29 13:59:48,550 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:48,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:48,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:48,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash -291875076, now seen corresponding path program 1 times [2024-10-29 13:59:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534193211] [2024-10-29 13:59:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:48,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:48,607 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-29 13:59:48,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:48,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534193211] [2024-10-29 13:59:48,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534193211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:48,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981047699] [2024-10-29 13:59:48,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:48,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:48,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:48,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:48,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:48,610 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:48,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 29.0) internal successors, (29), 2 states have internal predecessors, (29), 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-29 13:59:48,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:50,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:50,035 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-29 13:59:50,037 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:50,037 INFO L317 ceAbstractionStarter]: Result for error location threadThread1of5ForFork0 was SAFE (1/6) [2024-10-29 13:59:50,039 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:50,041 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:50,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread2of5ForFork0 ======== [2024-10-29 13:59:50,042 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:50,043 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:50,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:50,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash 925711282, now seen corresponding path program 1 times [2024-10-29 13:59:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891694901] [2024-10-29 13:59:50,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-29 13:59:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:50,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891694901] [2024-10-29 13:59:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891694901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:50,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273577670] [2024-10-29 13:59:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:50,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:50,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:50,115 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:50,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 33.0) internal successors, (33), 2 states have internal predecessors, (33), 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-29 13:59:50,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:51,528 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:51,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-29 13:59:51,530 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:51,530 INFO L317 ceAbstractionStarter]: Result for error location threadThread2of5ForFork0 was SAFE (2/6) [2024-10-29 13:59:51,532 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:51,533 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:51,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread3of5ForFork0 ======== [2024-10-29 13:59:51,534 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:51,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:51,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:51,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash 475287751, now seen corresponding path program 1 times [2024-10-29 13:59:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487457488] [2024-10-29 13:59:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-29 13:59:51,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:51,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487457488] [2024-10-29 13:59:51,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487457488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:51,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:51,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669047412] [2024-10-29 13:59:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:51,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:51,616 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:51,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 34.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 13:59:51,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:52,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:52,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-29 13:59:52,972 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:52,972 INFO L317 ceAbstractionStarter]: Result for error location threadThread3of5ForFork0 was SAFE (3/6) [2024-10-29 13:59:52,974 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:52,975 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:52,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-29 13:59:52,976 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:52,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-29 13:59:52,978 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:52,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:52,978 INFO L85 PathProgramCache]: Analyzing trace with hash 78178187, now seen corresponding path program 1 times [2024-10-29 13:59:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15048573] [2024-10-29 13:59:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:52,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:52,990 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-29 13:59:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:52,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15048573] [2024-10-29 13:59:52,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15048573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:52,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:52,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914576222] [2024-10-29 13:59:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:52,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:52,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:52,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:52,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:52,994 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:52,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 14.0) internal successors, (14), 2 states have internal predecessors, (14), 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-29 13:59:52,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:52,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:52,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-29 13:59:52,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:52,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:52,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1514942233, now seen corresponding path program 1 times [2024-10-29 13:59:52,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:52,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402515310] [2024-10-29 13:59:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:53,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:53,199 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-29 13:59:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402515310] [2024-10-29 13:59:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402515310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:53,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:53,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 13:59:53,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098415854] [2024-10-29 13:59:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:53,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 13:59:53,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:53,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 13:59:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 13:59:53,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:53,204 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:53,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-29 13:59:53,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:53,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:53,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:53,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 13:59:53,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-29 13:59:53,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:53,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash 545596142, now seen corresponding path program 1 times [2024-10-29 13:59:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:53,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395089284] [2024-10-29 13:59:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:53,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 13:59:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 13:59:53,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 13:59:53,373 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 13:59:53,373 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-29 13:59:53,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-29 13:59:53,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-29 13:59:53,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-29 13:59:53,374 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-29 13:59:53,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-29 13:59:53,377 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-29 13:59:53,378 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (4/6) [2024-10-29 13:59:53,378 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 13:59:53,378 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-10-29 13:59:53,399 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-10-29 13:59:53,401 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:53,402 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:53,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread6of6ForFork0 ======== [2024-10-29 13:59:53,402 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:53,403 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 13:59:53,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 13:59:53,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash -790883189, now seen corresponding path program 1 times [2024-10-29 13:59:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:53,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739962140] [2024-10-29 13:59:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-10-29 13:59:53,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739962140] [2024-10-29 13:59:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739962140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:53,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:53,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:53,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201148161] [2024-10-29 13:59:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:53,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:53,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:53,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:53,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:53,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:53,545 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:53,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 37.0) internal successors, (37), 2 states have internal predecessors, (37), 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-29 13:59:53,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:59,825 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-10-29 13:59:59,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-29 13:59:59,828 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-29 13:59:59,828 INFO L317 ceAbstractionStarter]: Result for error location threadThread6of6ForFork0 was SAFE (1/7) [2024-10-29 13:59:59,829 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:59,830 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 13:59:59,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-29 13:59:59,831 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 13:59:59,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-29 13:59:59,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:59,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash 657297131, now seen corresponding path program 1 times [2024-10-29 13:59:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556112937] [2024-10-29 13:59:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 13:59:59,844 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-29 13:59:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 13:59:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556112937] [2024-10-29 13:59:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556112937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 13:59:59,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 13:59:59,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 13:59:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701128603] [2024-10-29 13:59:59,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 13:59:59,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 13:59:59,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 13:59:59,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 13:59:59,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 13:59:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:59,847 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 13:59:59,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 14.0) internal successors, (14), 2 states have internal predecessors, (14), 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-29 13:59:59,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 13:59:59,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-29 13:59:59,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 13:59:59,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 13:59:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 163548550, now seen corresponding path program 1 times [2024-10-29 13:59:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 13:59:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770403356] [2024-10-29 13:59:59,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 13:59:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 13:59:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 14:00:00,024 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-29 14:00:00,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 14:00:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770403356] [2024-10-29 14:00:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770403356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 14:00:00,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 14:00:00,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-29 14:00:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254771019] [2024-10-29 14:00:00,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 14:00:00,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-29 14:00:00,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 14:00:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-29 14:00:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-29 14:00:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 14:00:00,027 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 14:00:00,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 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-29 14:00:00,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 14:00:00,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-29 14:00:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 14:00:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-29 14:00:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-29 14:00:00,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2024-10-29 14:00:00,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 14:00:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash 93406988, now seen corresponding path program 1 times [2024-10-29 14:00:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 14:00:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573244800] [2024-10-29 14:00:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 14:00:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 14:00:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 14:00:00,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-29 14:00:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-29 14:00:00,220 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-29 14:00:00,221 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-29 14:00:00,221 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-29 14:00:00,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2024-10-29 14:00:00,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2024-10-29 14:00:00,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2024-10-29 14:00:00,222 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2024-10-29 14:00:00,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-29 14:00:00,225 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-29 14:00:00,225 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/7) [2024-10-29 14:00:00,225 WARN L244 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-29 14:00:00,225 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-10-29 14:00:00,251 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2024-10-29 14:00:00,253 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 14:00:00,254 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-29 14:00:00,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread5of7ForFork0 ======== [2024-10-29 14:00:00,255 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;@66090a41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-29 14:00:00,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-29 14:00:00,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2024-10-29 14:00:00,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-29 14:00:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 639052658, now seen corresponding path program 1 times [2024-10-29 14:00:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-29 14:00:00,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617357869] [2024-10-29 14:00:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-29 14:00:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-29 14:00:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-29 14:00:00,372 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-29 14:00:00,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-29 14:00:00,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617357869] [2024-10-29 14:00:00,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617357869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-29 14:00:00,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-29 14:00:00,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-29 14:00:00,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079628338] [2024-10-29 14:00:00,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-29 14:00:00,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-29 14:00:00,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-29 14:00:00,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-29 14:00:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-29 14:00:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-29 14:00:00,378 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-29 14:00:00,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 36.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-29 14:00:00,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.