./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-theta/unwind3-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e523f48 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/config/GemCutterReach.xml -i ../../sv-benchmarks/c/pthread-theta/unwind3-100.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y --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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-5e523f4 [2024-11-21 00:41:03,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 00:41:03,918 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2024-11-21 00:41:03,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 00:41:03,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 00:41:03,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 00:41:03,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 00:41:03,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 00:41:03,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 00:41:03,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 00:41:03,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 00:41:03,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 00:41:03,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 00:41:03,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 00:41:03,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 00:41:03,971 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 00:41:03,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 00:41:03,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 00:41:03,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 00:41:03,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 00:41:03,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 00:41:03,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 00:41:03,973 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-21 00:41:03,973 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-21 00:41:03,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 00:41:03,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 00:41:03,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-21 00:41:03,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 00:41:03,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 00:41:03,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 00:41:03,974 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-11-21 00:41:03,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 00:41:03,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:41:03,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 00:41:03,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 00:41:03,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-21 00:41:03,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 00:41:03,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 00:41:03,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 00:41:03,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 00:41:03,976 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-21 00:41:03,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-21 00:41:03,976 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-21 00:41:03,976 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-21 00:41:03,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2024-11-21 00:41:04,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 00:41:04,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 00:41:04,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 00:41:04,363 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 00:41:04,363 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 00:41:04,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/../../sv-benchmarks/c/pthread-theta/unwind3-100.i [2024-11-21 00:41:07,481 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/data/3626299b0/6ddc32a937f34274a40eb48e335dbec0/FLAGe505b0034 [2024-11-21 00:41:07,814 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 00:41:07,815 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/sv-benchmarks/c/pthread-theta/unwind3-100.i [2024-11-21 00:41:07,831 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/data/3626299b0/6ddc32a937f34274a40eb48e335dbec0/FLAGe505b0034 [2024-11-21 00:41:07,846 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/data/3626299b0/6ddc32a937f34274a40eb48e335dbec0 [2024-11-21 00:41:07,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 00:41:07,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 00:41:07,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 00:41:07,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 00:41:07,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 00:41:07,858 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:41:07" (1/1) ... [2024-11-21 00:41:07,859 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f0abe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:07, skipping insertion in model container [2024-11-21 00:41:07,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:41:07" (1/1) ... [2024-11-21 00:41:07,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 00:41:08,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:41:08,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 00:41:08,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 00:41:08,408 INFO L204 MainTranslator]: Completed translation [2024-11-21 00:41:08,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08 WrapperNode [2024-11-21 00:41:08,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 00:41:08,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 00:41:08,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 00:41:08,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 00:41:08,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,429 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,448 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2024-11-21 00:41:08,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 00:41:08,449 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 00:41:08,449 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 00:41:08,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 00:41:08,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,466 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 00:41:08,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 00:41:08,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 00:41:08,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 00:41:08,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (1/1) ... [2024-11-21 00:41:08,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-21 00:41:08,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:41:08,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-21 00:41:08,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-21 00:41:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 00:41:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-21 00:41:08,549 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-21 00:41:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-21 00:41:08,549 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-21 00:41:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-21 00:41:08,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 00:41:08,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 00:41:08,551 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-21 00:41:08,699 INFO L234 CfgBuilder]: Building ICFG [2024-11-21 00:41:08,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 00:41:08,965 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-21 00:41:08,968 INFO L283 CfgBuilder]: Performing block encoding [2024-11-21 00:41:08,982 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 00:41:08,984 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 00:41:08,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:41:08 BoogieIcfgContainer [2024-11-21 00:41:08,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 00:41:08,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 00:41:08,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 00:41:08,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 00:41:08,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:41:07" (1/3) ... [2024-11-21 00:41:08,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561be783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:41:08, skipping insertion in model container [2024-11-21 00:41:08,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:41:08" (2/3) ... [2024-11-21 00:41:08,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561be783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:41:08, skipping insertion in model container [2024-11-21 00:41:08,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:41:08" (3/3) ... [2024-11-21 00:41:09,001 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2024-11-21 00:41:09,020 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 00:41:09,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 99 locations, 1 initial locations, 2 loop locations, and 6 error locations. [2024-11-21 00:41:09,024 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-21 00:41:09,121 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:09,192 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-21 00:41:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/z3 [2024-11-21 00:41:09,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-21 00:41:09,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_abd46281-94ff-4fa2-9a66-075a530ab6fd/bin/ugemcutter-verify-jAHUagO94Y/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-21 00:41:09,310 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:09,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of1ForFork0 ======== [2024-11-21 00:41:09,332 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:09,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:09,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:09,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash -204928758, now seen corresponding path program 1 times [2024-11-21 00:41:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:09,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948210518] [2024-11-21 00:41:09,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:09,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:09,666 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-21 00:41:09,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948210518] [2024-11-21 00:41:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948210518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:09,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:09,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007891561] [2024-11-21 00:41:09,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:09,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:09,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:09,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:09,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:09,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:09,702 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:09,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:09,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:09,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 00:41:09,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:09,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash -546910800, now seen corresponding path program 1 times [2024-11-21 00:41:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247352418] [2024-11-21 00:41:09,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:09,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:10,028 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-21 00:41:10,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:10,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247352418] [2024-11-21 00:41:10,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247352418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:10,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:10,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:10,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331818476] [2024-11-21 00:41:10,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:10,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:10,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:10,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:10,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:10,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,033 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:10,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.0) internal successors, (62), 3 states have internal predecessors, (62), 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-21 00:41:10,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:10,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:10,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 00:41:10,159 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:10,161 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of1ForFork0 was SAFE (1/2) [2024-11-21 00:41:10,168 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:10,176 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:10,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:10,177 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:10,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:10,183 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-21 00:41:10,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2021035666, now seen corresponding path program 1 times [2024-11-21 00:41:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:10,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151791991] [2024-11-21 00:41:10,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:10,262 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-21 00:41:10,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:10,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151791991] [2024-11-21 00:41:10,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151791991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:10,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:10,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:10,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328876533] [2024-11-21 00:41:10,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:10,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:10,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:10,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:10,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,265 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:10,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:10,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:10,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 00:41:10,296 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-21 00:41:10,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:10,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1821698311, now seen corresponding path program 1 times [2024-11-21 00:41:10,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:10,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233762806] [2024-11-21 00:41:10,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:10,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:10,355 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-21 00:41:10,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:10,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233762806] [2024-11-21 00:41:10,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233762806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:10,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:10,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:10,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473751308] [2024-11-21 00:41:10,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:10,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:10,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:10,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:10,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:10,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,358 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:10,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:10,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:10,359 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:10,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:10,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 00:41:10,523 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-21 00:41:10,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1353324858, now seen corresponding path program 1 times [2024-11-21 00:41:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5495657] [2024-11-21 00:41:10,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:10,562 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:10,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:10,608 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:10,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:10,608 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:10,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:10,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:10,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:10,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:10,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:10,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 00:41:10,611 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:10,612 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-11-21 00:41:10,612 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:10,615 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-21 00:41:10,699 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:10,707 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:10,722 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:10,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:10,725 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:10,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:10,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-21 00:41:10,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash -294988722, now seen corresponding path program 1 times [2024-11-21 00:41:10,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:10,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451399493] [2024-11-21 00:41:10,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:10,772 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-21 00:41:10,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:10,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451399493] [2024-11-21 00:41:10,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451399493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:10,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:10,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:10,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652406563] [2024-11-21 00:41:10,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:10,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:10,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:10,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:10,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:10,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,775 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:10,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:10,775 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:10,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 00:41:10,795 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-21 00:41:10,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash -505354454, now seen corresponding path program 1 times [2024-11-21 00:41:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:10,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141503034] [2024-11-21 00:41:10,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:10,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:10,834 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-21 00:41:10,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:10,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141503034] [2024-11-21 00:41:10,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141503034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:10,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:10,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:10,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263219180] [2024-11-21 00:41:10,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:10,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:10,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:10,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:10,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:10,836 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:10,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:10,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:10,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:11,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:11,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 00:41:11,030 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-21 00:41:11,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1396275732, now seen corresponding path program 1 times [2024-11-21 00:41:11,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:11,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053312094] [2024-11-21 00:41:11,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:11,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:11,049 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:11,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:11,076 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:11,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:11,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:11,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:11,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:11,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:11,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:11,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 00:41:11,080 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:11,081 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2024-11-21 00:41:11,081 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:11,081 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-21 00:41:11,118 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:11,122 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:11,139 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:11,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of3ForFork0 ======== [2024-11-21 00:41:11,140 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:11,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:11,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:11,364 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:11,364 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of3ForFork0 was SAFE (1/4) [2024-11-21 00:41:11,369 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:11,373 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:11,373 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:11,374 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:11,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:11,380 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-21 00:41:11,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash -588439058, now seen corresponding path program 1 times [2024-11-21 00:41:11,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207757170] [2024-11-21 00:41:11,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:11,410 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-21 00:41:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:11,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207757170] [2024-11-21 00:41:11,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207757170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:11,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:11,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128272142] [2024-11-21 00:41:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:11,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:11,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:11,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:11,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:11,416 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:11,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:11,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:11,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 00:41:11,443 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-21 00:41:11,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1869397333, now seen corresponding path program 1 times [2024-11-21 00:41:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640534120] [2024-11-21 00:41:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:11,480 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-21 00:41:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:11,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640534120] [2024-11-21 00:41:11,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640534120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:11,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:11,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:11,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500340479] [2024-11-21 00:41:11,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:11,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:11,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:11,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:11,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:11,482 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:11,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:11,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:11,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:11,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:11,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 00:41:11,746 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-21 00:41:11,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash -132023003, now seen corresponding path program 1 times [2024-11-21 00:41:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521198481] [2024-11-21 00:41:11,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:11,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:11,779 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:11,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:11,817 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:11,817 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:11,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:11,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:11,817 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:11,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:11,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:11,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:11,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 00:41:11,820 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:11,820 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/4) [2024-11-21 00:41:11,820 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:11,820 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-21 00:41:11,877 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:11,883 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:11,908 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:11,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of4ForFork0 ======== [2024-11-21 00:41:11,910 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:11,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:12,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:12,167 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:12,168 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of4ForFork0 was SAFE (1/5) [2024-11-21 00:41:12,171 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:12,172 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:12,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of4ForFork0 ======== [2024-11-21 00:41:12,173 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:12,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:12,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:12,395 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:12,395 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of4ForFork0 was SAFE (2/5) [2024-11-21 00:41:12,400 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:12,401 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:12,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of4ForFork0 ======== [2024-11-21 00:41:12,404 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:12,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:12,577 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:12,580 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:12,580 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of4ForFork0 was SAFE (3/5) [2024-11-21 00:41:12,586 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:12,587 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:12,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of4ForFork0 ======== [2024-11-21 00:41:12,588 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:12,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:12,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:12,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:12,664 INFO L85 PathProgramCache]: Analyzing trace with hash 124645462, now seen corresponding path program 1 times [2024-11-21 00:41:12,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:12,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603718550] [2024-11-21 00:41:12,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:12,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:12,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:12,707 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-21 00:41:12,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:12,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603718550] [2024-11-21 00:41:12,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603718550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:12,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:12,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21176062] [2024-11-21 00:41:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:12,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:12,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:12,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:12,710 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:12,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:12,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:12,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-21 00:41:12,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:12,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash 874549235, now seen corresponding path program 1 times [2024-11-21 00:41:12,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:12,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365544103] [2024-11-21 00:41:12,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:12,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:12,994 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-21 00:41:12,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365544103] [2024-11-21 00:41:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365544103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:12,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:12,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208683079] [2024-11-21 00:41:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:12,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:12,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:12,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:12,998 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:12,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.5) internal successors, (65), 3 states have internal predecessors, (65), 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-21 00:41:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:12,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:13,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:13,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:13,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-21 00:41:13,272 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:13,272 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of4ForFork0 was SAFE (4/5) [2024-11-21 00:41:13,275 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:13,277 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:13,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:13,278 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:13,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:13,280 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-21 00:41:13,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash 151900174, now seen corresponding path program 1 times [2024-11-21 00:41:13,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069127347] [2024-11-21 00:41:13,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:13,309 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-21 00:41:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069127347] [2024-11-21 00:41:13,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069127347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:13,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:13,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521745393] [2024-11-21 00:41:13,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:13,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:13,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:13,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:13,312 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:13,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:13,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:13,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-21 00:41:13,327 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-21 00:41:13,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1636059044, now seen corresponding path program 1 times [2024-11-21 00:41:13,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:13,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136252943] [2024-11-21 00:41:13,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:13,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:13,358 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-21 00:41:13,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:13,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136252943] [2024-11-21 00:41:13,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136252943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:13,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:13,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:13,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134736788] [2024-11-21 00:41:13,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:13,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:13,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:13,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:13,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:13,361 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:13,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:13,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:13,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:13,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:13,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-21 00:41:13,578 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-21 00:41:13,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1855959515, now seen corresponding path program 1 times [2024-11-21 00:41:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:13,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216532795] [2024-11-21 00:41:13,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:13,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:13,598 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:13,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:13,632 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:13,635 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:13,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:13,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:13,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:13,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:13,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:13,635 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:13,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 00:41:13,638 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:13,638 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (5/5) [2024-11-21 00:41:13,638 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:13,638 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-21 00:41:13,698 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:13,701 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:13,728 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:13,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of5ForFork0 ======== [2024-11-21 00:41:13,728 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:13,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:13,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:13,980 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:13,983 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of5ForFork0 was SAFE (1/6) [2024-11-21 00:41:13,987 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:13,989 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:13,989 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of5ForFork0 ======== [2024-11-21 00:41:13,990 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:13,990 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:14,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:14,168 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:14,168 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of5ForFork0 was SAFE (2/6) [2024-11-21 00:41:14,173 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:14,178 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:14,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:14,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:14,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:14,180 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-21 00:41:14,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1695066930, now seen corresponding path program 1 times [2024-11-21 00:41:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:14,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605902177] [2024-11-21 00:41:14,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:14,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-21 00:41:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605902177] [2024-11-21 00:41:14,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605902177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:14,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:14,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976584098] [2024-11-21 00:41:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:14,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:14,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:14,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:14,220 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:14,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:14,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:14,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-21 00:41:14,233 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-21 00:41:14,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1805839610, now seen corresponding path program 1 times [2024-11-21 00:41:14,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:14,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603407396] [2024-11-21 00:41:14,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:14,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:14,254 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-21 00:41:14,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:14,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603407396] [2024-11-21 00:41:14,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603407396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:14,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:14,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:14,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302761242] [2024-11-21 00:41:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:14,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:14,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:14,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:14,258 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:14,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:14,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:14,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:14,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-21 00:41:14,523 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-21 00:41:14,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:14,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1005191581, now seen corresponding path program 1 times [2024-11-21 00:41:14,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:14,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711686085] [2024-11-21 00:41:14,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:14,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:14,543 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:14,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:14,584 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:14,584 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:14,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:14,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:14,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:14,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:14,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:14,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:14,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-21 00:41:14,587 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:14,588 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (3/6) [2024-11-21 00:41:14,588 WARN L246 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:14,588 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-21 00:41:14,646 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:14,674 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:14,704 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:14,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of6ForFork0 ======== [2024-11-21 00:41:14,705 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:14,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:14,981 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:14,981 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of6ForFork0 was SAFE (1/7) [2024-11-21 00:41:14,986 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:14,988 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:14,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of6ForFork0 ======== [2024-11-21 00:41:14,988 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:14,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:15,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:15,269 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:15,270 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of6ForFork0 was SAFE (2/7) [2024-11-21 00:41:15,274 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:15,277 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:15,277 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of6ForFork0 ======== [2024-11-21 00:41:15,278 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:15,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:15,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:15,541 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:15,542 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of6ForFork0 was SAFE (3/7) [2024-11-21 00:41:15,545 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:15,547 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:15,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of6ForFork0 ======== [2024-11-21 00:41:15,548 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:15,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:15,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:15,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:15,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1860762759, now seen corresponding path program 1 times [2024-11-21 00:41:15,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:15,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546752316] [2024-11-21 00:41:15,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:15,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:15,656 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-21 00:41:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:15,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546752316] [2024-11-21 00:41:15,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546752316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:15,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:15,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:15,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034063850] [2024-11-21 00:41:15,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:15,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:15,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:15,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:15,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:15,662 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:15,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:15,662 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:15,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-21 00:41:15,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:15,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:15,888 INFO L85 PathProgramCache]: Analyzing trace with hash -806859256, now seen corresponding path program 1 times [2024-11-21 00:41:15,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:15,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761859523] [2024-11-21 00:41:15,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:15,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:16,000 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-21 00:41:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761859523] [2024-11-21 00:41:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761859523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:16,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405364865] [2024-11-21 00:41:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:16,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:16,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:16,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:16,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:16,004 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:16,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 33.5) internal successors, (67), 3 states have internal predecessors, (67), 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-21 00:41:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:16,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:16,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,321 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:16,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-21 00:41:16,324 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:16,325 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of6ForFork0 was SAFE (4/7) [2024-11-21 00:41:16,329 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:16,331 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:16,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of6ForFork0 ======== [2024-11-21 00:41:16,332 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:16,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:16,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:16,571 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:16,571 INFO L319 ceAbstractionStarter]: Result for error location f2Thread6of6ForFork0 was SAFE (5/7) [2024-11-21 00:41:16,575 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:16,579 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:16,579 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:16,580 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:16,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:16,582 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-21 00:41:16,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:16,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1786017198, now seen corresponding path program 1 times [2024-11-21 00:41:16,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:16,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248882347] [2024-11-21 00:41:16,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:16,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:16,605 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-21 00:41:16,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:16,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248882347] [2024-11-21 00:41:16,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248882347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:16,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038761473] [2024-11-21 00:41:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:16,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:16,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:16,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:16,608 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:16,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:16,608 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:16,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-21 00:41:16,619 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-21 00:41:16,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1187009991, now seen corresponding path program 1 times [2024-11-21 00:41:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:16,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094069176] [2024-11-21 00:41:16,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:16,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:16,640 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-21 00:41:16,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:16,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094069176] [2024-11-21 00:41:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094069176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:16,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:16,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049539726] [2024-11-21 00:41:16,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:16,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:16,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:16,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:16,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:16,645 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:16,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:16,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:16,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 00:41:16,911 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-21 00:41:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1300450111, now seen corresponding path program 1 times [2024-11-21 00:41:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:16,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325335681] [2024-11-21 00:41:16,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:16,933 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:16,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:16,959 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:16,959 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:16,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:16,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:16,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:16,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:16,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:16,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:16,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-21 00:41:16,962 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:16,962 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (6/7) [2024-11-21 00:41:16,962 WARN L246 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:16,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2024-11-21 00:41:17,023 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:17,027 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:17,062 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:17,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of7ForFork0 ======== [2024-11-21 00:41:17,063 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:17,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:17,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:17,409 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:17,409 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of7ForFork0 was SAFE (1/8) [2024-11-21 00:41:17,415 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:17,416 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:17,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of7ForFork0 ======== [2024-11-21 00:41:17,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:17,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:17,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:17,775 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:17,775 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of7ForFork0 was SAFE (2/8) [2024-11-21 00:41:17,780 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:17,781 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:17,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of7ForFork0 ======== [2024-11-21 00:41:17,782 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:17,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:18,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:18,084 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:18,085 INFO L319 ceAbstractionStarter]: Result for error location f2Thread7of7ForFork0 was SAFE (3/8) [2024-11-21 00:41:18,088 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:18,089 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:18,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of7ForFork0 ======== [2024-11-21 00:41:18,090 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:18,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:18,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:18,344 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:18,345 INFO L319 ceAbstractionStarter]: Result for error location f2Thread6of7ForFork0 was SAFE (4/8) [2024-11-21 00:41:18,349 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:18,350 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:18,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of7ForFork0 ======== [2024-11-21 00:41:18,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:18,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:18,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:18,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:18,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1965099543, now seen corresponding path program 1 times [2024-11-21 00:41:18,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:18,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135701722] [2024-11-21 00:41:18,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:18,463 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-21 00:41:18,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:18,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135701722] [2024-11-21 00:41:18,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135701722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:18,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:18,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:18,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541831310] [2024-11-21 00:41:18,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:18,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:18,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:18,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:18,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:18,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:18,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:18,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:18,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:18,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-21 00:41:18,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:18,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash 973367749, now seen corresponding path program 1 times [2024-11-21 00:41:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413675944] [2024-11-21 00:41:18,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:18,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:18,762 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-21 00:41:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:18,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413675944] [2024-11-21 00:41:18,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413675944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:18,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:18,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562117505] [2024-11-21 00:41:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:18,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:18,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:18,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:18,766 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:18,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.0) internal successors, (68), 3 states have internal predecessors, (68), 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-21 00:41:18,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:18,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:19,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:19,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:19,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-21 00:41:19,162 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:19,162 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of7ForFork0 was SAFE (5/8) [2024-11-21 00:41:19,165 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:19,167 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:19,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of7ForFork0 ======== [2024-11-21 00:41:19,167 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:19,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:19,405 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:19,407 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:19,407 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of7ForFork0 was SAFE (6/8) [2024-11-21 00:41:19,411 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:19,412 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:19,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:19,412 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:19,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:19,414 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-21 00:41:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash -467538674, now seen corresponding path program 1 times [2024-11-21 00:41:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:19,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824086169] [2024-11-21 00:41:19,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:19,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:19,434 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-21 00:41:19,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:19,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824086169] [2024-11-21 00:41:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824086169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:19,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:19,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577727881] [2024-11-21 00:41:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:19,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:19,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:19,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:19,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:19,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:19,438 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:19,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:19,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:19,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:19,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-21 00:41:19,449 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-21 00:41:19,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash 139718708, now seen corresponding path program 1 times [2024-11-21 00:41:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:19,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834707264] [2024-11-21 00:41:19,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:19,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:19,469 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-21 00:41:19,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:19,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834707264] [2024-11-21 00:41:19,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834707264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:19,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:19,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:19,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15179508] [2024-11-21 00:41:19,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:19,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:19,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:19,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:19,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:19,472 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:19,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:19,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:19,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:19,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-21 00:41:19,834 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-21 00:41:19,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:19,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1646102294, now seen corresponding path program 1 times [2024-11-21 00:41:19,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:19,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11955184] [2024-11-21 00:41:19,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:19,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:19,865 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:19,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:19,897 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:19,898 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:19,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:19,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:19,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:19,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:19,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:19,898 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:19,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-21 00:41:19,901 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:19,901 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (7/8) [2024-11-21 00:41:19,901 WARN L246 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:19,902 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2024-11-21 00:41:19,960 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:19,964 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:20,000 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:20,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of8ForFork0 ======== [2024-11-21 00:41:20,001 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:20,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:20,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:20,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:20,102 INFO L85 PathProgramCache]: Analyzing trace with hash -439764397, now seen corresponding path program 1 times [2024-11-21 00:41:20,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:20,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679205711] [2024-11-21 00:41:20,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:20,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:20,120 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-21 00:41:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:20,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679205711] [2024-11-21 00:41:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679205711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:20,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155281003] [2024-11-21 00:41:20,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:20,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:20,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:20,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:20,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:20,123 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:20,124 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:20,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-21 00:41:20,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:20,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:20,386 INFO L85 PathProgramCache]: Analyzing trace with hash 296720217, now seen corresponding path program 1 times [2024-11-21 00:41:20,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:20,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692055832] [2024-11-21 00:41:20,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:20,454 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-21 00:41:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692055832] [2024-11-21 00:41:20,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692055832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:20,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:20,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041217906] [2024-11-21 00:41:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:20,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:20,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:20,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:20,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:20,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 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-21 00:41:20,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:20,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:21,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:21,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-21 00:41:21,060 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:21,061 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of8ForFork0 was SAFE (1/9) [2024-11-21 00:41:21,066 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:21,068 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:21,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of8ForFork0 ======== [2024-11-21 00:41:21,069 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:21,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:21,519 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:21,523 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:21,523 INFO L319 ceAbstractionStarter]: Result for error location f2Thread7of8ForFork0 was SAFE (2/9) [2024-11-21 00:41:21,529 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:21,530 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:21,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of8ForFork0 ======== [2024-11-21 00:41:21,531 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:21,531 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:21,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:21,893 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:21,893 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of8ForFork0 was SAFE (3/9) [2024-11-21 00:41:21,897 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:21,898 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:21,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of8ForFork0 ======== [2024-11-21 00:41:21,899 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:21,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:22,251 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:22,254 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:22,254 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of8ForFork0 was SAFE (4/9) [2024-11-21 00:41:22,258 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:22,259 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:22,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of8ForFork0 ======== [2024-11-21 00:41:22,259 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:22,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:22,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:22,548 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:22,548 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of8ForFork0 was SAFE (5/9) [2024-11-21 00:41:22,552 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:22,553 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:22,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:22,553 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:22,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:22,555 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-21 00:41:22,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:22,555 INFO L85 PathProgramCache]: Analyzing trace with hash -264606994, now seen corresponding path program 1 times [2024-11-21 00:41:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:22,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153345641] [2024-11-21 00:41:22,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:22,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:22,573 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-21 00:41:22,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:22,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153345641] [2024-11-21 00:41:22,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153345641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:22,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67354875] [2024-11-21 00:41:22,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:22,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:22,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:22,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:22,577 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:22,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:22,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:22,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:22,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-21 00:41:22,589 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-21 00:41:22,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1634115379, now seen corresponding path program 1 times [2024-11-21 00:41:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:22,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551305093] [2024-11-21 00:41:22,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:22,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:22,608 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-21 00:41:22,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:22,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551305093] [2024-11-21 00:41:22,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551305093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:22,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:22,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:22,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273878024] [2024-11-21 00:41:22,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:22,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:22,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:22,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:22,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:22,612 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:22,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:22,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:22,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:22,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:22,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-21 00:41:22,970 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-21 00:41:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash 450540898, now seen corresponding path program 1 times [2024-11-21 00:41:22,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:22,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354900141] [2024-11-21 00:41:22,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:22,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:22,994 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:23,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:23,024 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:23,025 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:23,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:23,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:23,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:23,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:23,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:23,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:23,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-21 00:41:23,029 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:23,029 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (6/9) [2024-11-21 00:41:23,029 WARN L246 ceAbstractionStarter]: 8 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:23,029 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 9 thread instances. [2024-11-21 00:41:23,090 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:23,094 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:23,133 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:23,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of9ForFork0 ======== [2024-11-21 00:41:23,134 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:23,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:23,556 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:23,559 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:23,559 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of9ForFork0 was SAFE (1/10) [2024-11-21 00:41:23,563 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:23,565 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:23,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of9ForFork0 ======== [2024-11-21 00:41:23,565 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:23,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:23,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:23,936 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:23,937 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of9ForFork0 was SAFE (2/10) [2024-11-21 00:41:23,941 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:23,942 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:23,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of9ForFork0 ======== [2024-11-21 00:41:23,943 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:23,943 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:24,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:24,424 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:24,424 INFO L319 ceAbstractionStarter]: Result for error location f2Thread8of9ForFork0 was SAFE (3/10) [2024-11-21 00:41:24,428 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:24,430 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:24,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of9ForFork0 ======== [2024-11-21 00:41:24,430 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:24,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:24,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:24,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1183997831, now seen corresponding path program 1 times [2024-11-21 00:41:24,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:24,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94045091] [2024-11-21 00:41:24,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:24,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:24,568 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-21 00:41:24,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:24,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94045091] [2024-11-21 00:41:24,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94045091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:24,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:24,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:24,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172889099] [2024-11-21 00:41:24,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:24,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:24,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:24,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:24,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:24,573 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:24,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:24,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:24,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-21 00:41:24,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:24,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 906757764, now seen corresponding path program 1 times [2024-11-21 00:41:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:24,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130204975] [2024-11-21 00:41:24,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:24,985 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-21 00:41:24,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:24,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130204975] [2024-11-21 00:41:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130204975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:24,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:24,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:24,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582372269] [2024-11-21 00:41:24,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:24,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:24,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:24,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:24,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:24,990 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:24,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 35.0) internal successors, (70), 3 states have internal predecessors, (70), 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-21 00:41:24,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:24,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:25,629 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:25,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-21 00:41:25,636 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:25,636 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of9ForFork0 was SAFE (4/10) [2024-11-21 00:41:25,643 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:25,645 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:25,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of9ForFork0 ======== [2024-11-21 00:41:25,646 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:25,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:26,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:26,163 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:26,164 INFO L319 ceAbstractionStarter]: Result for error location f2Thread9of9ForFork0 was SAFE (5/10) [2024-11-21 00:41:26,170 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:26,171 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:26,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of9ForFork0 ======== [2024-11-21 00:41:26,172 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:26,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:26,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:26,653 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:26,653 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of9ForFork0 was SAFE (6/10) [2024-11-21 00:41:26,658 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:26,660 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:26,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of9ForFork0 ======== [2024-11-21 00:41:26,661 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:26,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:27,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:27,122 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:27,122 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of9ForFork0 was SAFE (7/10) [2024-11-21 00:41:27,126 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:27,127 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:27,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of9ForFork0 ======== [2024-11-21 00:41:27,127 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:27,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:27,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:27,455 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:27,456 INFO L319 ceAbstractionStarter]: Result for error location f2Thread7of9ForFork0 was SAFE (8/10) [2024-11-21 00:41:27,460 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:27,461 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:27,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of9ForFork0 ======== [2024-11-21 00:41:27,464 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:27,464 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:27,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:27,930 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:27,930 INFO L319 ceAbstractionStarter]: Result for error location f2Thread6of9ForFork0 was SAFE (9/10) [2024-11-21 00:41:27,934 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:27,935 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:27,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:27,936 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:27,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:27,938 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-21 00:41:27,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1123435918, now seen corresponding path program 1 times [2024-11-21 00:41:27,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:27,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142381952] [2024-11-21 00:41:27,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:27,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:27,960 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-21 00:41:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142381952] [2024-11-21 00:41:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142381952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170389774] [2024-11-21 00:41:27,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:27,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:27,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:27,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:27,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:27,967 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:27,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:27,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:27,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:27,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-21 00:41:27,980 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-21 00:41:27,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1904535376, now seen corresponding path program 1 times [2024-11-21 00:41:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441667247] [2024-11-21 00:41:27,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:28,001 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-21 00:41:28,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:28,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441667247] [2024-11-21 00:41:28,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441667247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:28,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:28,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219845846] [2024-11-21 00:41:28,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:28,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:28,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:28,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:28,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:28,008 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:28,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:28,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:28,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:28,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:28,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-21 00:41:28,420 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-21 00:41:28,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash -321455519, now seen corresponding path program 1 times [2024-11-21 00:41:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622910709] [2024-11-21 00:41:28,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:28,449 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:28,492 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:28,492 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:28,492 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:28,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:28,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:28,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:28,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:28,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:28,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-21 00:41:28,501 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:28,501 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (10/10) [2024-11-21 00:41:28,503 WARN L246 ceAbstractionStarter]: 9 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:28,503 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 10 thread instances. [2024-11-21 00:41:28,573 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:28,581 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:28,630 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:28,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of10ForFork0 ======== [2024-11-21 00:41:28,631 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:28,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:29,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:29,114 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:29,114 INFO L319 ceAbstractionStarter]: Result for error location f2Thread6of10ForFork0 was SAFE (1/11) [2024-11-21 00:41:29,118 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:29,120 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:29,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of10ForFork0 ======== [2024-11-21 00:41:29,120 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:29,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:29,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:29,746 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:29,748 INFO L319 ceAbstractionStarter]: Result for error location f2Thread7of10ForFork0 was SAFE (2/11) [2024-11-21 00:41:29,752 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:29,754 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:29,755 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of10ForFork0 ======== [2024-11-21 00:41:29,755 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:29,755 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:30,168 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:30,175 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:30,176 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of10ForFork0 was SAFE (3/11) [2024-11-21 00:41:30,179 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:30,180 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:30,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of10ForFork0 ======== [2024-11-21 00:41:30,181 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:30,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:30,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:30,537 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:30,537 INFO L319 ceAbstractionStarter]: Result for error location f2Thread10of10ForFork0 was SAFE (4/11) [2024-11-21 00:41:30,541 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:30,542 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:30,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of10ForFork0 ======== [2024-11-21 00:41:30,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:30,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:31,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:31,173 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:31,173 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of10ForFork0 was SAFE (5/11) [2024-11-21 00:41:31,177 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:31,178 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:31,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of10ForFork0 ======== [2024-11-21 00:41:31,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:31,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:31,633 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:31,640 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:31,641 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of10ForFork0 was SAFE (6/11) [2024-11-21 00:41:31,644 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:31,646 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:31,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:31,647 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:31,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:31,649 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-21 00:41:31,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:31,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1335188306, now seen corresponding path program 1 times [2024-11-21 00:41:31,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:31,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522550883] [2024-11-21 00:41:31,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:31,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:31,672 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-21 00:41:31,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:31,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522550883] [2024-11-21 00:41:31,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522550883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:31,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:31,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:31,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884669188] [2024-11-21 00:41:31,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:31,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:31,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:31,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:31,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:31,682 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:31,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:31,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:31,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-21 00:41:31,694 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-21 00:41:31,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:31,694 INFO L85 PathProgramCache]: Analyzing trace with hash -888293233, now seen corresponding path program 1 times [2024-11-21 00:41:31,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:31,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827615441] [2024-11-21 00:41:31,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:31,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:31,722 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-21 00:41:31,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:31,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827615441] [2024-11-21 00:41:31,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827615441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:31,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:31,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:31,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800063991] [2024-11-21 00:41:31,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:31,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:31,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:31,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:31,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:31,731 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:31,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:31,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:31,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:32,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-21 00:41:32,219 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-21 00:41:32,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash -195004059, now seen corresponding path program 1 times [2024-11-21 00:41:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:32,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371721553] [2024-11-21 00:41:32,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:32,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:32,254 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:32,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:32,297 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:32,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:32,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:32,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:32,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:32,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:32,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:32,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:32,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-21 00:41:32,308 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:32,309 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (7/11) [2024-11-21 00:41:32,309 WARN L246 ceAbstractionStarter]: 10 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:32,309 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 11 thread instances. [2024-11-21 00:41:32,396 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:32,401 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:32,449 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:32,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of11ForFork0 ======== [2024-11-21 00:41:32,452 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:32,452 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:33,201 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:33,208 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:33,208 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of11ForFork0 was SAFE (1/12) [2024-11-21 00:41:33,212 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:33,213 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:33,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of11ForFork0 ======== [2024-11-21 00:41:33,214 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:33,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:33,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:33,997 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:33,998 INFO L319 ceAbstractionStarter]: Result for error location f2Thread6of11ForFork0 was SAFE (2/12) [2024-11-21 00:41:34,005 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:34,007 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:34,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of11ForFork0 ======== [2024-11-21 00:41:34,008 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:34,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:34,211 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:34,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:34,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1150688631, now seen corresponding path program 1 times [2024-11-21 00:41:34,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:34,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169912640] [2024-11-21 00:41:34,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:34,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:34,248 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-21 00:41:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169912640] [2024-11-21 00:41:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169912640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979615846] [2024-11-21 00:41:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:34,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:34,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:34,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:34,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:34,259 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:34,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:34,260 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:34,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-21 00:41:34,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:34,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1337894175, now seen corresponding path program 1 times [2024-11-21 00:41:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:34,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193225425] [2024-11-21 00:41:34,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:34,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:35,094 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-21 00:41:35,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193225425] [2024-11-21 00:41:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193225425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:35,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:35,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:35,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909520976] [2024-11-21 00:41:35,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:35,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:35,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:35,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:35,105 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:35,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.0) internal successors, (72), 3 states have internal predecessors, (72), 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-21 00:41:35,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:35,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:36,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:36,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-21 00:41:36,056 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:36,056 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of11ForFork0 was SAFE (3/12) [2024-11-21 00:41:36,062 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:36,063 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:36,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of11ForFork0 ======== [2024-11-21 00:41:36,064 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:36,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:36,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:36,676 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:36,676 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of11ForFork0 was SAFE (4/12) [2024-11-21 00:41:36,678 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:36,679 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:36,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of11ForFork0 ======== [2024-11-21 00:41:36,680 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:36,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:37,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:37,291 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:37,292 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of11ForFork0 was SAFE (5/12) [2024-11-21 00:41:37,295 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:37,296 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:37,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of11ForFork0 ======== [2024-11-21 00:41:37,297 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:37,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:37,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:37,868 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:37,869 INFO L319 ceAbstractionStarter]: Result for error location f2Thread10of11ForFork0 was SAFE (6/12) [2024-11-21 00:41:37,872 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:37,873 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:37,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of11ForFork0 ======== [2024-11-21 00:41:37,873 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:37,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:38,342 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:38,346 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:38,346 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of11ForFork0 was SAFE (7/12) [2024-11-21 00:41:38,349 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:38,350 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:38,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of11ForFork0 ======== [2024-11-21 00:41:38,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:38,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:38,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:38,756 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:38,756 INFO L319 ceAbstractionStarter]: Result for error location f2Thread11of11ForFork0 was SAFE (8/12) [2024-11-21 00:41:38,760 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:38,761 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:38,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of11ForFork0 ======== [2024-11-21 00:41:38,761 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:38,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:39,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:39,246 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:39,246 INFO L319 ceAbstractionStarter]: Result for error location f2Thread9of11ForFork0 was SAFE (9/12) [2024-11-21 00:41:39,249 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:39,250 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:39,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:39,251 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:39,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:39,253 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-21 00:41:39,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1912542862, now seen corresponding path program 1 times [2024-11-21 00:41:39,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:39,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199640576] [2024-11-21 00:41:39,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:39,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:39,272 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-21 00:41:39,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:39,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199640576] [2024-11-21 00:41:39,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199640576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:39,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:39,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:39,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876867035] [2024-11-21 00:41:39,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:39,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:39,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:39,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:39,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:39,284 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:39,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:39,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:39,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:39,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-21 00:41:39,295 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-21 00:41:39,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash -454046584, now seen corresponding path program 1 times [2024-11-21 00:41:39,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:39,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40553593] [2024-11-21 00:41:39,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:39,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:39,314 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-21 00:41:39,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:39,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40553593] [2024-11-21 00:41:39,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40553593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:39,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:39,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:39,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886222772] [2024-11-21 00:41:39,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:39,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:39,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:39,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:39,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:39,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:39,326 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:39,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:39,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:39,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:39,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-21 00:41:39,846 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-21 00:41:39,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:39,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1884336236, now seen corresponding path program 1 times [2024-11-21 00:41:39,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:39,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027822070] [2024-11-21 00:41:39,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:39,873 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:39,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:39,915 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:39,915 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:39,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:39,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:39,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:39,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:39,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:39,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:39,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-21 00:41:39,927 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:39,927 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (10/12) [2024-11-21 00:41:39,927 WARN L246 ceAbstractionStarter]: 11 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:39,927 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 12 thread instances. [2024-11-21 00:41:40,168 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:40,176 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:40,234 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:40,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of12ForFork0 ======== [2024-11-21 00:41:40,234 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:40,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:40,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:40,691 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:40,691 INFO L319 ceAbstractionStarter]: Result for error location f2Thread11of12ForFork0 was SAFE (1/13) [2024-11-21 00:41:40,695 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:40,697 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:40,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of12ForFork0 ======== [2024-11-21 00:41:40,697 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:40,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:41,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:41,158 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:41,159 INFO L319 ceAbstractionStarter]: Result for error location f2Thread8of12ForFork0 was SAFE (2/13) [2024-11-21 00:41:41,162 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:41,163 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:41,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of12ForFork0 ======== [2024-11-21 00:41:41,164 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:41,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:41,594 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:41,602 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:41,602 INFO L319 ceAbstractionStarter]: Result for error location f2Thread10of12ForFork0 was SAFE (3/13) [2024-11-21 00:41:41,605 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:41,606 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:41,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of12ForFork0 ======== [2024-11-21 00:41:41,606 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:41,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:42,241 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:42,248 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:42,248 INFO L319 ceAbstractionStarter]: Result for error location f2Thread7of12ForFork0 was SAFE (4/13) [2024-11-21 00:41:42,251 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:42,252 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:42,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of12ForFork0 ======== [2024-11-21 00:41:42,253 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:42,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:42,872 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:42,882 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:42,883 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of12ForFork0 was SAFE (5/13) [2024-11-21 00:41:42,886 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:42,888 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:42,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of12ForFork0 ======== [2024-11-21 00:41:42,891 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:42,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:43,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:43,292 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:43,292 INFO L319 ceAbstractionStarter]: Result for error location f2Thread6of12ForFork0 was SAFE (6/13) [2024-11-21 00:41:43,295 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:43,296 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:43,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of12ForFork0 ======== [2024-11-21 00:41:43,297 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:43,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:43,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:43,682 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:43,683 INFO L319 ceAbstractionStarter]: Result for error location f2Thread12of12ForFork0 was SAFE (7/13) [2024-11-21 00:41:43,684 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:43,686 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:43,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of12ForFork0 ======== [2024-11-21 00:41:43,686 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:43,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:44,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:44,356 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:44,356 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of12ForFork0 was SAFE (8/13) [2024-11-21 00:41:44,360 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:44,361 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:44,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of12ForFork0 ======== [2024-11-21 00:41:44,361 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:44,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:44,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:44,971 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:44,972 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of12ForFork0 was SAFE (9/13) [2024-11-21 00:41:44,975 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:44,977 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:44,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of12ForFork0 ======== [2024-11-21 00:41:44,977 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:44,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:45,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:45,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2121940083, now seen corresponding path program 1 times [2024-11-21 00:41:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:45,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568821458] [2024-11-21 00:41:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:45,189 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-21 00:41:45,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:45,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568821458] [2024-11-21 00:41:45,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568821458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:45,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:45,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:45,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296519078] [2024-11-21 00:41:45,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:45,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:45,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:45,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:45,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:45,203 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:45,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:45,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:45,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-21 00:41:45,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:45,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1044019249, now seen corresponding path program 1 times [2024-11-21 00:41:45,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:45,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582053731] [2024-11-21 00:41:45,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:45,975 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-21 00:41:45,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:45,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582053731] [2024-11-21 00:41:45,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582053731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:45,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:45,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:45,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908021812] [2024-11-21 00:41:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:45,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:45,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:45,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:45,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:45,989 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:45,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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-21 00:41:45,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:45,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:47,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:47,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-21 00:41:47,090 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:47,090 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of12ForFork0 was SAFE (10/13) [2024-11-21 00:41:47,092 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:47,093 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:47,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of12ForFork0 ======== [2024-11-21 00:41:47,093 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:47,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:47,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:47,473 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:47,473 INFO L319 ceAbstractionStarter]: Result for error location f2Thread9of12ForFork0 was SAFE (11/13) [2024-11-21 00:41:47,475 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:47,476 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:47,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of12ForFork0 ======== [2024-11-21 00:41:47,476 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:47,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:47,877 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:47,885 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:47,886 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of12ForFork0 was SAFE (12/13) [2024-11-21 00:41:47,888 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:47,889 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:47,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:47,889 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:47,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:47,890 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-21 00:41:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash 573973294, now seen corresponding path program 1 times [2024-11-21 00:41:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948001441] [2024-11-21 00:41:47,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:47,908 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-21 00:41:47,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:47,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948001441] [2024-11-21 00:41:47,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948001441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:47,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:47,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:47,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45638260] [2024-11-21 00:41:47,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:47,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:47,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:47,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:47,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:47,923 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:47,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:47,924 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:47,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:47,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-21 00:41:47,934 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-21 00:41:47,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:47,935 INFO L85 PathProgramCache]: Analyzing trace with hash 996240635, now seen corresponding path program 1 times [2024-11-21 00:41:47,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:47,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336733820] [2024-11-21 00:41:47,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:47,952 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-21 00:41:47,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:47,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336733820] [2024-11-21 00:41:47,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336733820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:47,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:47,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816947302] [2024-11-21 00:41:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:47,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:47,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:47,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:47,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:47,968 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:47,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:47,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:47,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:48,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-21 00:41:48,541 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-21 00:41:48,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1955778102, now seen corresponding path program 1 times [2024-11-21 00:41:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503674145] [2024-11-21 00:41:48,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:48,568 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:48,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:48,613 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:48,613 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:48,613 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:48,614 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:48,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:48,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:48,618 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:48,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-21 00:41:48,632 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:48,632 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (13/13) [2024-11-21 00:41:48,632 WARN L246 ceAbstractionStarter]: 12 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:48,632 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 13 thread instances. [2024-11-21 00:41:48,709 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:48,712 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:48,760 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:48,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread13of13ForFork0 ======== [2024-11-21 00:41:48,761 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:48,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:49,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:49,427 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:49,427 INFO L319 ceAbstractionStarter]: Result for error location f2Thread13of13ForFork0 was SAFE (1/14) [2024-11-21 00:41:49,430 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:49,431 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:49,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of13ForFork0 ======== [2024-11-21 00:41:49,431 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:49,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:50,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:50,014 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:50,014 INFO L319 ceAbstractionStarter]: Result for error location f2Thread7of13ForFork0 was SAFE (2/14) [2024-11-21 00:41:50,017 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:50,018 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:50,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of13ForFork0 ======== [2024-11-21 00:41:50,019 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:50,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:50,447 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:50,456 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:50,456 INFO L319 ceAbstractionStarter]: Result for error location f2Thread6of13ForFork0 was SAFE (3/14) [2024-11-21 00:41:50,458 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:50,459 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:50,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of13ForFork0 ======== [2024-11-21 00:41:50,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:50,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:50,906 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:50,917 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:50,917 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of13ForFork0 was SAFE (4/14) [2024-11-21 00:41:50,919 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:50,920 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:50,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of13ForFork0 ======== [2024-11-21 00:41:50,921 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:50,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:51,498 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:51,506 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:51,506 INFO L319 ceAbstractionStarter]: Result for error location f2Thread10of13ForFork0 was SAFE (5/14) [2024-11-21 00:41:51,509 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:51,509 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:51,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of13ForFork0 ======== [2024-11-21 00:41:51,510 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:51,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:51,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:51,952 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:51,952 INFO L319 ceAbstractionStarter]: Result for error location f2Thread12of13ForFork0 was SAFE (6/14) [2024-11-21 00:41:51,954 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:51,955 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:51,955 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of13ForFork0 ======== [2024-11-21 00:41:51,956 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:51,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:52,424 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:52,439 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:52,439 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of13ForFork0 was SAFE (7/14) [2024-11-21 00:41:52,442 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:52,444 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:52,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of13ForFork0 ======== [2024-11-21 00:41:52,445 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:52,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:52,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:52,995 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:52,995 INFO L319 ceAbstractionStarter]: Result for error location f2Thread11of13ForFork0 was SAFE (8/14) [2024-11-21 00:41:52,998 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:52,999 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:52,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of13ForFork0 ======== [2024-11-21 00:41:52,999 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:52,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:53,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:53,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:53,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1198387570, now seen corresponding path program 1 times [2024-11-21 00:41:53,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:53,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873888062] [2024-11-21 00:41:53,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:53,110 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-21 00:41:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873888062] [2024-11-21 00:41:53,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873888062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:53,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012219245] [2024-11-21 00:41:53,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:41:53,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:53,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:41:53,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:41:53,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:53,127 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:53,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:41:53,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:54,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-21 00:41:54,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:41:54,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2067437162, now seen corresponding path program 1 times [2024-11-21 00:41:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:54,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570161312] [2024-11-21 00:41:54,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:54,090 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-21 00:41:54,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570161312] [2024-11-21 00:41:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570161312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:54,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:54,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43977592] [2024-11-21 00:41:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:54,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:54,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:54,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:54,106 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:54,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 37.0) internal successors, (74), 3 states have internal predecessors, (74), 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-21 00:41:54,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:54,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:55,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:55,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-21 00:41:55,110 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:41:55,110 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of13ForFork0 was SAFE (9/14) [2024-11-21 00:41:55,114 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:55,116 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:55,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of13ForFork0 ======== [2024-11-21 00:41:55,116 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:55,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:55,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:55,734 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:55,734 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of13ForFork0 was SAFE (10/14) [2024-11-21 00:41:55,738 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:55,739 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:55,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of13ForFork0 ======== [2024-11-21 00:41:55,740 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:55,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:56,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:56,553 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:56,553 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of13ForFork0 was SAFE (11/14) [2024-11-21 00:41:56,555 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:56,556 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:56,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of13ForFork0 ======== [2024-11-21 00:41:56,556 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:56,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:56,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:56,983 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:56,983 INFO L319 ceAbstractionStarter]: Result for error location f2Thread8of13ForFork0 was SAFE (12/14) [2024-11-21 00:41:56,986 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:56,987 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:56,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of13ForFork0 ======== [2024-11-21 00:41:56,987 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:56,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:57,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:57,448 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:57,448 INFO L319 ceAbstractionStarter]: Result for error location f2Thread9of13ForFork0 was SAFE (13/14) [2024-11-21 00:41:57,452 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:57,454 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:57,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:41:57,454 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:57,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:41:57,456 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-21 00:41:57,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash -230736658, now seen corresponding path program 1 times [2024-11-21 00:41:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:57,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906965688] [2024-11-21 00:41:57,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:57,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:57,481 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-21 00:41:57,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:57,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906965688] [2024-11-21 00:41:57,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906965688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:57,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:57,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673461640] [2024-11-21 00:41:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:57,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:57,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:57,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:57,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:57,499 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:57,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:41:57,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:57,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:57,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-21 00:41:57,511 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-21 00:41:57,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:57,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1898658371, now seen corresponding path program 1 times [2024-11-21 00:41:57,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:57,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984481260] [2024-11-21 00:41:57,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:57,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:41:57,535 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-21 00:41:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:41:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984481260] [2024-11-21 00:41:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984481260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:41:57,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:41:57,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:41:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051473748] [2024-11-21 00:41:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:41:57,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:41:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:41:57,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:41:57,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:41:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:57,552 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:41:57,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:41:57,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:57,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:41:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:41:58,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-21 00:41:58,314 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-21 00:41:58,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:41:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1236149960, now seen corresponding path program 1 times [2024-11-21 00:41:58,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:41:58,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919996248] [2024-11-21 00:41:58,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:41:58,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:41:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:58,357 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:41:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:41:58,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:41:58,422 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:41:58,422 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:41:58,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:41:58,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:41:58,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:41:58,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:41:58,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:41:58,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:41:58,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-21 00:41:58,441 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:41:58,441 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (14/14) [2024-11-21 00:41:58,441 WARN L246 ceAbstractionStarter]: 13 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:41:58,441 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 14 thread instances. [2024-11-21 00:41:58,551 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:41:58,557 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:58,619 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:58,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread13of14ForFork0 ======== [2024-11-21 00:41:58,620 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:58,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:41:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:41:59,628 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:41:59,628 INFO L319 ceAbstractionStarter]: Result for error location f2Thread13of14ForFork0 was SAFE (1/15) [2024-11-21 00:41:59,634 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:59,635 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:41:59,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread14of14ForFork0 ======== [2024-11-21 00:41:59,638 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:41:59,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:00,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:00,777 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:00,777 INFO L319 ceAbstractionStarter]: Result for error location f2Thread14of14ForFork0 was SAFE (2/15) [2024-11-21 00:42:00,780 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:00,782 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:00,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of14ForFork0 ======== [2024-11-21 00:42:00,782 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:00,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:01,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:01,428 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:01,428 INFO L319 ceAbstractionStarter]: Result for error location f2Thread11of14ForFork0 was SAFE (3/15) [2024-11-21 00:42:01,431 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:01,432 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:01,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of14ForFork0 ======== [2024-11-21 00:42:01,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:01,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:02,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:02,080 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:02,080 INFO L319 ceAbstractionStarter]: Result for error location f2Thread12of14ForFork0 was SAFE (4/15) [2024-11-21 00:42:02,083 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:02,084 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:02,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread6of14ForFork0 ======== [2024-11-21 00:42:02,085 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:02,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:02,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:02,741 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:02,741 INFO L319 ceAbstractionStarter]: Result for error location f2Thread6of14ForFork0 was SAFE (5/15) [2024-11-21 00:42:02,747 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:02,749 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:02,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of14ForFork0 ======== [2024-11-21 00:42:02,749 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:02,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:03,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:03,662 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:03,662 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of14ForFork0 was SAFE (6/15) [2024-11-21 00:42:03,665 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:03,666 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:03,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of14ForFork0 ======== [2024-11-21 00:42:03,667 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:03,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:04,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:04,408 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:04,408 INFO L319 ceAbstractionStarter]: Result for error location f2Thread10of14ForFork0 was SAFE (7/15) [2024-11-21 00:42:04,413 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:04,414 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:04,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of14ForFork0 ======== [2024-11-21 00:42:04,415 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:04,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:05,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:05,085 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:05,086 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of14ForFork0 was SAFE (8/15) [2024-11-21 00:42:05,088 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:05,089 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:05,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of14ForFork0 ======== [2024-11-21 00:42:05,090 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:05,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:05,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:05,985 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:05,985 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of14ForFork0 was SAFE (9/15) [2024-11-21 00:42:05,989 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:05,991 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:05,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of14ForFork0 ======== [2024-11-21 00:42:05,991 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:05,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:06,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:06,890 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:06,890 INFO L319 ceAbstractionStarter]: Result for error location f2Thread3of14ForFork0 was SAFE (10/15) [2024-11-21 00:42:06,896 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:06,897 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:06,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of14ForFork0 ======== [2024-11-21 00:42:06,898 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:06,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:07,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:42:07,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:42:07,055 INFO L85 PathProgramCache]: Analyzing trace with hash 190785382, now seen corresponding path program 1 times [2024-11-21 00:42:07,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:42:07,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813372858] [2024-11-21 00:42:07,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:42:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:42:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:42:07,072 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-21 00:42:07,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:42:07,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813372858] [2024-11-21 00:42:07,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813372858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:42:07,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:42:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:42:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448535532] [2024-11-21 00:42:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:42:07,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:42:07,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:42:07,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:42:07,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:42:07,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:07,092 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:42:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:42:07,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:07,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-21 00:42:07,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:42:07,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:42:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash 958545940, now seen corresponding path program 1 times [2024-11-21 00:42:07,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:42:07,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134477416] [2024-11-21 00:42:07,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:42:07,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:42:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:42:07,949 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-21 00:42:07,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:42:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134477416] [2024-11-21 00:42:07,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134477416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:42:07,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:42:07,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:42:07,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851855042] [2024-11-21 00:42:07,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:42:07,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:42:07,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:42:07,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:42:07,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:42:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:07,970 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:42:07,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 37.5) internal successors, (75), 3 states have internal predecessors, (75), 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-21 00:42:07,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:07,971 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:09,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:09,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-21 00:42:09,068 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:42:09,068 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of14ForFork0 was SAFE (11/15) [2024-11-21 00:42:09,073 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:09,074 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:09,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread7of14ForFork0 ======== [2024-11-21 00:42:09,075 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:09,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:10,142 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:10,155 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:10,156 INFO L319 ceAbstractionStarter]: Result for error location f2Thread7of14ForFork0 was SAFE (12/15) [2024-11-21 00:42:10,158 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:10,159 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:10,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread8of14ForFork0 ======== [2024-11-21 00:42:10,159 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:10,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:10,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:10,828 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:10,828 INFO L319 ceAbstractionStarter]: Result for error location f2Thread8of14ForFork0 was SAFE (13/15) [2024-11-21 00:42:10,830 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:10,831 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:10,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread9of14ForFork0 ======== [2024-11-21 00:42:10,832 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:10,832 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:11,559 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:11,573 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:11,573 INFO L319 ceAbstractionStarter]: Result for error location f2Thread9of14ForFork0 was SAFE (14/15) [2024-11-21 00:42:11,575 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:11,576 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:11,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-21 00:42:11,577 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:11,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-21 00:42:11,579 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-21 00:42:11,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:42:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1365668914, now seen corresponding path program 1 times [2024-11-21 00:42:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:42:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545242696] [2024-11-21 00:42:11,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:42:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:42:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:42:11,600 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-21 00:42:11,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:42:11,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545242696] [2024-11-21 00:42:11,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545242696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:42:11,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:42:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:42:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92520222] [2024-11-21 00:42:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:42:11,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:42:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:42:11,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:42:11,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:42:11,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:11,616 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:42:11,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 00:42:11,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:11,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-21 00:42:11,625 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-21 00:42:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:42:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1619858318, now seen corresponding path program 1 times [2024-11-21 00:42:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:42:11,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655340098] [2024-11-21 00:42:11,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:42:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:42:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:42:11,644 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-21 00:42:11,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:42:11,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655340098] [2024-11-21 00:42:11,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655340098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:42:11,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:42:11,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:42:11,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337519791] [2024-11-21 00:42:11,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:42:11,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:42:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:42:11,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:42:11,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:42:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:11,665 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:42:11,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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-21 00:42:11,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:11,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:12,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-21 00:42:12,291 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-21 00:42:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:42:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash 216182802, now seen corresponding path program 1 times [2024-11-21 00:42:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:42:12,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016158958] [2024-11-21 00:42:12,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:42:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:42:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:42:12,321 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 00:42:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 00:42:12,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 00:42:12,377 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-21 00:42:12,377 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-21 00:42:12,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-21 00:42:12,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-21 00:42:12,377 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-21 00:42:12,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-21 00:42:12,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-21 00:42:12,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-11-21 00:42:12,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-21 00:42:12,399 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-21 00:42:12,399 INFO L319 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (15/15) [2024-11-21 00:42:12,399 WARN L246 ceAbstractionStarter]: 14 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-21 00:42:12,399 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 15 thread instances. [2024-11-21 00:42:12,494 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-21 00:42:12,498 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:12,563 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:12,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread12of15ForFork0 ======== [2024-11-21 00:42:12,565 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:12,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:13,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:13,336 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:13,336 INFO L319 ceAbstractionStarter]: Result for error location f2Thread12of15ForFork0 was SAFE (1/16) [2024-11-21 00:42:13,340 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:13,341 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:13,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread11of15ForFork0 ======== [2024-11-21 00:42:13,341 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:13,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:14,116 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:14,129 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:14,130 INFO L319 ceAbstractionStarter]: Result for error location f2Thread11of15ForFork0 was SAFE (2/16) [2024-11-21 00:42:14,133 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:14,134 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:14,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread13of15ForFork0 ======== [2024-11-21 00:42:14,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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:14,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:14,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:14,938 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:14,938 INFO L319 ceAbstractionStarter]: Result for error location f2Thread13of15ForFork0 was SAFE (3/16) [2024-11-21 00:42:14,941 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:14,942 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:14,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread10of15ForFork0 ======== [2024-11-21 00:42:14,942 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:14,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:16,198 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:16,212 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:16,212 INFO L319 ceAbstractionStarter]: Result for error location f2Thread10of15ForFork0 was SAFE (4/16) [2024-11-21 00:42:16,215 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:16,216 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:16,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread14of15ForFork0 ======== [2024-11-21 00:42:16,216 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:16,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:17,123 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:17,141 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:17,142 INFO L319 ceAbstractionStarter]: Result for error location f2Thread14of15ForFork0 was SAFE (5/16) [2024-11-21 00:42:17,146 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:17,147 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:17,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread5of15ForFork0 ======== [2024-11-21 00:42:17,148 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:17,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:17,983 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:17,983 INFO L319 ceAbstractionStarter]: Result for error location f2Thread5of15ForFork0 was SAFE (6/16) [2024-11-21 00:42:17,987 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:17,988 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:17,988 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread4of15ForFork0 ======== [2024-11-21 00:42:17,989 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:17,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:18,784 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:18,799 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:18,799 INFO L319 ceAbstractionStarter]: Result for error location f2Thread4of15ForFork0 was SAFE (7/16) [2024-11-21 00:42:18,802 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:18,803 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:18,803 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread2of15ForFork0 ======== [2024-11-21 00:42:18,803 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:18,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:19,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:19,614 INFO L422 BasicCegarLoop]: Path program histogram: [] [2024-11-21 00:42:19,614 INFO L319 ceAbstractionStarter]: Result for error location f2Thread2of15ForFork0 was SAFE (8/16) [2024-11-21 00:42:19,618 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:19,620 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:19,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread1of15ForFork0 ======== [2024-11-21 00:42:19,621 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:19,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 00:42:19,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:42:19,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:42:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1840459597, now seen corresponding path program 1 times [2024-11-21 00:42:19,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:42:19,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582160212] [2024-11-21 00:42:19,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:42:19,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:42:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:42:19,833 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-21 00:42:19,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:42:19,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582160212] [2024-11-21 00:42:19,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582160212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:42:19,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:42:19,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:42:19,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664429616] [2024-11-21 00:42:19,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:42:19,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 00:42:19,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:42:19,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 00:42:19,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 00:42:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:19,858 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:42:19,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-21 00:42:19,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:20,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:20,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-21 00:42:20,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONDATA_RACE === [f2Err0ASSERT_VIOLATIONDATA_RACE] === [2024-11-21 00:42:20,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 00:42:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash 717322473, now seen corresponding path program 1 times [2024-11-21 00:42:20,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 00:42:20,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144872003] [2024-11-21 00:42:20,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 00:42:20,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 00:42:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 00:42:20,701 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-21 00:42:20,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 00:42:20,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144872003] [2024-11-21 00:42:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144872003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 00:42:20,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 00:42:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 00:42:20,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084296838] [2024-11-21 00:42:20,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 00:42:20,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 00:42:20,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 00:42:20,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 00:42:20,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 00:42:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:20,727 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-21 00:42:20,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.0) internal successors, (76), 3 states have internal predecessors, (76), 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-21 00:42:20,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:20,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:21,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 00:42:21,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 00:42:21,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location f2Err0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2024-11-21 00:42:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-21 00:42:21,830 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-21 00:42:21,830 INFO L319 ceAbstractionStarter]: Result for error location f2Thread1of15ForFork0 was SAFE (9/16) [2024-11-21 00:42:21,835 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:21,836 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-21 00:42:21,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == f2Thread3of15ForFork0 ======== [2024-11-21 00:42:21,837 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;@6e344220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 00:42:21,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.