./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-theta/unwind3-nondet.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-theta/unwind3-nondet.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL --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 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 12:01:15,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:01:15,215 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-08 12:01:15,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:01:15,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:01:15,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:01:15,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:01:15,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:01:15,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:01:15,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:01:15,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:01:15,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:01:15,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:01:15,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:01:15,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:01:15,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:01:15,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:01:15,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:01:15,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:01:15,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:01:15,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:01:15,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:01:15,274 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 12:01:15,274 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:01:15,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 12:01:15,274 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:01:15,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:01:15,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:01:15,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:01:15,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:01:15,276 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-08 12:01:15,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:01:15,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:01:15,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:01:15,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:01:15,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:01:15,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:01:15,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:01:15,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:01:15,280 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-08 12:01:15,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-08 12:01:15,282 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-08 12:01:15,282 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-08 12:01:15,282 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL 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 -> 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 [2024-11-08 12:01:15,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:01:15,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:01:15,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:01:15,630 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:01:15,631 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:01:15,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/../../sv-benchmarks/c/pthread-theta/unwind3-nondet.i Unable to find full path for "g++" [2024-11-08 12:01:17,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:01:17,972 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:01:17,972 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2024-11-08 12:01:17,989 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/data/e5b8a0473/fbbc75b4bcfd4500b03947d18fb62e5e/FLAG93ba5594b [2024-11-08 12:01:18,006 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/data/e5b8a0473/fbbc75b4bcfd4500b03947d18fb62e5e [2024-11-08 12:01:18,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:01:18,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:01:18,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:01:18,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:01:18,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:01:18,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f61638a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18, skipping insertion in model container [2024-11-08 12:01:18,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:01:18,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:01:18,541 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:01:18,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:01:18,649 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:01:18,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18 WrapperNode [2024-11-08 12:01:18,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:01:18,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:01:18,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:01:18,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:01:18,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,694 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 85 [2024-11-08 12:01:18,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:01:18,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:01:18,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:01:18,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:01:18,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:01:18,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:01:18,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:01:18,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:01:18,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (1/1) ... [2024-11-08 12:01:18,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-08 12:01:18,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:01:18,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-08 12:01:18,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-08 12:01:18,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:01:18,819 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-08 12:01:18,820 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-08 12:01:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-08 12:01:18,820 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-08 12:01:18,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-08 12:01:18,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:01:18,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:01:18,823 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 12:01:18,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:01:18,980 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:01:19,252 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 12:01:19,252 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:01:19,274 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:01:19,274 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 12:01:19,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:01:19 BoogieIcfgContainer [2024-11-08 12:01:19,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:01:19,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:01:19,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:01:19,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:01:19,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:01:18" (1/3) ... [2024-11-08 12:01:19,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412434bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:01:19, skipping insertion in model container [2024-11-08 12:01:19,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:01:18" (2/3) ... [2024-11-08 12:01:19,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412434bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:01:19, skipping insertion in model container [2024-11-08 12:01:19,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:01:19" (3/3) ... [2024-11-08 12:01:19,288 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2024-11-08 12:01:19,311 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:01:19,312 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-11-08 12:01:19,313 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 12:01:19,453 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:19,552 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:19,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-08 12:01:19,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/z3 [2024-11-08 12:01:19,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-08 12:01:19,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_134ffdce-d10f-48a6-b343-8f3140034b52/bin/ugemcutter-verify-v6A4Riy6iL/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-08 12:01:19,597 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:19,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2024-11-08 12:01:19,619 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:19,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:19,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:19,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash -966130271, now seen corresponding path program 1 times [2024-11-08 12:01:19,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:19,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788697492] [2024-11-08 12:01:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:20,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:20,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:20,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788697492] [2024-11-08 12:01:20,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788697492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:20,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:20,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492241446] [2024-11-08 12:01:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:20,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:20,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:20,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:20,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,053 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:20,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:01:20,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:01:20,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:20,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1244089979, now seen corresponding path program 1 times [2024-11-08 12:01:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:20,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362798845] [2024-11-08 12:01:20,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:20,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:20,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:20,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362798845] [2024-11-08 12:01:20,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362798845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:20,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:20,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:20,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150639119] [2024-11-08 12:01:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:20,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:20,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:20,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:20,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,255 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:20,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:01:20,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:20,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:20,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:01:20,464 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:01:20,466 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was SAFE (1/2) [2024-11-08 12:01:20,477 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:20,482 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:20,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:20,484 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:20,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:20,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1733068319, now seen corresponding path program 1 times [2024-11-08 12:01:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:20,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514916687] [2024-11-08 12:01:20,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:20,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:20,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:20,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514916687] [2024-11-08 12:01:20,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514916687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:20,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:20,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:20,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111035721] [2024-11-08 12:01:20,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:20,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:20,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:20,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,583 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:20,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:20,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:20,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:01:20,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:20,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1121130011, now seen corresponding path program 1 times [2024-11-08 12:01:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982425927] [2024-11-08 12:01:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:20,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982425927] [2024-11-08 12:01:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982425927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:20,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:20,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857136935] [2024-11-08 12:01:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:20,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:20,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:20,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:20,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,662 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:20,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:20,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:20,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:01:20,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:20,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash -899836201, now seen corresponding path program 1 times [2024-11-08 12:01:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:20,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214034500] [2024-11-08 12:01:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:20,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:20,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:20,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:20,962 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:20,962 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:20,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:20,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:20,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:20,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:20,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:20,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:20,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 12:01:20,968 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:20,969 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-11-08 12:01:20,969 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:20,970 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-08 12:01:21,003 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:21,007 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:21,008 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:21,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:21,009 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:21,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:21,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:21,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 993996257, now seen corresponding path program 1 times [2024-11-08 12:01:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350574086] [2024-11-08 12:01:21,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:21,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:21,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350574086] [2024-11-08 12:01:21,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350574086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:21,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:21,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:21,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869102463] [2024-11-08 12:01:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:21,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:21,067 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:21,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:21,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:21,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:21,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 12:01:21,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:21,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 189745893, now seen corresponding path program 1 times [2024-11-08 12:01:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:21,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841457994] [2024-11-08 12:01:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:21,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:21,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841457994] [2024-11-08 12:01:21,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841457994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:21,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:21,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568425041] [2024-11-08 12:01:21,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:21,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:21,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:21,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:21,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:21,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:21,180 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:21,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:21,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:21,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:21,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:21,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:21,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 12:01:21,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:21,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1285946874, now seen corresponding path program 1 times [2024-11-08 12:01:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196899566] [2024-11-08 12:01:21,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:21,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:21,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:21,533 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:21,533 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:21,534 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:21,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:21,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 12:01:21,540 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:21,542 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2024-11-08 12:01:21,543 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:21,543 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-08 12:01:21,594 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:21,601 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:21,603 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:21,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of3ForFork0 ======== [2024-11-08 12:01:21,608 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:21,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:21,866 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:21,868 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:21,868 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of3ForFork0 was SAFE (1/4) [2024-11-08 12:01:21,871 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:21,873 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:21,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:21,874 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:21,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:21,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:21,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:21,877 INFO L85 PathProgramCache]: Analyzing trace with hash 239976673, now seen corresponding path program 1 times [2024-11-08 12:01:21,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:21,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781126651] [2024-11-08 12:01:21,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:21,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:21,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:21,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781126651] [2024-11-08 12:01:21,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781126651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:21,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:21,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:21,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186019276] [2024-11-08 12:01:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:21,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:21,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:21,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:21,906 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:21,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:21,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:21,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 12:01:21,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:21,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:21,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1083403611, now seen corresponding path program 1 times [2024-11-08 12:01:21,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:21,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399952163] [2024-11-08 12:01:21,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:21,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:21,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:21,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:21,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399952163] [2024-11-08 12:01:21,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399952163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:21,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:21,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:21,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91207030] [2024-11-08 12:01:21,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:21,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:21,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:21,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:21,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:21,974 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:21,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:21,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:21,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:22,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:22,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 12:01:22,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:22,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:22,314 INFO L85 PathProgramCache]: Analyzing trace with hash -8967968, now seen corresponding path program 1 times [2024-11-08 12:01:22,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:22,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397868151] [2024-11-08 12:01:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:22,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:22,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:22,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:22,383 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:22,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:22,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:22,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:22,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:22,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:22,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:22,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:22,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 12:01:22,389 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:22,390 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/4) [2024-11-08 12:01:22,390 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:22,390 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-08 12:01:22,442 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:22,445 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:22,448 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:22,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of4ForFork0 ======== [2024-11-08 12:01:22,449 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:22,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:22,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:22,771 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:22,775 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of4ForFork0 was SAFE (1/5) [2024-11-08 12:01:22,779 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:22,781 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:22,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of4ForFork0 ======== [2024-11-08 12:01:22,783 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:22,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:23,024 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:23,028 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:23,028 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of4ForFork0 was SAFE (2/5) [2024-11-08 12:01:23,033 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:23,035 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:23,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of4ForFork0 ======== [2024-11-08 12:01:23,036 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:23,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:23,255 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:23,259 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:23,263 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of4ForFork0 was SAFE (3/5) [2024-11-08 12:01:23,268 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:23,270 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:23,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of4ForFork0 ======== [2024-11-08 12:01:23,272 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:23,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:23,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:23,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash 870950861, now seen corresponding path program 1 times [2024-11-08 12:01:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700832827] [2024-11-08 12:01:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:23,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700832827] [2024-11-08 12:01:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700832827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686985536] [2024-11-08 12:01:23,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:23,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:23,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:23,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,415 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:23,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:01:23,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 12:01:23,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:23,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash -380526420, now seen corresponding path program 1 times [2024-11-08 12:01:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:23,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096466199] [2024-11-08 12:01:23,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096466199] [2024-11-08 12:01:23,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096466199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349333602] [2024-11-08 12:01:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:23,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:23,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:23,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,511 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:01:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:23,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:23,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 12:01:23,844 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:01:23,845 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of4ForFork0 was SAFE (4/5) [2024-11-08 12:01:23,848 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:23,849 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:23,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:23,850 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:23,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:23,853 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:23,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1045845217, now seen corresponding path program 1 times [2024-11-08 12:01:23,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:23,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416959312] [2024-11-08 12:01:23,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:23,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:23,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:23,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416959312] [2024-11-08 12:01:23,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416959312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:23,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:23,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:23,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893830103] [2024-11-08 12:01:23,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:23,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:23,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:23,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:23,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:23,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,896 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:23,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:23,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:23,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 12:01:23,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -771421275, now seen corresponding path program 1 times [2024-11-08 12:01:23,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:23,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781642117] [2024-11-08 12:01:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:23,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:23,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:23,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781642117] [2024-11-08 12:01:23,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781642117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:23,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273025829] [2024-11-08 12:01:23,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:23,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:23,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:23,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:23,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:23,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:23,938 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:23,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:23,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:23,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:24,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:24,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:24,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 12:01:24,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:24,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1619896645, now seen corresponding path program 1 times [2024-11-08 12:01:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:24,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834921767] [2024-11-08 12:01:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:24,232 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:24,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:24,254 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:24,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:24,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:24,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:24,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:24,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:24,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:24,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:24,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 12:01:24,259 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:24,259 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (5/5) [2024-11-08 12:01:24,260 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:24,260 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-08 12:01:24,304 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:24,308 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:24,310 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:24,310 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of5ForFork0 ======== [2024-11-08 12:01:24,311 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:24,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:24,544 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:24,548 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:24,548 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of5ForFork0 was SAFE (1/6) [2024-11-08 12:01:24,551 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:24,553 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:24,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of5ForFork0 ======== [2024-11-08 12:01:24,554 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:24,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:24,774 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:24,779 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:24,779 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of5ForFork0 was SAFE (2/6) [2024-11-08 12:01:24,782 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:24,784 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:24,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:24,786 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:24,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:24,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:24,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:24,789 INFO L85 PathProgramCache]: Analyzing trace with hash 245864673, now seen corresponding path program 1 times [2024-11-08 12:01:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:24,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137215354] [2024-11-08 12:01:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:24,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:24,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:24,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137215354] [2024-11-08 12:01:24,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137215354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:24,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:24,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:24,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635267956] [2024-11-08 12:01:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:24,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:24,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:24,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:24,821 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:24,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:24,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:24,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 12:01:24,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:24,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash -766418779, now seen corresponding path program 1 times [2024-11-08 12:01:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:24,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606791785] [2024-11-08 12:01:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:24,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:24,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:24,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606791785] [2024-11-08 12:01:24,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606791785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:24,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:24,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:24,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338859614] [2024-11-08 12:01:24,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:24,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:24,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:24,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:24,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:24,865 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:24,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:24,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:24,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:25,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 12:01:25,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1440821429, now seen corresponding path program 1 times [2024-11-08 12:01:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:25,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793742136] [2024-11-08 12:01:25,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:25,255 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:25,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:25,303 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:25,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:25,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:25,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:25,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:25,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:25,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:25,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:25,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 12:01:25,310 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:25,311 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (3/6) [2024-11-08 12:01:25,311 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:25,311 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-08 12:01:25,375 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:25,381 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:25,383 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:25,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of6ForFork0 ======== [2024-11-08 12:01:25,384 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:25,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:25,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:25,688 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:25,689 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of6ForFork0 was SAFE (1/7) [2024-11-08 12:01:25,692 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:25,694 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:25,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of6ForFork0 ======== [2024-11-08 12:01:25,696 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:25,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:26,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:26,052 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:26,053 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of6ForFork0 was SAFE (2/7) [2024-11-08 12:01:26,057 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:26,058 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:26,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of6ForFork0 ======== [2024-11-08 12:01:26,059 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:26,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:26,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:26,310 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:26,310 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of6ForFork0 was SAFE (3/7) [2024-11-08 12:01:26,313 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:26,315 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:26,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of6ForFork0 ======== [2024-11-08 12:01:26,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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:26,316 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:26,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:26,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2066170795, now seen corresponding path program 1 times [2024-11-08 12:01:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99833556] [2024-11-08 12:01:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99833556] [2024-11-08 12:01:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99833556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479707777] [2024-11-08 12:01:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:26,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:26,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:26,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:26,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:01:26,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:26,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 12:01:26,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:26,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:26,511 INFO L85 PathProgramCache]: Analyzing trace with hash -508141739, now seen corresponding path program 1 times [2024-11-08 12:01:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526785894] [2024-11-08 12:01:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:26,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:26,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526785894] [2024-11-08 12:01:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526785894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:26,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:26,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:26,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360748] [2024-11-08 12:01:26,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:26,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:26,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:26,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:26,562 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:26,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:01:26,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:26,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:27,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:27,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:27,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 12:01:27,055 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:01:27,056 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of6ForFork0 was SAFE (4/7) [2024-11-08 12:01:27,059 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:27,065 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:27,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of6ForFork0 ======== [2024-11-08 12:01:27,066 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:27,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:27,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:27,344 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:27,345 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of6ForFork0 was SAFE (5/7) [2024-11-08 12:01:27,348 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:27,350 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:27,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:27,351 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:27,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:27,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:27,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1525672479, now seen corresponding path program 1 times [2024-11-08 12:01:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333145806] [2024-11-08 12:01:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:27,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333145806] [2024-11-08 12:01:27,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333145806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:27,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:27,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729435599] [2024-11-08 12:01:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:27,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:27,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:27,389 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:27,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:27,390 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:27,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 12:01:27,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:27,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:27,402 INFO L85 PathProgramCache]: Analyzing trace with hash -670831387, now seen corresponding path program 1 times [2024-11-08 12:01:27,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:27,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442583377] [2024-11-08 12:01:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:27,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:27,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442583377] [2024-11-08 12:01:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442583377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:27,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:27,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:27,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740809823] [2024-11-08 12:01:27,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:27,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:27,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:27,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:27,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:27,433 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:27,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:27,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:27,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:27,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 12:01:27,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:27,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash 640233776, now seen corresponding path program 1 times [2024-11-08 12:01:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:27,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751801873] [2024-11-08 12:01:27,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:27,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:27,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:27,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:27,915 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:27,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:27,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:27,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:27,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:27,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:27,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:27,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:27,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 12:01:27,919 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:27,920 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (6/7) [2024-11-08 12:01:27,920 WARN L244 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:27,920 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-08 12:01:27,979 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:27,983 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:27,984 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:27,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of7ForFork0 ======== [2024-11-08 12:01:27,985 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:27,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:28,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:28,346 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:28,346 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of7ForFork0 was SAFE (1/8) [2024-11-08 12:01:28,351 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:28,352 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:28,353 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of7ForFork0 ======== [2024-11-08 12:01:28,353 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:28,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:28,769 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:28,772 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:28,772 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of7ForFork0 was SAFE (2/8) [2024-11-08 12:01:28,777 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:28,778 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:28,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of7ForFork0 ======== [2024-11-08 12:01:28,780 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:28,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:29,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:29,159 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:29,159 INFO L317 ceAbstractionStarter]: Result for error location f2Thread7of7ForFork0 was SAFE (3/8) [2024-11-08 12:01:29,163 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:29,164 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:29,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of7ForFork0 ======== [2024-11-08 12:01:29,165 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:29,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:29,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:29,521 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:29,522 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of7ForFork0 was SAFE (4/8) [2024-11-08 12:01:29,526 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:29,528 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:29,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of7ForFork0 ======== [2024-11-08 12:01:29,529 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:29,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:29,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2103483719, now seen corresponding path program 1 times [2024-11-08 12:01:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:29,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626710779] [2024-11-08 12:01:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:29,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:29,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626710779] [2024-11-08 12:01:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626710779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:29,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:29,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417933315] [2024-11-08 12:01:29,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:29,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:29,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:29,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:29,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:29,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:29,679 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:29,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:01:29,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:29,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 12:01:29,700 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -496262446, now seen corresponding path program 1 times [2024-11-08 12:01:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317675219] [2024-11-08 12:01:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:29,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:29,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317675219] [2024-11-08 12:01:29,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317675219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:29,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:29,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:29,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796082472] [2024-11-08 12:01:29,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:29,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:29,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:29,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:29,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:29,745 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:29,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:01:29,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:29,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:30,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:30,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:30,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 12:01:30,414 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:01:30,415 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of7ForFork0 was SAFE (5/8) [2024-11-08 12:01:30,418 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:30,419 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:30,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of7ForFork0 ======== [2024-11-08 12:01:30,420 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:30,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:30,717 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:30,719 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:30,720 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of7ForFork0 was SAFE (6/8) [2024-11-08 12:01:30,724 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:30,726 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:30,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:30,727 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:30,727 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:30,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:30,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:30,729 INFO L85 PathProgramCache]: Analyzing trace with hash 314560225, now seen corresponding path program 1 times [2024-11-08 12:01:30,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:30,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77136825] [2024-11-08 12:01:30,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:30,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:30,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:30,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77136825] [2024-11-08 12:01:30,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77136825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616396913] [2024-11-08 12:01:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:30,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:30,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:30,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:30,766 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:30,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:30,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:30,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 12:01:30,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:30,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash 146850853, now seen corresponding path program 1 times [2024-11-08 12:01:30,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:30,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554263673] [2024-11-08 12:01:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:30,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:30,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554263673] [2024-11-08 12:01:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554263673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:30,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:30,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:30,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068757924] [2024-11-08 12:01:30,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:30,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:30,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:30,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:30,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:30,806 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:30,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:30,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:31,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 12:01:31,280 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1902235914, now seen corresponding path program 1 times [2024-11-08 12:01:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:31,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147587970] [2024-11-08 12:01:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:31,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:31,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:31,343 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:31,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:31,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:31,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:31,344 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:31,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:31,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:31,345 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:31,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 12:01:31,348 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:31,349 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (7/8) [2024-11-08 12:01:31,349 WARN L244 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:31,349 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-11-08 12:01:31,408 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:31,416 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:31,417 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:31,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of8ForFork0 ======== [2024-11-08 12:01:31,418 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:31,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:31,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:31,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:31,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1056172189, now seen corresponding path program 1 times [2024-11-08 12:01:31,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:31,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644381922] [2024-11-08 12:01:31,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:31,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:31,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:31,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644381922] [2024-11-08 12:01:31,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644381922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:31,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:31,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875304320] [2024-11-08 12:01:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:31,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:31,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:31,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:31,613 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:31,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:01:31,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 12:01:31,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:31,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash 375258889, now seen corresponding path program 1 times [2024-11-08 12:01:31,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:31,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422188158] [2024-11-08 12:01:31,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:31,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:31,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:31,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:31,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422188158] [2024-11-08 12:01:31,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422188158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:31,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786860524] [2024-11-08 12:01:31,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:31,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:31,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:31,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:31,691 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:31,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:01:31,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:31,692 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:32,603 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:32,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 12:01:32,609 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:01:32,609 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of8ForFork0 was SAFE (1/9) [2024-11-08 12:01:32,615 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:32,617 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:32,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of8ForFork0 ======== [2024-11-08 12:01:32,617 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:32,618 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:33,121 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:33,124 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:33,125 INFO L317 ceAbstractionStarter]: Result for error location f2Thread7of8ForFork0 was SAFE (2/9) [2024-11-08 12:01:33,130 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:33,134 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:33,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of8ForFork0 ======== [2024-11-08 12:01:33,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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:33,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:33,553 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:33,556 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:33,556 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of8ForFork0 was SAFE (3/9) [2024-11-08 12:01:33,562 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:33,563 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:33,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of8ForFork0 ======== [2024-11-08 12:01:33,563 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:33,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:33,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:33,990 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:33,990 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of8ForFork0 was SAFE (4/9) [2024-11-08 12:01:33,994 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:33,995 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:33,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of8ForFork0 ======== [2024-11-08 12:01:33,996 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:33,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:34,343 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:34,348 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:34,348 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of8ForFork0 was SAFE (5/9) [2024-11-08 12:01:34,351 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:34,353 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:34,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:34,354 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:34,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:34,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:34,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2097873377, now seen corresponding path program 1 times [2024-11-08 12:01:34,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:34,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145816452] [2024-11-08 12:01:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145816452] [2024-11-08 12:01:34,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145816452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:34,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184586928] [2024-11-08 12:01:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:34,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:34,386 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:34,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:34,387 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:34,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:34,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 12:01:34,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:34,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash 685233125, now seen corresponding path program 1 times [2024-11-08 12:01:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734298207] [2024-11-08 12:01:34,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:34,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:34,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734298207] [2024-11-08 12:01:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734298207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:34,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:34,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:34,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66935351] [2024-11-08 12:01:34,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:34,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:34,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:34,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:34,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:34,430 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:34,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:34,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:34,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:34,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 12:01:34,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:34,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 266541063, now seen corresponding path program 1 times [2024-11-08 12:01:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:34,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078834355] [2024-11-08 12:01:34,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:34,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:34,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:34,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:34,984 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:34,984 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:34,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:34,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:34,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:34,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:34,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:34,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:34,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 12:01:34,990 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:34,990 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (6/9) [2024-11-08 12:01:34,990 WARN L244 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:34,990 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-11-08 12:01:35,048 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:35,053 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:35,054 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:35,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of9ForFork0 ======== [2024-11-08 12:01:35,055 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:35,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:35,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:35,654 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:35,655 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of9ForFork0 was SAFE (1/10) [2024-11-08 12:01:35,660 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:35,662 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:35,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of9ForFork0 ======== [2024-11-08 12:01:35,663 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:35,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:36,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:36,163 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:36,164 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of9ForFork0 was SAFE (2/10) [2024-11-08 12:01:36,168 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:36,169 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:36,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of9ForFork0 ======== [2024-11-08 12:01:36,170 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:36,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:36,721 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:36,725 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:36,725 INFO L317 ceAbstractionStarter]: Result for error location f2Thread8of9ForFork0 was SAFE (3/10) [2024-11-08 12:01:36,729 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:36,730 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:36,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of9ForFork0 ======== [2024-11-08 12:01:36,731 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:36,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:36,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:36,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:36,871 INFO L85 PathProgramCache]: Analyzing trace with hash 271660289, now seen corresponding path program 1 times [2024-11-08 12:01:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:36,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347709243] [2024-11-08 12:01:36,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:36,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:36,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:36,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347709243] [2024-11-08 12:01:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347709243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:36,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:36,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:36,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584103820] [2024-11-08 12:01:36,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:36,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:36,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:36,911 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:36,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:01:36,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:36,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 12:01:36,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:36,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -765963102, now seen corresponding path program 1 times [2024-11-08 12:01:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:36,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837705805] [2024-11-08 12:01:36,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:36,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837705805] [2024-11-08 12:01:37,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837705805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:37,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:37,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098372387] [2024-11-08 12:01:37,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:37,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:37,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:37,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:37,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:37,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:37,013 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:37,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:01:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:37,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:37,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:37,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 12:01:37,925 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:01:37,926 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of9ForFork0 was SAFE (4/10) [2024-11-08 12:01:37,930 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:37,931 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:37,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of9ForFork0 ======== [2024-11-08 12:01:37,933 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:37,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:38,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:38,602 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:38,602 INFO L317 ceAbstractionStarter]: Result for error location f2Thread9of9ForFork0 was SAFE (5/10) [2024-11-08 12:01:38,608 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:38,610 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:38,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of9ForFork0 ======== [2024-11-08 12:01:38,611 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:38,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:39,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:39,169 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:39,169 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of9ForFork0 was SAFE (6/10) [2024-11-08 12:01:39,175 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:39,177 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:39,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of9ForFork0 ======== [2024-11-08 12:01:39,178 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:39,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:39,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:39,807 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:39,807 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of9ForFork0 was SAFE (7/10) [2024-11-08 12:01:39,814 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:39,815 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:39,816 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of9ForFork0 ======== [2024-11-08 12:01:39,816 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:39,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:40,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:40,451 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:40,451 INFO L317 ceAbstractionStarter]: Result for error location f2Thread7of9ForFork0 was SAFE (8/10) [2024-11-08 12:01:40,456 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:40,458 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:40,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of9ForFork0 ======== [2024-11-08 12:01:40,459 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:40,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:40,874 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:40,878 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:40,878 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of9ForFork0 was SAFE (9/10) [2024-11-08 12:01:40,882 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:40,883 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:40,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:40,884 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:40,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:40,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:40,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:40,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1767090463, now seen corresponding path program 1 times [2024-11-08 12:01:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:40,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405122338] [2024-11-08 12:01:40,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:40,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:40,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405122338] [2024-11-08 12:01:40,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405122338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:40,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:40,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:40,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704268561] [2024-11-08 12:01:40,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:40,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:40,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:40,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:40,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:40,915 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:40,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:40,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:40,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:40,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 12:01:40,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:40,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:40,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1012264485, now seen corresponding path program 1 times [2024-11-08 12:01:40,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:40,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813411166] [2024-11-08 12:01:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:40,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:40,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813411166] [2024-11-08 12:01:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813411166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:40,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451299572] [2024-11-08 12:01:40,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:40,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:40,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:40,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:40,954 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:40,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:40,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:41,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:41,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:41,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-08 12:01:41,558 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:41,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1060511325, now seen corresponding path program 1 times [2024-11-08 12:01:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:41,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780097545] [2024-11-08 12:01:41,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:41,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:41,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:41,643 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:41,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:41,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:41,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:41,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:41,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:41,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:41,644 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:41,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 12:01:41,653 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:41,654 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (10/10) [2024-11-08 12:01:41,655 WARN L244 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:41,655 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-11-08 12:01:41,729 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:41,734 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:41,735 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:41,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of10ForFork0 ======== [2024-11-08 12:01:41,736 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:41,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:42,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:42,498 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:42,498 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of10ForFork0 was SAFE (1/11) [2024-11-08 12:01:42,502 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:42,503 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:42,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of10ForFork0 ======== [2024-11-08 12:01:42,504 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:42,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:43,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:43,071 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:43,071 INFO L317 ceAbstractionStarter]: Result for error location f2Thread7of10ForFork0 was SAFE (2/11) [2024-11-08 12:01:43,075 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:43,077 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:43,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of10ForFork0 ======== [2024-11-08 12:01:43,077 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:43,078 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:43,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:43,535 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:43,536 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of10ForFork0 was SAFE (3/11) [2024-11-08 12:01:43,541 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:43,542 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:43,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of10ForFork0 ======== [2024-11-08 12:01:43,543 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:43,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:44,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:44,174 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:44,174 INFO L317 ceAbstractionStarter]: Result for error location f2Thread10of10ForFork0 was SAFE (4/11) [2024-11-08 12:01:44,181 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:44,183 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:44,184 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of10ForFork0 ======== [2024-11-08 12:01:44,184 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:44,184 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:44,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:44,683 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:44,683 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of10ForFork0 was SAFE (5/11) [2024-11-08 12:01:44,687 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:44,688 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:44,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of10ForFork0 ======== [2024-11-08 12:01:44,689 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:44,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:45,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:45,088 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:45,089 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of10ForFork0 was SAFE (6/11) [2024-11-08 12:01:45,092 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:45,093 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:45,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:45,094 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:45,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:45,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:45,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1424325345, now seen corresponding path program 1 times [2024-11-08 12:01:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:45,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23424814] [2024-11-08 12:01:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:45,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:45,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:45,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23424814] [2024-11-08 12:01:45,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23424814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:45,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:45,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:45,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580342726] [2024-11-08 12:01:45,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:45,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:45,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:45,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:45,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:45,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:45,128 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:45,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:45,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:45,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 12:01:45,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:45,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash 959322917, now seen corresponding path program 1 times [2024-11-08 12:01:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:45,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797521390] [2024-11-08 12:01:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:45,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:45,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:45,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797521390] [2024-11-08 12:01:45,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797521390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:45,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:45,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182307482] [2024-11-08 12:01:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:45,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:45,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:45,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:45,172 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:45,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:45,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:45,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:45,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:45,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 12:01:45,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:45,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:45,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1655748234, now seen corresponding path program 1 times [2024-11-08 12:01:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:45,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368086516] [2024-11-08 12:01:45,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:45,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:45,881 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:45,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:45,927 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:45,928 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:45,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:45,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:45,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:45,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:45,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:45,929 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:45,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-08 12:01:45,940 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:45,940 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (7/11) [2024-11-08 12:01:45,940 WARN L244 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:45,940 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-11-08 12:01:46,013 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:46,018 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:46,019 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:46,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of11ForFork0 ======== [2024-11-08 12:01:46,020 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:46,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:46,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:46,787 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:46,787 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of11ForFork0 was SAFE (1/12) [2024-11-08 12:01:46,793 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:46,795 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:46,795 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of11ForFork0 ======== [2024-11-08 12:01:46,796 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:46,796 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:47,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:47,538 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:47,538 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of11ForFork0 was SAFE (2/12) [2024-11-08 12:01:47,544 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:47,546 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:47,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of11ForFork0 ======== [2024-11-08 12:01:47,547 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:47,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:47,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:47,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1062195319, now seen corresponding path program 1 times [2024-11-08 12:01:47,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:47,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731368905] [2024-11-08 12:01:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731368905] [2024-11-08 12:01:47,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731368905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:47,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:47,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:47,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954941563] [2024-11-08 12:01:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:47,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:47,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:47,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:47,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:47,809 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:47,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:01:47,809 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:47,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 12:01:47,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash 489948827, now seen corresponding path program 1 times [2024-11-08 12:01:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:47,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694357537] [2024-11-08 12:01:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:47,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:47,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694357537] [2024-11-08 12:01:47,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694357537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:47,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:47,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135336895] [2024-11-08 12:01:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:47,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:47,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:47,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:47,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:47,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:47,918 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:47,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:01:47,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:47,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:49,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:49,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:49,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 12:01:49,080 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:01:49,080 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of11ForFork0 was SAFE (3/12) [2024-11-08 12:01:49,085 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:49,087 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:49,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of11ForFork0 ======== [2024-11-08 12:01:49,088 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:49,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:49,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:49,716 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:49,716 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of11ForFork0 was SAFE (4/12) [2024-11-08 12:01:49,720 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:49,722 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:49,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of11ForFork0 ======== [2024-11-08 12:01:49,722 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:49,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:50,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:50,142 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:50,142 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of11ForFork0 was SAFE (5/12) [2024-11-08 12:01:50,147 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:50,148 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:50,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of11ForFork0 ======== [2024-11-08 12:01:50,149 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:50,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:50,638 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:50,646 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:50,646 INFO L317 ceAbstractionStarter]: Result for error location f2Thread10of11ForFork0 was SAFE (6/12) [2024-11-08 12:01:50,651 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:50,652 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:50,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of11ForFork0 ======== [2024-11-08 12:01:50,653 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:50,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:51,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:51,221 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:51,221 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of11ForFork0 was SAFE (7/12) [2024-11-08 12:01:51,224 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:51,226 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:51,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of11ForFork0 ======== [2024-11-08 12:01:51,226 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:51,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:51,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:51,737 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:51,737 INFO L317 ceAbstractionStarter]: Result for error location f2Thread11of11ForFork0 was SAFE (8/12) [2024-11-08 12:01:51,741 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:51,743 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:51,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of11ForFork0 ======== [2024-11-08 12:01:51,743 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:51,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:52,128 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:52,136 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:52,136 INFO L317 ceAbstractionStarter]: Result for error location f2Thread9of11ForFork0 was SAFE (9/12) [2024-11-08 12:01:52,140 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:52,141 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:52,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:01:52,142 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:52,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:01:52,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash 406153185, now seen corresponding path program 1 times [2024-11-08 12:01:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140715141] [2024-11-08 12:01:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:52,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140715141] [2024-11-08 12:01:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140715141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:52,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024823684] [2024-11-08 12:01:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:52,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:52,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:52,181 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:52,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:01:52,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:52,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 12:01:52,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:52,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:52,195 INFO L85 PathProgramCache]: Analyzing trace with hash -822152347, now seen corresponding path program 1 times [2024-11-08 12:01:52,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:52,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176307473] [2024-11-08 12:01:52,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:52,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:52,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:52,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176307473] [2024-11-08 12:01:52,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176307473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:52,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:52,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:52,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388663648] [2024-11-08 12:01:52,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:52,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:52,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:52,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:52,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:52,230 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:52,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:01:52,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:52,230 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:52,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:52,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:01:52,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-08 12:01:52,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:01:52,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:52,982 INFO L85 PathProgramCache]: Analyzing trace with hash 938025948, now seen corresponding path program 1 times [2024-11-08 12:01:52,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:52,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836791565] [2024-11-08 12:01:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:52,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:53,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:01:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:01:53,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:01:53,066 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:01:53,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:01:53,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:01:53,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:01:53,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:01:53,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:01:53,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:01:53,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:01:53,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-08 12:01:53,081 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:01:53,081 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (10/12) [2024-11-08 12:01:53,081 WARN L244 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:01:53,081 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-11-08 12:01:53,159 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:01:53,164 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:53,165 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:53,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of12ForFork0 ======== [2024-11-08 12:01:53,166 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:53,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:54,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:54,017 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:54,017 INFO L317 ceAbstractionStarter]: Result for error location f2Thread11of12ForFork0 was SAFE (1/13) [2024-11-08 12:01:54,020 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:54,022 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:54,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of12ForFork0 ======== [2024-11-08 12:01:54,022 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:54,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:54,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:54,621 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:54,621 INFO L317 ceAbstractionStarter]: Result for error location f2Thread8of12ForFork0 was SAFE (2/13) [2024-11-08 12:01:54,625 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:54,626 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:54,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of12ForFork0 ======== [2024-11-08 12:01:54,627 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:54,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:55,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:55,175 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:55,175 INFO L317 ceAbstractionStarter]: Result for error location f2Thread10of12ForFork0 was SAFE (3/13) [2024-11-08 12:01:55,178 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:55,179 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:55,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of12ForFork0 ======== [2024-11-08 12:01:55,179 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:55,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:55,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:55,978 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:55,978 INFO L317 ceAbstractionStarter]: Result for error location f2Thread7of12ForFork0 was SAFE (4/13) [2024-11-08 12:01:55,982 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:55,983 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:55,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of12ForFork0 ======== [2024-11-08 12:01:55,984 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:55,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:56,761 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:56,772 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:56,773 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of12ForFork0 was SAFE (5/13) [2024-11-08 12:01:56,780 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:56,782 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:56,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of12ForFork0 ======== [2024-11-08 12:01:56,783 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:56,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:57,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:57,691 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:57,692 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of12ForFork0 was SAFE (6/13) [2024-11-08 12:01:57,696 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:57,698 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:57,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of12ForFork0 ======== [2024-11-08 12:01:57,698 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:57,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:58,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:58,421 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:58,421 INFO L317 ceAbstractionStarter]: Result for error location f2Thread12of12ForFork0 was SAFE (7/13) [2024-11-08 12:01:58,424 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:58,425 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:58,425 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of12ForFork0 ======== [2024-11-08 12:01:58,425 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:58,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:58,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:58,998 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:58,998 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of12ForFork0 was SAFE (8/13) [2024-11-08 12:01:59,001 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:59,002 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:59,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of12ForFork0 ======== [2024-11-08 12:01:59,002 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:59,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:59,542 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:01:59,552 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:01:59,553 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of12ForFork0 was SAFE (9/13) [2024-11-08 12:01:59,556 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:59,557 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:01:59,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of12ForFork0 ======== [2024-11-08 12:01:59,558 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:01:59,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:01:59,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:59,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash 601187885, now seen corresponding path program 1 times [2024-11-08 12:01:59,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070070854] [2024-11-08 12:01:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:59,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:59,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:59,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070070854] [2024-11-08 12:01:59,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070070854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:59,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:59,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:59,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831116350] [2024-11-08 12:01:59,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:59,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:01:59,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:01:59,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:01:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:59,745 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:59,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:01:59,745 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:59,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-08 12:01:59,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:01:59,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:01:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 72862801, now seen corresponding path program 1 times [2024-11-08 12:01:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:01:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132658540] [2024-11-08 12:01:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:01:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:01:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:01:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:01:59,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:01:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132658540] [2024-11-08 12:01:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132658540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:01:59,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:01:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:01:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801932708] [2024-11-08 12:01:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:01:59,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:01:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:01:59,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:01:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:01:59,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:59,857 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:01:59,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:01:59,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:01:59,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:01,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:01,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-08 12:02:01,298 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:02:01,298 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of12ForFork0 was SAFE (10/13) [2024-11-08 12:02:01,301 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:01,302 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:01,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of12ForFork0 ======== [2024-11-08 12:02:01,303 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:01,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:01,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:01,838 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:01,839 INFO L317 ceAbstractionStarter]: Result for error location f2Thread9of12ForFork0 was SAFE (11/13) [2024-11-08 12:02:01,843 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:01,845 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:01,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of12ForFork0 ======== [2024-11-08 12:02:01,846 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:01,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:02,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:02,381 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:02,381 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of12ForFork0 was SAFE (12/13) [2024-11-08 12:02:02,385 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:02,386 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:02,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:02:02,387 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:02,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:02:02,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:02,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1972746721, now seen corresponding path program 1 times [2024-11-08 12:02:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667850168] [2024-11-08 12:02:02,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:02,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:02,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:02,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667850168] [2024-11-08 12:02:02,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667850168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:02,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:02,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:02,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295555016] [2024-11-08 12:02:02,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:02,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:02,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:02,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:02,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:02,434 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:02,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:02:02,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:02,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-08 12:02:02,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:02,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash 156482021, now seen corresponding path program 1 times [2024-11-08 12:02:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:02,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503876180] [2024-11-08 12:02:02,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:02,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:02,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503876180] [2024-11-08 12:02:02,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503876180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:02,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:02,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:02,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499565508] [2024-11-08 12:02:02,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:02,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:02,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:02,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:02,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:02,491 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:02,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:02:02,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:02,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:03,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-08 12:02:03,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:03,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1253311545, now seen corresponding path program 1 times [2024-11-08 12:02:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79647235] [2024-11-08 12:02:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:02:03,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:02:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:02:03,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:02:03,550 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:02:03,550 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:02:03,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:02:03,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:02:03,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:02:03,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:02:03,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:02:03,551 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:02:03,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-08 12:02:03,569 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:02:03,569 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (13/13) [2024-11-08 12:02:03,569 WARN L244 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:02:03,569 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-11-08 12:02:03,655 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:02:03,660 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:03,661 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:03,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread13of13ForFork0 ======== [2024-11-08 12:02:03,662 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:03,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:04,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:04,324 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:04,324 INFO L317 ceAbstractionStarter]: Result for error location f2Thread13of13ForFork0 was SAFE (1/14) [2024-11-08 12:02:04,327 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:04,328 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:04,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of13ForFork0 ======== [2024-11-08 12:02:04,329 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:04,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:04,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:04,884 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:04,884 INFO L317 ceAbstractionStarter]: Result for error location f2Thread7of13ForFork0 was SAFE (2/14) [2024-11-08 12:02:04,888 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:04,889 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:04,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of13ForFork0 ======== [2024-11-08 12:02:04,890 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:04,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:05,725 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:05,738 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:05,738 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of13ForFork0 was SAFE (3/14) [2024-11-08 12:02:05,743 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:05,744 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:05,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of13ForFork0 ======== [2024-11-08 12:02:05,745 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:05,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:06,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:06,545 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:06,546 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of13ForFork0 was SAFE (4/14) [2024-11-08 12:02:06,550 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:06,552 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:06,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of13ForFork0 ======== [2024-11-08 12:02:06,552 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:06,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:07,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:07,360 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:07,360 INFO L317 ceAbstractionStarter]: Result for error location f2Thread10of13ForFork0 was SAFE (5/14) [2024-11-08 12:02:07,365 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:07,366 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:07,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of13ForFork0 ======== [2024-11-08 12:02:07,366 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:07,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:08,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:08,147 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:08,148 INFO L317 ceAbstractionStarter]: Result for error location f2Thread12of13ForFork0 was SAFE (6/14) [2024-11-08 12:02:08,152 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:08,153 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:08,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of13ForFork0 ======== [2024-11-08 12:02:08,154 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:08,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:08,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:08,717 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:08,717 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of13ForFork0 was SAFE (7/14) [2024-11-08 12:02:08,721 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:08,723 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:08,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of13ForFork0 ======== [2024-11-08 12:02:08,724 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:08,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:09,413 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:09,426 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:09,426 INFO L317 ceAbstractionStarter]: Result for error location f2Thread11of13ForFork0 was SAFE (8/14) [2024-11-08 12:02:09,430 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:09,432 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:09,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of13ForFork0 ======== [2024-11-08 12:02:09,432 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:09,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:09,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:02:09,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash 351861841, now seen corresponding path program 1 times [2024-11-08 12:02:09,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:09,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381883131] [2024-11-08 12:02:09,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:09,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:09,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:09,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381883131] [2024-11-08 12:02:09,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381883131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:09,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:09,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:09,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145520029] [2024-11-08 12:02:09,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:09,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:02:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:02:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:02:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:09,684 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:09,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:02:09,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:09,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-08 12:02:09,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:02:09,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2104900553, now seen corresponding path program 1 times [2024-11-08 12:02:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:09,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291825955] [2024-11-08 12:02:09,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:09,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:09,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291825955] [2024-11-08 12:02:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291825955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:09,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:09,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812182049] [2024-11-08 12:02:09,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:09,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:09,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:09,800 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:09,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:02:09,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:09,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:10,851 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:10,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-08 12:02:10,865 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:02:10,865 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of13ForFork0 was SAFE (9/14) [2024-11-08 12:02:10,869 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:10,871 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:10,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of13ForFork0 ======== [2024-11-08 12:02:10,871 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:10,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:11,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:11,477 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:11,478 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of13ForFork0 was SAFE (10/14) [2024-11-08 12:02:11,480 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:11,481 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:11,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of13ForFork0 ======== [2024-11-08 12:02:11,482 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:11,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:12,167 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:12,181 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:12,181 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of13ForFork0 was SAFE (11/14) [2024-11-08 12:02:12,186 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:12,187 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:12,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of13ForFork0 ======== [2024-11-08 12:02:12,188 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:12,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:12,909 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:12,924 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:12,924 INFO L317 ceAbstractionStarter]: Result for error location f2Thread8of13ForFork0 was SAFE (12/14) [2024-11-08 12:02:12,927 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:12,928 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:12,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of13ForFork0 ======== [2024-11-08 12:02:12,928 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:12,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:13,501 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:13,515 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:13,516 INFO L317 ceAbstractionStarter]: Result for error location f2Thread9of13ForFork0 was SAFE (13/14) [2024-11-08 12:02:13,519 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:13,520 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:13,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:02:13,521 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:13,521 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:02:13,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:13,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1122005535, now seen corresponding path program 1 times [2024-11-08 12:02:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:13,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391962510] [2024-11-08 12:02:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:13,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:13,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:13,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391962510] [2024-11-08 12:02:13,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391962510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:13,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:13,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:13,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480012607] [2024-11-08 12:02:13,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:13,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:13,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:13,568 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:13,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:02:13,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:13,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-08 12:02:13,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:13,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash 480887525, now seen corresponding path program 1 times [2024-11-08 12:02:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905693651] [2024-11-08 12:02:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:13,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:13,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905693651] [2024-11-08 12:02:13,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905693651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:13,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:13,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:13,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406077188] [2024-11-08 12:02:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:13,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:13,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:13,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:13,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:13,626 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:13,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:02:13,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:13,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:14,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-08 12:02:14,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:14,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1167461985, now seen corresponding path program 1 times [2024-11-08 12:02:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012863834] [2024-11-08 12:02:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:02:14,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:02:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:02:15,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:02:15,052 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:02:15,052 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:02:15,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:02:15,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:02:15,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:02:15,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:02:15,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:02:15,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:02:15,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-08 12:02:15,078 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:02:15,078 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (14/14) [2024-11-08 12:02:15,078 WARN L244 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:02:15,078 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-11-08 12:02:15,196 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:02:15,204 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:15,206 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:15,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread13of14ForFork0 ======== [2024-11-08 12:02:15,206 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:15,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:16,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:16,216 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:16,216 INFO L317 ceAbstractionStarter]: Result for error location f2Thread13of14ForFork0 was SAFE (1/15) [2024-11-08 12:02:16,221 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:16,222 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:16,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread14of14ForFork0 ======== [2024-11-08 12:02:16,223 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:16,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:17,062 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:17,076 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:17,076 INFO L317 ceAbstractionStarter]: Result for error location f2Thread14of14ForFork0 was SAFE (2/15) [2024-11-08 12:02:17,080 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:17,081 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:17,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of14ForFork0 ======== [2024-11-08 12:02:17,081 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:17,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:17,793 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:17,808 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:17,808 INFO L317 ceAbstractionStarter]: Result for error location f2Thread11of14ForFork0 was SAFE (3/15) [2024-11-08 12:02:17,811 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:17,813 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:17,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of14ForFork0 ======== [2024-11-08 12:02:17,814 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:17,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:18,767 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:18,782 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:18,782 INFO L317 ceAbstractionStarter]: Result for error location f2Thread12of14ForFork0 was SAFE (4/15) [2024-11-08 12:02:18,785 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:18,786 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:18,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of14ForFork0 ======== [2024-11-08 12:02:18,787 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:18,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:19,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:19,508 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:19,508 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of14ForFork0 was SAFE (5/15) [2024-11-08 12:02:19,512 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:19,513 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:19,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of14ForFork0 ======== [2024-11-08 12:02:19,514 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:19,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:20,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:20,375 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:20,375 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of14ForFork0 was SAFE (6/15) [2024-11-08 12:02:20,378 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:20,379 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:20,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of14ForFork0 ======== [2024-11-08 12:02:20,380 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:20,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:21,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:21,089 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:21,090 INFO L317 ceAbstractionStarter]: Result for error location f2Thread10of14ForFork0 was SAFE (7/15) [2024-11-08 12:02:21,093 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:21,095 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:21,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of14ForFork0 ======== [2024-11-08 12:02:21,096 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:21,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:22,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:22,057 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:22,057 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of14ForFork0 was SAFE (8/15) [2024-11-08 12:02:22,060 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:22,061 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:22,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of14ForFork0 ======== [2024-11-08 12:02:22,061 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:22,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:23,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:23,179 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:23,179 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of14ForFork0 was SAFE (9/15) [2024-11-08 12:02:23,186 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:23,188 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:23,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of14ForFork0 ======== [2024-11-08 12:02:23,189 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:23,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:24,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:24,165 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:24,165 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of14ForFork0 was SAFE (10/15) [2024-11-08 12:02:24,168 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:24,169 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:24,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of14ForFork0 ======== [2024-11-08 12:02:24,170 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:24,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:24,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:02:24,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash -602050827, now seen corresponding path program 1 times [2024-11-08 12:02:24,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:24,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292829996] [2024-11-08 12:02:24,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:24,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:24,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:24,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292829996] [2024-11-08 12:02:24,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292829996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:24,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:24,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:24,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174753654] [2024-11-08 12:02:24,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:24,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:02:24,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:24,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:02:24,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:02:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:24,400 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:24,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:02:24,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:24,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-08 12:02:24,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:02:24,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:24,468 INFO L85 PathProgramCache]: Analyzing trace with hash 545083139, now seen corresponding path program 1 times [2024-11-08 12:02:24,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:24,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864481324] [2024-11-08 12:02:24,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:24,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864481324] [2024-11-08 12:02:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864481324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099018856] [2024-11-08 12:02:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:24,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:24,528 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:24,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:02:24,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:24,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:26,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:26,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:26,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-08 12:02:26,094 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:02:26,095 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of14ForFork0 was SAFE (11/15) [2024-11-08 12:02:26,098 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:26,099 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:26,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of14ForFork0 ======== [2024-11-08 12:02:26,099 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:26,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:26,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:26,835 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:26,835 INFO L317 ceAbstractionStarter]: Result for error location f2Thread7of14ForFork0 was SAFE (12/15) [2024-11-08 12:02:26,840 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:26,841 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:26,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of14ForFork0 ======== [2024-11-08 12:02:26,842 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:26,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:27,631 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:27,648 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:27,648 INFO L317 ceAbstractionStarter]: Result for error location f2Thread8of14ForFork0 was SAFE (13/15) [2024-11-08 12:02:27,651 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:27,652 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:27,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of14ForFork0 ======== [2024-11-08 12:02:27,653 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:27,653 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:28,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:28,348 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:28,348 INFO L317 ceAbstractionStarter]: Result for error location f2Thread9of14ForFork0 was SAFE (14/15) [2024-11-08 12:02:28,351 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:28,352 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:28,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:02:28,353 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:28,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:02:28,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:28,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:28,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2003821537, now seen corresponding path program 1 times [2024-11-08 12:02:28,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:28,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353101879] [2024-11-08 12:02:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:28,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353101879] [2024-11-08 12:02:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353101879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:28,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:28,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:28,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020596132] [2024-11-08 12:02:28,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:28,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:28,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:28,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:28,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:28,403 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:28,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:02:28,403 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:28,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-08 12:02:28,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:28,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash -105558427, now seen corresponding path program 1 times [2024-11-08 12:02:28,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:28,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648275884] [2024-11-08 12:02:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:28,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:28,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:28,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648275884] [2024-11-08 12:02:28,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648275884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:28,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523700206] [2024-11-08 12:02:28,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:28,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:28,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:28,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:28,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:28,459 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:28,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:02:28,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:28,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:29,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-08 12:02:29,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:29,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:29,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1786370964, now seen corresponding path program 1 times [2024-11-08 12:02:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:29,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780811280] [2024-11-08 12:02:29,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:02:29,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:02:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:02:29,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:02:29,598 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:02:29,599 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:02:29,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:02:29,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:02:29,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:02:29,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:02:29,599 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:02:29,600 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:02:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-08 12:02:29,628 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:02:29,628 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (15/15) [2024-11-08 12:02:29,628 WARN L244 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:02:29,628 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-11-08 12:02:29,716 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:02:29,720 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:29,721 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:29,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of15ForFork0 ======== [2024-11-08 12:02:29,722 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:29,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:30,710 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:30,728 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:30,728 INFO L317 ceAbstractionStarter]: Result for error location f2Thread12of15ForFork0 was SAFE (1/16) [2024-11-08 12:02:30,732 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:30,733 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:30,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of15ForFork0 ======== [2024-11-08 12:02:30,734 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:30,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:31,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:31,800 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:31,800 INFO L317 ceAbstractionStarter]: Result for error location f2Thread11of15ForFork0 was SAFE (2/16) [2024-11-08 12:02:31,803 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:31,804 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:31,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread13of15ForFork0 ======== [2024-11-08 12:02:31,805 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:31,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:32,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:32,737 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:32,737 INFO L317 ceAbstractionStarter]: Result for error location f2Thread13of15ForFork0 was SAFE (3/16) [2024-11-08 12:02:32,740 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:32,741 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:32,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of15ForFork0 ======== [2024-11-08 12:02:32,742 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:32,742 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:33,628 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:33,647 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:33,647 INFO L317 ceAbstractionStarter]: Result for error location f2Thread10of15ForFork0 was SAFE (4/16) [2024-11-08 12:02:33,650 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:33,651 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:33,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread14of15ForFork0 ======== [2024-11-08 12:02:33,651 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:33,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:35,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:35,097 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:35,097 INFO L317 ceAbstractionStarter]: Result for error location f2Thread14of15ForFork0 was SAFE (5/16) [2024-11-08 12:02:35,100 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:35,101 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:35,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of15ForFork0 ======== [2024-11-08 12:02:35,101 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:35,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:36,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:36,222 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:36,222 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of15ForFork0 was SAFE (6/16) [2024-11-08 12:02:36,227 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:36,228 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:36,229 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of15ForFork0 ======== [2024-11-08 12:02:36,229 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:36,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:37,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:37,151 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:37,151 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of15ForFork0 was SAFE (7/16) [2024-11-08 12:02:37,154 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:37,155 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:37,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of15ForFork0 ======== [2024-11-08 12:02:37,156 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:37,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:38,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:38,205 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:38,205 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of15ForFork0 was SAFE (8/16) [2024-11-08 12:02:38,208 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:38,209 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:38,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of15ForFork0 ======== [2024-11-08 12:02:38,210 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:38,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:38,385 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:02:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1030795801, now seen corresponding path program 1 times [2024-11-08 12:02:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616748103] [2024-11-08 12:02:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:38,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:38,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616748103] [2024-11-08 12:02:38,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616748103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:38,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:38,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:38,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473664635] [2024-11-08 12:02:38,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:38,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:02:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:02:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:02:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:38,435 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:38,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:02:38,436 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:38,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-08 12:02:38,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:02:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash -283402729, now seen corresponding path program 1 times [2024-11-08 12:02:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:38,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936944496] [2024-11-08 12:02:38,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:38,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936944496] [2024-11-08 12:02:38,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936944496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:38,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:38,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880843590] [2024-11-08 12:02:38,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:38,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:38,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:38,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:38,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:38,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:38,571 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:38,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:02:38,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:38,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:40,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:40,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:40,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:40,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-08 12:02:40,404 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:02:40,405 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of15ForFork0 was SAFE (9/16) [2024-11-08 12:02:40,407 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:40,408 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:40,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of15ForFork0 ======== [2024-11-08 12:02:40,408 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:40,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:41,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:41,387 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:41,387 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of15ForFork0 was SAFE (10/16) [2024-11-08 12:02:41,390 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:41,391 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:41,391 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of15ForFork0 ======== [2024-11-08 12:02:41,391 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:41,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:42,245 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:42,266 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:42,266 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of15ForFork0 was SAFE (11/16) [2024-11-08 12:02:42,271 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:42,272 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:42,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of15ForFork0 ======== [2024-11-08 12:02:42,272 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:42,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:43,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:43,609 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:43,609 INFO L317 ceAbstractionStarter]: Result for error location f2Thread7of15ForFork0 was SAFE (12/16) [2024-11-08 12:02:43,616 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:43,618 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:43,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of15ForFork0 ======== [2024-11-08 12:02:43,619 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:43,619 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:44,558 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:44,580 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:44,580 INFO L317 ceAbstractionStarter]: Result for error location f2Thread8of15ForFork0 was SAFE (13/16) [2024-11-08 12:02:44,583 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:44,584 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:44,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:02:44,585 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:44,585 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:02:44,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:44,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash 406967265, now seen corresponding path program 1 times [2024-11-08 12:02:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:44,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200303801] [2024-11-08 12:02:44,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:44,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200303801] [2024-11-08 12:02:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200303801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:44,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:44,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:44,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494086982] [2024-11-08 12:02:44,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:44,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:44,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:44,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:44,640 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:44,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:02:44,640 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:44,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-11-08 12:02:44,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:44,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash 284211813, now seen corresponding path program 1 times [2024-11-08 12:02:44,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:44,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370482921] [2024-11-08 12:02:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:44,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:44,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370482921] [2024-11-08 12:02:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370482921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:44,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:44,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312790861] [2024-11-08 12:02:44,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:44,713 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:44,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:02:44,713 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:44,714 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:45,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:45,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-08 12:02:45,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:02:45,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:45,992 INFO L85 PathProgramCache]: Analyzing trace with hash 200135186, now seen corresponding path program 1 times [2024-11-08 12:02:45,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:45,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741340950] [2024-11-08 12:02:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:02:46,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:02:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:02:46,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:02:46,111 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:02:46,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:02:46,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:02:46,111 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:02:46,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:02:46,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:02:46,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:02:46,112 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:02:46,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-08 12:02:46,144 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:02:46,144 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (14/16) [2024-11-08 12:02:46,144 WARN L244 ceAbstractionStarter]: 15 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:02:46,144 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 16 thread instances. [2024-11-08 12:02:46,234 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:02:46,238 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:46,240 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:46,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of16ForFork0 ======== [2024-11-08 12:02:46,240 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:46,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:47,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:47,378 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:47,378 INFO L317 ceAbstractionStarter]: Result for error location f2Thread10of16ForFork0 was SAFE (1/17) [2024-11-08 12:02:47,381 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:47,382 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:47,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of16ForFork0 ======== [2024-11-08 12:02:47,383 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:47,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:48,651 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:48,673 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:48,673 INFO L317 ceAbstractionStarter]: Result for error location f2Thread12of16ForFork0 was SAFE (2/17) [2024-11-08 12:02:48,676 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:48,677 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:48,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread13of16ForFork0 ======== [2024-11-08 12:02:48,677 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:48,677 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:49,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:49,725 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:49,725 INFO L317 ceAbstractionStarter]: Result for error location f2Thread13of16ForFork0 was SAFE (3/17) [2024-11-08 12:02:49,727 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:49,728 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:49,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of16ForFork0 ======== [2024-11-08 12:02:49,729 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:49,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:50,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:50,895 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:50,895 INFO L317 ceAbstractionStarter]: Result for error location f2Thread11of16ForFork0 was SAFE (4/17) [2024-11-08 12:02:50,899 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:50,900 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:50,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of16ForFork0 ======== [2024-11-08 12:02:50,901 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:50,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:51,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:51,996 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:51,997 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of16ForFork0 was SAFE (5/17) [2024-11-08 12:02:52,000 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:52,001 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:52,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of16ForFork0 ======== [2024-11-08 12:02:52,002 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:52,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:53,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:53,294 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:53,294 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of16ForFork0 was SAFE (6/17) [2024-11-08 12:02:53,297 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:53,298 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:53,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of16ForFork0 ======== [2024-11-08 12:02:53,298 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:53,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:54,443 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:54,468 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:54,468 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of16ForFork0 was SAFE (7/17) [2024-11-08 12:02:54,471 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:54,472 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:54,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of16ForFork0 ======== [2024-11-08 12:02:54,472 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:54,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:54,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:02:54,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1276289213, now seen corresponding path program 1 times [2024-11-08 12:02:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376555871] [2024-11-08 12:02:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:54,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:54,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376555871] [2024-11-08 12:02:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376555871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:54,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:54,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:54,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039482791] [2024-11-08 12:02:54,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:54,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:02:54,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:54,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:02:54,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:02:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:54,711 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:54,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:02:54,711 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:54,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-08 12:02:54,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:02:54,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:02:54,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1167539791, now seen corresponding path program 1 times [2024-11-08 12:02:54,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:02:54,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117384138] [2024-11-08 12:02:54,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:02:54,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:02:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:02:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:02:54,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:02:54,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117384138] [2024-11-08 12:02:54,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117384138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:02:54,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:02:54,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:02:54,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221459566] [2024-11-08 12:02:54,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:02:54,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:02:54,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:02:54,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:02:54,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:02:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:54,834 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:02:54,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:02:54,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:54,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:02:56,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:02:56,785 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:56,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-11-08 12:02:56,810 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:02:56,810 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of16ForFork0 was SAFE (8/17) [2024-11-08 12:02:56,815 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:56,816 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:56,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of16ForFork0 ======== [2024-11-08 12:02:56,817 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:56,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:58,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:58,128 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:58,128 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of16ForFork0 was SAFE (9/17) [2024-11-08 12:02:58,133 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:58,135 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:58,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of16ForFork0 ======== [2024-11-08 12:02:58,136 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:58,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:02:59,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:02:59,401 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:02:59,401 INFO L317 ceAbstractionStarter]: Result for error location f2Thread6of16ForFork0 was SAFE (10/17) [2024-11-08 12:02:59,404 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:59,405 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:02:59,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread16of16ForFork0 ======== [2024-11-08 12:02:59,406 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:02:59,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:00,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:00,538 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:00,538 INFO L317 ceAbstractionStarter]: Result for error location f2Thread16of16ForFork0 was SAFE (11/17) [2024-11-08 12:03:00,541 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:00,542 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:00,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of16ForFork0 ======== [2024-11-08 12:03:00,543 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:00,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:01,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:01,806 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:01,807 INFO L317 ceAbstractionStarter]: Result for error location f2Thread8of16ForFork0 was SAFE (12/17) [2024-11-08 12:03:01,811 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:01,813 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:01,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread14of16ForFork0 ======== [2024-11-08 12:03:01,813 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:01,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:02,826 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:02,861 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:02,861 INFO L317 ceAbstractionStarter]: Result for error location f2Thread14of16ForFork0 was SAFE (13/17) [2024-11-08 12:03:02,866 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:02,867 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:02,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:03:02,868 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:02,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:03:02,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:03:02,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:03:02,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1778218527, now seen corresponding path program 1 times [2024-11-08 12:03:02,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:03:02,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718312774] [2024-11-08 12:03:02,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:02,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:03:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:03:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:03:02,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718312774] [2024-11-08 12:03:02,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718312774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:03:02,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:03:02,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:03:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766969112] [2024-11-08 12:03:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:03:02,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:03:02,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:03:02,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:03:02,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:03:02,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:02,928 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:03:02,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:03:02,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:02,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-11-08 12:03:02,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:03:02,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:03:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1001734683, now seen corresponding path program 1 times [2024-11-08 12:03:02,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:03:02,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991338700] [2024-11-08 12:03:02,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:03:02,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-11-08 12:03:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:03:02,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991338700] [2024-11-08 12:03:02,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991338700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:03:02,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:03:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:03:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381309924] [2024-11-08 12:03:02,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:03:02,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:03:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:03:02,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:03:02,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:03:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:03,002 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:03:03,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:03:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:03,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:04,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:04,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:04,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-11-08 12:03:04,545 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:03:04,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:03:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash 374811419, now seen corresponding path program 1 times [2024-11-08 12:03:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:03:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148125370] [2024-11-08 12:03:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:03:04,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:03:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:03:04,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:03:04,679 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:03:04,679 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:03:04,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:03:04,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:03:04,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:03:04,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:03:04,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:03:04,680 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:03:04,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-11-08 12:03:04,718 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:03:04,718 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (14/17) [2024-11-08 12:03:04,719 WARN L244 ceAbstractionStarter]: 16 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:03:04,719 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 17 thread instances. [2024-11-08 12:03:04,815 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:03:04,819 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:04,821 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:04,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of17ForFork0 ======== [2024-11-08 12:03:04,822 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:04,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:06,411 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:06,436 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:06,437 INFO L317 ceAbstractionStarter]: Result for error location f2Thread11of17ForFork0 was SAFE (1/18) [2024-11-08 12:03:06,440 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:06,441 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:06,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of17ForFork0 ======== [2024-11-08 12:03:06,441 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:06,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:07,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:07,717 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:07,717 INFO L317 ceAbstractionStarter]: Result for error location f2Thread9of17ForFork0 was SAFE (2/18) [2024-11-08 12:03:07,720 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:07,721 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:07,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of17ForFork0 ======== [2024-11-08 12:03:07,721 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:07,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:09,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:09,037 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:09,037 INFO L317 ceAbstractionStarter]: Result for error location f2Thread10of17ForFork0 was SAFE (3/18) [2024-11-08 12:03:09,040 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:09,041 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:09,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of17ForFork0 ======== [2024-11-08 12:03:09,041 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:09,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:10,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:10,446 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:10,446 INFO L317 ceAbstractionStarter]: Result for error location f2Thread3of17ForFork0 was SAFE (4/18) [2024-11-08 12:03:10,449 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:10,450 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:10,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of17ForFork0 ======== [2024-11-08 12:03:10,450 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:10,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:11,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:11,716 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:11,716 INFO L317 ceAbstractionStarter]: Result for error location f2Thread2of17ForFork0 was SAFE (5/18) [2024-11-08 12:03:11,719 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:11,720 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:11,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of17ForFork0 ======== [2024-11-08 12:03:11,721 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:11,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:11,920 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:03:11,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:03:11,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1090224289, now seen corresponding path program 1 times [2024-11-08 12:03:11,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:03:11,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324997333] [2024-11-08 12:03:11,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:03:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:03:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:03:11,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324997333] [2024-11-08 12:03:11,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324997333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:03:11,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:03:11,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:03:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790256617] [2024-11-08 12:03:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:03:11,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:03:11,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:03:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:03:11,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:03:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:11,962 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:03:11,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-11-08 12:03:11,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:12,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:12,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-11-08 12:03:12,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-08 12:03:12,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:03:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2007227320, now seen corresponding path program 1 times [2024-11-08 12:03:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:03:12,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396790688] [2024-11-08 12:03:12,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:03:12,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-11-08 12:03:12,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:03:12,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396790688] [2024-11-08 12:03:12,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396790688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:03:12,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:03:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:03:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951918976] [2024-11-08 12:03:12,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:03:12,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:03:12,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:03:12,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:03:12,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:03:12,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:12,094 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:03:12,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 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-11-08 12:03:12,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:12,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:14,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:14,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:14,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-11-08 12:03:14,571 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 12:03:14,571 INFO L317 ceAbstractionStarter]: Result for error location f2Thread1of17ForFork0 was SAFE (6/18) [2024-11-08 12:03:14,577 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:14,578 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:14,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread16of17ForFork0 ======== [2024-11-08 12:03:14,579 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:14,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:15,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:15,950 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:15,950 INFO L317 ceAbstractionStarter]: Result for error location f2Thread16of17ForFork0 was SAFE (7/18) [2024-11-08 12:03:15,953 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:15,954 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:15,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread17of17ForFork0 ======== [2024-11-08 12:03:15,954 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:15,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:17,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:17,434 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:17,435 INFO L317 ceAbstractionStarter]: Result for error location f2Thread17of17ForFork0 was SAFE (8/18) [2024-11-08 12:03:17,438 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:17,438 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:17,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of17ForFork0 ======== [2024-11-08 12:03:17,439 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:17,439 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:18,668 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:18,696 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:18,697 INFO L317 ceAbstractionStarter]: Result for error location f2Thread4of17ForFork0 was SAFE (9/18) [2024-11-08 12:03:18,700 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:18,701 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:18,701 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread15of17ForFork0 ======== [2024-11-08 12:03:18,701 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:18,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:20,037 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:20,065 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:20,066 INFO L317 ceAbstractionStarter]: Result for error location f2Thread15of17ForFork0 was SAFE (10/18) [2024-11-08 12:03:20,069 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:20,070 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:20,071 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of17ForFork0 ======== [2024-11-08 12:03:20,071 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:20,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:21,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:21,471 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:21,471 INFO L317 ceAbstractionStarter]: Result for error location f2Thread5of17ForFork0 was SAFE (11/18) [2024-11-08 12:03:21,476 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:21,477 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:21,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-08 12:03:21,478 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:21,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-08 12:03:21,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:03:21,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:03:21,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2127961313, now seen corresponding path program 1 times [2024-11-08 12:03:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:03:21,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85179771] [2024-11-08 12:03:21,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:03:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:03:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:03:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85179771] [2024-11-08 12:03:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85179771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:03:21,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:03:21,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:03:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722900765] [2024-11-08 12:03:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:03:21,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:03:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:03:21,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:03:21,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:03:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:21,550 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:03:21,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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-11-08 12:03:21,551 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:21,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:21,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-11-08 12:03:21,562 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:03:21,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:03:21,562 INFO L85 PathProgramCache]: Analyzing trace with hash 890127781, now seen corresponding path program 1 times [2024-11-08 12:03:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:03:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490117089] [2024-11-08 12:03:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:21,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:03:21,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:03:21,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:03:21,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490117089] [2024-11-08 12:03:21,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490117089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:03:21,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:03:21,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:03:21,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362033619] [2024-11-08 12:03:21,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:03:21,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 12:03:21,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:03:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 12:03:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 12:03:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:21,629 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-08 12:03:21,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-08 12:03:21,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:21,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:03:23,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 12:03:23,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-11-08 12:03:23,200 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-08 12:03:23,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:03:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash -123049009, now seen corresponding path program 1 times [2024-11-08 12:03:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:03:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179172854] [2024-11-08 12:03:23,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:03:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:03:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:03:23,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:03:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:03:23,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:03:23,346 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:03:23,346 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-08 12:03:23,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-08 12:03:23,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-08 12:03:23,346 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-08 12:03:23,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-08 12:03:23,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-08 12:03:23,347 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-08 12:03:23,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-11-08 12:03:23,393 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:03:23,394 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (12/18) [2024-11-08 12:03:23,394 WARN L244 ceAbstractionStarter]: 17 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-08 12:03:23,394 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 18 thread instances. [2024-11-08 12:03:23,496 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-08 12:03:23,501 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:23,502 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:23,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of18ForFork0 ======== [2024-11-08 12:03:23,503 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:23,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:25,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:25,265 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:25,265 INFO L317 ceAbstractionStarter]: Result for error location f2Thread8of18ForFork0 was SAFE (1/19) [2024-11-08 12:03:25,268 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:25,269 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:25,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of18ForFork0 ======== [2024-11-08 12:03:25,269 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:25,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:03:26,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-08 12:03:26,804 INFO L407 BasicCegarLoop]: Path program histogram: [] [2024-11-08 12:03:26,805 INFO L317 ceAbstractionStarter]: Result for error location f2Thread9of18ForFork0 was SAFE (2/19) [2024-11-08 12:03:26,808 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:26,809 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-08 12:03:26,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of18ForFork0 ======== [2024-11-08 12:03:26,809 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;@339aa294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:03:26,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.