./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 22:59:03,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 22:59:03,218 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-23 22:59:03,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 22:59:03,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 22:59:03,267 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 22:59:03,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 22:59:03,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 22:59:03,268 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 22:59:03,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 22:59:03,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 22:59:03,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 22:59:03,268 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 22:59:03,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 22:59:03,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 22:59:03,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 22:59:03,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 22:59:03,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 22:59:03,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 22:59:03,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 22:59:03,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 22:59:03,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 22:59:03,270 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-23 22:59:03,270 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-23 22:59:03,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 22:59:03,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 22:59:03,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 22:59:03,270 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 22:59:03,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 22:59:03,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:59:03,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:59:03,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:59:03,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 22:59:03,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:59:03,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:59:03,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:59:03,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 22:59:03,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 22:59:03,272 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 22:59:03,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 22:59:03,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 22:59:03,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 22:59:03,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 22:59:03,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 22:59:03,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 22:59:03,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 22:59:03,274 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC 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 -> Automizer 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 -> 47827fdca8ccc83dae99015d656cdcf2872ea585121905304e5ffb2ef40b4eac [2024-11-23 22:59:03,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 22:59:03,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 22:59:03,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 22:59:03,617 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 22:59:03,617 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 22:59:03,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2024-11-23 22:59:06,796 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/data/f372bc33f/2c4b30ba1ae94b2184b50c237c25ccef/FLAG8289b958c [2024-11-23 22:59:07,188 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 22:59:07,189 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race.i [2024-11-23 22:59:07,218 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/data/f372bc33f/2c4b30ba1ae94b2184b50c237c25ccef/FLAG8289b958c [2024-11-23 22:59:07,242 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/data/f372bc33f/2c4b30ba1ae94b2184b50c237c25ccef [2024-11-23 22:59:07,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 22:59:07,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 22:59:07,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 22:59:07,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 22:59:07,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 22:59:07,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97c373c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07, skipping insertion in model container [2024-11-23 22:59:07,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 22:59:07,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:59:07,700 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 22:59:07,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:59:07,787 INFO L204 MainTranslator]: Completed translation [2024-11-23 22:59:07,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07 WrapperNode [2024-11-23 22:59:07,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 22:59:07,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 22:59:07,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 22:59:07,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 22:59:07,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,830 INFO L138 Inliner]: procedures = 159, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2024-11-23 22:59:07,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 22:59:07,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 22:59:07,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 22:59:07,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 22:59:07,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 22:59:07,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 22:59:07,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 22:59:07,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 22:59:07,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (1/1) ... [2024-11-23 22:59:07,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:59:07,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:59:07,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 22:59:07,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 22:59:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-23 22:59:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 22:59:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-23 22:59:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-23 22:59:07,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-23 22:59:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-23 22:59:07,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 22:59:07,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 22:59:07,946 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-23 22:59:08,114 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 22:59:08,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 22:59:08,329 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-23 22:59:08,329 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 22:59:08,361 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 22:59:08,361 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 22:59:08,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:59:08 BoogieIcfgContainer [2024-11-23 22:59:08,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 22:59:08,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 22:59:08,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 22:59:08,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 22:59:08,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:59:07" (1/3) ... [2024-11-23 22:59:08,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eef381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:59:08, skipping insertion in model container [2024-11-23 22:59:08,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:59:07" (2/3) ... [2024-11-23 22:59:08,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71eef381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:59:08, skipping insertion in model container [2024-11-23 22:59:08,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:59:08" (3/3) ... [2024-11-23 22:59:08,382 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race.i [2024-11-23 22:59:08,399 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 22:59:08,403 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race.i that has 2 procedures, 91 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2024-11-23 22:59:08,403 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-23 22:59:08,502 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-23 22:59:08,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 95 transitions, 194 flow [2024-11-23 22:59:08,664 INFO L124 PetriNetUnfolderBase]: 7/127 cut-off events. [2024-11-23 22:59:08,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 22:59:08,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 7/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 183 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2024-11-23 22:59:08,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 95 transitions, 194 flow [2024-11-23 22:59:08,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 95 transitions, 194 flow [2024-11-23 22:59:08,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 22:59:08,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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a8d9e06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 22:59:08,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-23 22:59:08,718 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-23 22:59:08,719 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-23 22:59:08,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 22:59:08,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:08,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:08,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-23 22:59:08,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1240058609, now seen corresponding path program 1 times [2024-11-23 22:59:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:08,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647165172] [2024-11-23 22:59:08,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:08,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:09,042 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-23 22:59:09,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:09,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647165172] [2024-11-23 22:59:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647165172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:09,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:09,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498621647] [2024-11-23 22:59:09,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:09,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:09,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:09,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:09,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:09,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2024-11-23 22:59:09,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 95 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-23 22:59:09,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:09,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2024-11-23 22:59:09,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:09,309 INFO L124 PetriNetUnfolderBase]: 32/293 cut-off events. [2024-11-23 22:59:09,309 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-23 22:59:09,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 293 events. 32/293 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1191 event pairs, 7 based on Foata normal form. 7/269 useless extension candidates. Maximal degree in co-relation 310. Up to 59 conditions per place. [2024-11-23 22:59:09,316 INFO L140 encePairwiseOnDemand]: 81/95 looper letters, 16 selfloop transitions, 8 changer transitions 1/102 dead transitions. [2024-11-23 22:59:09,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 256 flow [2024-11-23 22:59:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-23 22:59:09,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-11-23 22:59:09,342 INFO L175 Difference]: Start difference. First operand has 94 places, 95 transitions, 194 flow. Second operand 3 states and 266 transitions. [2024-11-23 22:59:09,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 256 flow [2024-11-23 22:59:09,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 102 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-23 22:59:09,356 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 256 flow [2024-11-23 22:59:09,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2024-11-23 22:59:09,366 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2024-11-23 22:59:09,366 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 256 flow [2024-11-23 22:59:09,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-23 22:59:09,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:09,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:09,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 22:59:09,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-23 22:59:09,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash 900447185, now seen corresponding path program 1 times [2024-11-23 22:59:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:09,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157884542] [2024-11-23 22:59:09,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:09,509 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-23 22:59:09,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:09,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157884542] [2024-11-23 22:59:09,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157884542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:09,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:09,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023907295] [2024-11-23 22:59:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:09,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:09,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:09,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:09,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:09,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2024-11-23 22:59:09,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-23 22:59:09,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:09,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2024-11-23 22:59:09,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:09,633 INFO L124 PetriNetUnfolderBase]: 27/308 cut-off events. [2024-11-23 22:59:09,634 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-23 22:59:09,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 308 events. 27/308 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1397 event pairs, 5 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 359. Up to 45 conditions per place. [2024-11-23 22:59:09,637 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 8 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2024-11-23 22:59:09,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 286 flow [2024-11-23 22:59:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2024-11-23 22:59:09,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9368421052631579 [2024-11-23 22:59:09,641 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 256 flow. Second operand 3 states and 267 transitions. [2024-11-23 22:59:09,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 286 flow [2024-11-23 22:59:09,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:09,647 INFO L231 Difference]: Finished difference. Result has 99 places, 101 transitions, 262 flow [2024-11-23 22:59:09,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=99, PETRI_TRANSITIONS=101} [2024-11-23 22:59:09,648 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2024-11-23 22:59:09,649 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 101 transitions, 262 flow [2024-11-23 22:59:09,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-23 22:59:09,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:09,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:09,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 22:59:09,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-23 22:59:09,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:09,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1013875584, now seen corresponding path program 1 times [2024-11-23 22:59:09,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:09,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174156212] [2024-11-23 22:59:09,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:09,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:09,714 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-23 22:59:09,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:09,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174156212] [2024-11-23 22:59:09,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174156212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:09,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:09,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:09,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118096833] [2024-11-23 22:59:09,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:09,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:09,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:09,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:09,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:09,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 95 [2024-11-23 22:59:09,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 101 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-23 22:59:09,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:09,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 95 [2024-11-23 22:59:09,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:09,890 INFO L124 PetriNetUnfolderBase]: 54/456 cut-off events. [2024-11-23 22:59:09,891 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2024-11-23 22:59:09,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 456 events. 54/456 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2524 event pairs, 23 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 627. Up to 104 conditions per place. [2024-11-23 22:59:09,897 INFO L140 encePairwiseOnDemand]: 89/95 looper letters, 19 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2024-11-23 22:59:09,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 334 flow [2024-11-23 22:59:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:09,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2024-11-23 22:59:09,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947368421052632 [2024-11-23 22:59:09,902 INFO L175 Difference]: Start difference. First operand has 99 places, 101 transitions, 262 flow. Second operand 3 states and 255 transitions. [2024-11-23 22:59:09,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 334 flow [2024-11-23 22:59:09,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:09,907 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 312 flow [2024-11-23 22:59:09,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2024-11-23 22:59:09,911 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 7 predicate places. [2024-11-23 22:59:09,911 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 312 flow [2024-11-23 22:59:09,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 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-23 22:59:09,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:09,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:09,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 22:59:09,912 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-23 22:59:09,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1899617166, now seen corresponding path program 1 times [2024-11-23 22:59:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:09,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276145573] [2024-11-23 22:59:09,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:10,064 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-23 22:59:10,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:10,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276145573] [2024-11-23 22:59:10,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276145573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:10,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:10,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052390669] [2024-11-23 22:59:10,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:10,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:10,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:10,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:10,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:10,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 95 [2024-11-23 22:59:10,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-23 22:59:10,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:10,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 95 [2024-11-23 22:59:10,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:10,215 INFO L124 PetriNetUnfolderBase]: 36/366 cut-off events. [2024-11-23 22:59:10,216 INFO L125 PetriNetUnfolderBase]: For 63/70 co-relation queries the response was YES. [2024-11-23 22:59:10,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 366 events. 36/366 cut-off events. For 63/70 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1940 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 495. Up to 51 conditions per place. [2024-11-23 22:59:10,219 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 8 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2024-11-23 22:59:10,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 109 transitions, 346 flow [2024-11-23 22:59:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-11-23 22:59:10,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9192982456140351 [2024-11-23 22:59:10,222 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 312 flow. Second operand 3 states and 262 transitions. [2024-11-23 22:59:10,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 109 transitions, 346 flow [2024-11-23 22:59:10,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:10,228 INFO L231 Difference]: Finished difference. Result has 103 places, 109 transitions, 334 flow [2024-11-23 22:59:10,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=103, PETRI_TRANSITIONS=109} [2024-11-23 22:59:10,231 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 9 predicate places. [2024-11-23 22:59:10,231 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 109 transitions, 334 flow [2024-11-23 22:59:10,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-23 22:59:10,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:10,231 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:10,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 22:59:10,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-23 22:59:10,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:10,233 INFO L85 PathProgramCache]: Analyzing trace with hash 568471512, now seen corresponding path program 1 times [2024-11-23 22:59:10,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:10,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714729628] [2024-11-23 22:59:10,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:10,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:10,373 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-23 22:59:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714729628] [2024-11-23 22:59:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714729628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131427859] [2024-11-23 22:59:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:10,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:10,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:10,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2024-11-23 22:59:10,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 109 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-23 22:59:10,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:10,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2024-11-23 22:59:10,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:10,556 INFO L124 PetriNetUnfolderBase]: 64/479 cut-off events. [2024-11-23 22:59:10,556 INFO L125 PetriNetUnfolderBase]: For 158/166 co-relation queries the response was YES. [2024-11-23 22:59:10,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 479 events. 64/479 cut-off events. For 158/166 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2701 event pairs, 13 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 796. Up to 109 conditions per place. [2024-11-23 22:59:10,561 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 16 selfloop transitions, 11 changer transitions 1/116 dead transitions. [2024-11-23 22:59:10,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 116 transitions, 416 flow [2024-11-23 22:59:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2024-11-23 22:59:10,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9052631578947369 [2024-11-23 22:59:10,564 INFO L175 Difference]: Start difference. First operand has 103 places, 109 transitions, 334 flow. Second operand 3 states and 258 transitions. [2024-11-23 22:59:10,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 116 transitions, 416 flow [2024-11-23 22:59:10,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 116 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:10,574 INFO L231 Difference]: Finished difference. Result has 105 places, 115 transitions, 408 flow [2024-11-23 22:59:10,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=105, PETRI_TRANSITIONS=115} [2024-11-23 22:59:10,575 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2024-11-23 22:59:10,575 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 115 transitions, 408 flow [2024-11-23 22:59:10,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-23 22:59:10,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:10,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:10,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 22:59:10,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-23 22:59:10,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1830908411, now seen corresponding path program 1 times [2024-11-23 22:59:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:10,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335695234] [2024-11-23 22:59:10,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:10,877 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-23 22:59:10,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:10,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335695234] [2024-11-23 22:59:10,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335695234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:10,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:10,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:59:10,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507582254] [2024-11-23 22:59:10,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:10,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:59:10,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:10,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:59:10,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:59:10,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 95 [2024-11-23 22:59:10,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 115 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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-23 22:59:10,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:10,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 95 [2024-11-23 22:59:10,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:11,090 INFO L124 PetriNetUnfolderBase]: 68/463 cut-off events. [2024-11-23 22:59:11,091 INFO L125 PetriNetUnfolderBase]: For 245/256 co-relation queries the response was YES. [2024-11-23 22:59:11,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 463 events. 68/463 cut-off events. For 245/256 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2585 event pairs, 13 based on Foata normal form. 3/438 useless extension candidates. Maximal degree in co-relation 818. Up to 65 conditions per place. [2024-11-23 22:59:11,095 INFO L140 encePairwiseOnDemand]: 88/95 looper letters, 14 selfloop transitions, 7 changer transitions 1/119 dead transitions. [2024-11-23 22:59:11,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 119 transitions, 444 flow [2024-11-23 22:59:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 22:59:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-23 22:59:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 504 transitions. [2024-11-23 22:59:11,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8842105263157894 [2024-11-23 22:59:11,098 INFO L175 Difference]: Start difference. First operand has 105 places, 115 transitions, 408 flow. Second operand 6 states and 504 transitions. [2024-11-23 22:59:11,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 119 transitions, 444 flow [2024-11-23 22:59:11,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 119 transitions, 408 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-23 22:59:11,108 INFO L231 Difference]: Finished difference. Result has 105 places, 114 transitions, 386 flow [2024-11-23 22:59:11,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=105, PETRI_TRANSITIONS=114} [2024-11-23 22:59:11,110 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2024-11-23 22:59:11,110 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 114 transitions, 386 flow [2024-11-23 22:59:11,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 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-23 22:59:11,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:11,111 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:11,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 22:59:11,111 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-23 22:59:11,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:11,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1081102747, now seen corresponding path program 1 times [2024-11-23 22:59:11,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:11,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028807998] [2024-11-23 22:59:11,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:11,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:59:11,150 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 22:59:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:59:11,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 22:59:11,216 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 22:59:11,217 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-23 22:59:11,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2024-11-23 22:59:11,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2024-11-23 22:59:11,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2024-11-23 22:59:11,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2024-11-23 22:59:11,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2024-11-23 22:59:11,223 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2024-11-23 22:59:11,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2024-11-23 22:59:11,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2024-11-23 22:59:11,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2024-11-23 22:59:11,224 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2024-11-23 22:59:11,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 22:59:11,225 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:11,229 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-23 22:59:11,229 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-23 22:59:11,268 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-23 22:59:11,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 123 transitions, 256 flow [2024-11-23 22:59:11,310 INFO L124 PetriNetUnfolderBase]: 10/195 cut-off events. [2024-11-23 22:59:11,310 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-23 22:59:11,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 195 events. 10/195 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 322 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 128. Up to 6 conditions per place. [2024-11-23 22:59:11,312 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 123 transitions, 256 flow [2024-11-23 22:59:11,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 123 transitions, 256 flow [2024-11-23 22:59:11,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 22:59:11,317 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7a8d9e06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 22:59:11,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-23 22:59:11,323 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-23 22:59:11,324 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-23 22:59:11,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 22:59:11,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:11,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:11,325 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-23 22:59:11,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash 292501930, now seen corresponding path program 1 times [2024-11-23 22:59:11,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:11,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272392327] [2024-11-23 22:59:11,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:11,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:11,371 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-23 22:59:11,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:11,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272392327] [2024-11-23 22:59:11,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272392327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:11,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:11,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:11,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300325187] [2024-11-23 22:59:11,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:11,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:11,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:11,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:11,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:11,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 123 [2024-11-23 22:59:11,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 123 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-23 22:59:11,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:11,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 123 [2024-11-23 22:59:11,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:11,904 INFO L124 PetriNetUnfolderBase]: 563/2345 cut-off events. [2024-11-23 22:59:11,904 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-23 22:59:11,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 2345 events. 563/2345 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 19524 event pairs, 195 based on Foata normal form. 53/2141 useless extension candidates. Maximal degree in co-relation 2679. Up to 666 conditions per place. [2024-11-23 22:59:11,926 INFO L140 encePairwiseOnDemand]: 105/123 looper letters, 26 selfloop transitions, 11 changer transitions 1/136 dead transitions. [2024-11-23 22:59:11,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 136 transitions, 361 flow [2024-11-23 22:59:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2024-11-23 22:59:11,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9295392953929539 [2024-11-23 22:59:11,929 INFO L175 Difference]: Start difference. First operand has 124 places, 123 transitions, 256 flow. Second operand 3 states and 343 transitions. [2024-11-23 22:59:11,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 136 transitions, 361 flow [2024-11-23 22:59:11,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 136 transitions, 361 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-23 22:59:11,982 INFO L231 Difference]: Finished difference. Result has 128 places, 130 transitions, 344 flow [2024-11-23 22:59:11,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=128, PETRI_TRANSITIONS=130} [2024-11-23 22:59:11,983 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2024-11-23 22:59:11,983 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 130 transitions, 344 flow [2024-11-23 22:59:11,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-23 22:59:11,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:11,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:11,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 22:59:11,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-23 22:59:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2107949484, now seen corresponding path program 1 times [2024-11-23 22:59:11,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:11,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224941063] [2024-11-23 22:59:11,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:11,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:12,025 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-23 22:59:12,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:12,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224941063] [2024-11-23 22:59:12,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224941063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:12,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:12,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966178144] [2024-11-23 22:59:12,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:12,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:12,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:12,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:12,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:12,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 123 [2024-11-23 22:59:12,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-23 22:59:12,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:12,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 123 [2024-11-23 22:59:12,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:12,493 INFO L124 PetriNetUnfolderBase]: 487/2652 cut-off events. [2024-11-23 22:59:12,493 INFO L125 PetriNetUnfolderBase]: For 239/249 co-relation queries the response was YES. [2024-11-23 22:59:12,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 2652 events. 487/2652 cut-off events. For 239/249 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 24805 event pairs, 174 based on Foata normal form. 0/2370 useless extension candidates. Maximal degree in co-relation 3290. Up to 500 conditions per place. [2024-11-23 22:59:12,515 INFO L140 encePairwiseOnDemand]: 118/123 looper letters, 14 selfloop transitions, 4 changer transitions 0/137 dead transitions. [2024-11-23 22:59:12,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 137 transitions, 394 flow [2024-11-23 22:59:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2024-11-23 22:59:12,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376693766937669 [2024-11-23 22:59:12,520 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 344 flow. Second operand 3 states and 346 transitions. [2024-11-23 22:59:12,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 137 transitions, 394 flow [2024-11-23 22:59:12,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 137 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:12,527 INFO L231 Difference]: Finished difference. Result has 129 places, 133 transitions, 352 flow [2024-11-23 22:59:12,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=129, PETRI_TRANSITIONS=133} [2024-11-23 22:59:12,529 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 5 predicate places. [2024-11-23 22:59:12,529 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 133 transitions, 352 flow [2024-11-23 22:59:12,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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-23 22:59:12,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:12,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:12,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 22:59:12,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-23 22:59:12,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -208258688, now seen corresponding path program 1 times [2024-11-23 22:59:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703244494] [2024-11-23 22:59:12,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:12,570 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-23 22:59:12,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:12,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703244494] [2024-11-23 22:59:12,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703244494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:12,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:12,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:12,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690700553] [2024-11-23 22:59:12,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:12,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:12,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:12,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:12,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 123 [2024-11-23 22:59:12,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 133 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-23 22:59:12,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:12,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 123 [2024-11-23 22:59:12,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:12,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [132#true, Black: 127#true, 137#true, Black: 134#(= |#race~data~0| 0), 123#true, 36#L692-2true, 82#L689-3true, 68#L704-1true, 125#true]) [2024-11-23 22:59:12,822 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2024-11-23 22:59:12,822 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-23 22:59:12,822 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-23 22:59:12,822 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-23 22:59:13,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [132#true, Black: 127#true, Black: 134#(= |#race~data~0| 0), 137#true, 7#L691-3true, 123#true, 36#L692-2true, 68#L704-1true, 125#true]) [2024-11-23 22:59:13,065 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-23 22:59:13,065 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-23 22:59:13,065 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-23 22:59:13,065 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-23 22:59:13,357 INFO L124 PetriNetUnfolderBase]: 1078/4632 cut-off events. [2024-11-23 22:59:13,357 INFO L125 PetriNetUnfolderBase]: For 832/973 co-relation queries the response was YES. [2024-11-23 22:59:13,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7774 conditions, 4632 events. 1078/4632 cut-off events. For 832/973 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 46156 event pairs, 540 based on Foata normal form. 39/4073 useless extension candidates. Maximal degree in co-relation 6529. Up to 1374 conditions per place. [2024-11-23 22:59:13,396 INFO L140 encePairwiseOnDemand]: 115/123 looper letters, 28 selfloop transitions, 12 changer transitions 0/147 dead transitions. [2024-11-23 22:59:13,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 147 transitions, 476 flow [2024-11-23 22:59:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:13,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2024-11-23 22:59:13,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9024390243902439 [2024-11-23 22:59:13,398 INFO L175 Difference]: Start difference. First operand has 129 places, 133 transitions, 352 flow. Second operand 3 states and 333 transitions. [2024-11-23 22:59:13,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 147 transitions, 476 flow [2024-11-23 22:59:13,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 147 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:13,403 INFO L231 Difference]: Finished difference. Result has 131 places, 143 transitions, 450 flow [2024-11-23 22:59:13,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=131, PETRI_TRANSITIONS=143} [2024-11-23 22:59:13,404 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 7 predicate places. [2024-11-23 22:59:13,405 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 143 transitions, 450 flow [2024-11-23 22:59:13,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-23 22:59:13,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:13,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:13,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 22:59:13,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-23 22:59:13,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1352639415, now seen corresponding path program 1 times [2024-11-23 22:59:13,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:13,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973955239] [2024-11-23 22:59:13,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:13,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:13,473 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-23 22:59:13,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:13,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973955239] [2024-11-23 22:59:13,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973955239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:13,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:13,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:13,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176393792] [2024-11-23 22:59:13,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:13,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:13,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:13,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:13,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:13,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 123 [2024-11-23 22:59:13,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 143 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-23 22:59:13,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:13,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 123 [2024-11-23 22:59:13,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:14,083 INFO L124 PetriNetUnfolderBase]: 734/3783 cut-off events. [2024-11-23 22:59:14,083 INFO L125 PetriNetUnfolderBase]: For 968/1202 co-relation queries the response was YES. [2024-11-23 22:59:14,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6443 conditions, 3783 events. 734/3783 cut-off events. For 968/1202 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 38857 event pairs, 217 based on Foata normal form. 3/3313 useless extension candidates. Maximal degree in co-relation 4267. Up to 663 conditions per place. [2024-11-23 22:59:14,122 INFO L140 encePairwiseOnDemand]: 117/123 looper letters, 16 selfloop transitions, 7 changer transitions 0/151 dead transitions. [2024-11-23 22:59:14,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 151 transitions, 523 flow [2024-11-23 22:59:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:14,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:14,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2024-11-23 22:59:14,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926829268292683 [2024-11-23 22:59:14,127 INFO L175 Difference]: Start difference. First operand has 131 places, 143 transitions, 450 flow. Second operand 3 states and 342 transitions. [2024-11-23 22:59:14,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 151 transitions, 523 flow [2024-11-23 22:59:14,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:14,138 INFO L231 Difference]: Finished difference. Result has 133 places, 148 transitions, 482 flow [2024-11-23 22:59:14,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=133, PETRI_TRANSITIONS=148} [2024-11-23 22:59:14,140 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 9 predicate places. [2024-11-23 22:59:14,140 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 148 transitions, 482 flow [2024-11-23 22:59:14,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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-23 22:59:14,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:14,141 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:14,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 22:59:14,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-23 22:59:14,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1964221198, now seen corresponding path program 1 times [2024-11-23 22:59:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932119479] [2024-11-23 22:59:14,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:14,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:14,188 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-23 22:59:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932119479] [2024-11-23 22:59:14,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932119479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:14,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:14,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 22:59:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876473374] [2024-11-23 22:59:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:14,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:59:14,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:14,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:59:14,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:59:14,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 123 [2024-11-23 22:59:14,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 148 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-23 22:59:14,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:14,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 123 [2024-11-23 22:59:14,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:14,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, Black: 134#(= |#race~data~0| 0), 123#true, 36#L692-2true, 82#L689-3true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 68#L704-1true, 142#true, 125#true]) [2024-11-23 22:59:14,437 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2024-11-23 22:59:14,438 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-23 22:59:14,438 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2024-11-23 22:59:14,438 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2024-11-23 22:59:14,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, Black: 134#(= |#race~data~0| 0), 7#L691-3true, 123#true, 36#L692-2true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 68#L704-1true, 142#true, 125#true]) [2024-11-23 22:59:14,690 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2024-11-23 22:59:14,690 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-23 22:59:14,690 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2024-11-23 22:59:14,690 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2024-11-23 22:59:15,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][120], [75#L692-7true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 110#L692-2true, Black: 134#(= |#race~data~0| 0), 123#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 68#L704-1true, 142#true, 125#true]) [2024-11-23 22:59:15,025 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-23 22:59:15,026 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:15,026 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:15,026 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:15,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][35], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 110#L692-2true, Black: 134#(= |#race~data~0| 0), 123#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 68#L704-1true, 52#L693true, 125#true, 142#true]) [2024-11-23 22:59:15,148 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-23 22:59:15,148 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-23 22:59:15,148 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-23 22:59:15,148 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-23 22:59:15,328 INFO L124 PetriNetUnfolderBase]: 1587/6317 cut-off events. [2024-11-23 22:59:15,328 INFO L125 PetriNetUnfolderBase]: For 3315/3595 co-relation queries the response was YES. [2024-11-23 22:59:15,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12392 conditions, 6317 events. 1587/6317 cut-off events. For 3315/3595 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 66491 event pairs, 516 based on Foata normal form. 46/5552 useless extension candidates. Maximal degree in co-relation 10314. Up to 1835 conditions per place. [2024-11-23 22:59:15,372 INFO L140 encePairwiseOnDemand]: 114/123 looper letters, 31 selfloop transitions, 19 changer transitions 0/166 dead transitions. [2024-11-23 22:59:15,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 166 transitions, 667 flow [2024-11-23 22:59:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:59:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:59:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2024-11-23 22:59:15,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9132791327913279 [2024-11-23 22:59:15,374 INFO L175 Difference]: Start difference. First operand has 133 places, 148 transitions, 482 flow. Second operand 3 states and 337 transitions. [2024-11-23 22:59:15,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 166 transitions, 667 flow [2024-11-23 22:59:15,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 166 transitions, 653 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:15,382 INFO L231 Difference]: Finished difference. Result has 135 places, 163 transitions, 650 flow [2024-11-23 22:59:15,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=135, PETRI_TRANSITIONS=163} [2024-11-23 22:59:15,384 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 11 predicate places. [2024-11-23 22:59:15,385 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 163 transitions, 650 flow [2024-11-23 22:59:15,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-23 22:59:15,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:15,386 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:15,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 22:59:15,386 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-23 22:59:15,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:15,387 INFO L85 PathProgramCache]: Analyzing trace with hash -630283222, now seen corresponding path program 1 times [2024-11-23 22:59:15,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:15,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040054562] [2024-11-23 22:59:15,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:15,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:59:15,564 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-23 22:59:15,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:59:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040054562] [2024-11-23 22:59:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040054562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:59:15,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:59:15,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:59:15,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140194283] [2024-11-23 22:59:15,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:59:15,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:59:15,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:59:15,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:59:15,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:59:15,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 123 [2024-11-23 22:59:15,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 163 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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-23 22:59:15,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:59:15,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 123 [2024-11-23 22:59:15,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:59:16,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [75#L692-7true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 68#L704-1true, 125#true]) [2024-11-23 22:59:16,375 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,375 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:16,375 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:16,375 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L699-4-->L699-5: Formula: (= |v_ULTIMATE.start_main_#t~nondet8#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][129], [75#L692-7true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 129#(= |#race~threads_alive~0| 0), 147#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 35#L699-5true, Black: 134#(= |#race~data~0| 0), 123#true, 152#true, Black: 137#true, 125#true]) [2024-11-23 22:59:16,403 INFO L294 olderBase$Statistics]: this new event has 112 ancestors and is cut-off event [2024-11-23 22:59:16,404 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-23 22:59:16,404 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-23 22:59:16,404 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-11-23 22:59:16,420 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [75#L692-7true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 68#L704-1true, 125#true]) [2024-11-23 22:59:16,420 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,421 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,421 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:16,421 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:16,421 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [75#L692-7true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 79#L692-1true, Black: 134#(= |#race~data~0| 0), 123#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 152#true, 68#L704-1true, 125#true]) [2024-11-23 22:59:16,426 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2024-11-23 22:59:16,426 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2024-11-23 22:59:16,426 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-23 22:59:16,426 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-23 22:59:16,427 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][123], [75#L692-7true, Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 147#true, Black: 127#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 152#true, 68#L704-1true, 125#true]) [2024-11-23 22:59:16,427 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,427 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,427 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:16,427 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:16,427 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,427 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][74], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 27#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 127#true, 147#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 68#L704-1true, 125#true]) [2024-11-23 22:59:16,477 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,477 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,477 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-11-23 22:59:16,477 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-11-23 22:59:16,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][74], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 152#true, 68#L704-1true, 52#L693true, 125#true]) [2024-11-23 22:59:16,513 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-23 22:59:16,513 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-23 22:59:16,513 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-23 22:59:16,513 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-23 22:59:16,514 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([263] L704-3-->L704-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][74], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 127#true, 147#true, 110#L692-2true, Black: 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 134#(= |#race~data~0| 0), 123#true, 152#true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 68#L704-1true, 52#L693true, 125#true]) [2024-11-23 22:59:16,515 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2024-11-23 22:59:16,515 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-23 22:59:16,515 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-23 22:59:16,515 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-23 22:59:16,515 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-11-23 22:59:16,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L692-5-->L692-6: Formula: (= |v_#race~threads_alive~0_13| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][84], [Black: 144#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 129#(= |#race~threads_alive~0| 0), 59#L700true, 110#L692-2true, Black: 147#true, Black: 134#(= |#race~data~0| 0), 123#true, 149#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 152#true, 118#L692-6true, Black: 139#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet8#1|), 125#true]) [2024-11-23 22:59:16,633 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is not cut-off event [2024-11-23 22:59:16,633 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-23 22:59:16,633 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-23 22:59:16,633 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is not cut-off event [2024-11-23 22:59:16,743 INFO L124 PetriNetUnfolderBase]: 2085/8293 cut-off events. [2024-11-23 22:59:16,744 INFO L125 PetriNetUnfolderBase]: For 5321/5986 co-relation queries the response was YES. [2024-11-23 22:59:16,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16955 conditions, 8293 events. 2085/8293 cut-off events. For 5321/5986 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 94629 event pairs, 555 based on Foata normal form. 54/7315 useless extension candidates. Maximal degree in co-relation 10169. Up to 1525 conditions per place. [2024-11-23 22:59:16,812 INFO L140 encePairwiseOnDemand]: 115/123 looper letters, 23 selfloop transitions, 9 changer transitions 1/180 dead transitions. [2024-11-23 22:59:16,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 180 transitions, 750 flow [2024-11-23 22:59:16,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 22:59:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-23 22:59:16,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 659 transitions. [2024-11-23 22:59:16,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8929539295392954 [2024-11-23 22:59:16,815 INFO L175 Difference]: Start difference. First operand has 135 places, 163 transitions, 650 flow. Second operand 6 states and 659 transitions. [2024-11-23 22:59:16,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 180 transitions, 750 flow [2024-11-23 22:59:16,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 180 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:59:16,842 INFO L231 Difference]: Finished difference. Result has 140 places, 170 transitions, 663 flow [2024-11-23 22:59:16,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=140, PETRI_TRANSITIONS=170} [2024-11-23 22:59:16,843 INFO L279 CegarLoopForPetriNet]: 124 programPoint places, 16 predicate places. [2024-11-23 22:59:16,843 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 170 transitions, 663 flow [2024-11-23 22:59:16,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 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-23 22:59:16,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:59:16,844 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:16,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 22:59:16,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-11-23 22:59:16,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:59:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash -642514493, now seen corresponding path program 1 times [2024-11-23 22:59:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:59:16,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978690871] [2024-11-23 22:59:16,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:59:16,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:59:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:59:16,874 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 22:59:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:59:16,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 22:59:16,899 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 22:59:16,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2024-11-23 22:59:16,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2024-11-23 22:59:16,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2024-11-23 22:59:16,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2024-11-23 22:59:16,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2024-11-23 22:59:16,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2024-11-23 22:59:16,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2024-11-23 22:59:16,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2024-11-23 22:59:16,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2024-11-23 22:59:16,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2024-11-23 22:59:16,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2024-11-23 22:59:16,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2024-11-23 22:59:16,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2024-11-23 22:59:16,901 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2024-11-23 22:59:16,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 22:59:16,902 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:59:16,961 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2024-11-23 22:59:16,961 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 22:59:16,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:59:16 BasicIcfg [2024-11-23 22:59:16,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 22:59:16,970 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 22:59:16,970 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 22:59:16,971 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 22:59:16,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:59:08" (3/4) ... [2024-11-23 22:59:16,973 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-23 22:59:17,051 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 6. [2024-11-23 22:59:17,106 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 22:59:17,107 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 22:59:17,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 22:59:17,108 INFO L158 Benchmark]: Toolchain (without parser) took 9861.47ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 92.7MB in the beginning and 373.2MB in the end (delta: -280.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-11-23 22:59:17,108 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:59:17,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.69ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 73.1MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 22:59:17,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.90ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 71.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:59:17,109 INFO L158 Benchmark]: Boogie Preprocessor took 26.49ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 70.4MB in the end (delta: 917.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 22:59:17,110 INFO L158 Benchmark]: RCFGBuilder took 503.60ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 56.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 22:59:17,110 INFO L158 Benchmark]: TraceAbstraction took 8602.25ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 56.1MB in the beginning and 385.7MB in the end (delta: -329.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:59:17,110 INFO L158 Benchmark]: Witness Printer took 136.69ms. Allocated memory is still 427.8MB. Free memory was 385.7MB in the beginning and 373.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 22:59:17,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.69ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 73.1MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.90ms. Allocated memory is still 117.4MB. Free memory was 73.1MB in the beginning and 71.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.49ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 70.4MB in the end (delta: 917.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 503.60ms. Allocated memory is still 117.4MB. Free memory was 70.4MB in the beginning and 56.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8602.25ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 56.1MB in the beginning and 385.7MB in the end (delta: -329.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 136.69ms. Allocated memory is still 427.8MB. Free memory was 385.7MB in the beginning and 373.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 692]: Data race detected Data race detected The following path leads to a data race: [L685] 0 int threads_alive = 0; VAL [threads_alive=0] [L686] 0 int data = 0; VAL [data=0, threads_alive=0] [L687] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}, threads_alive=0] [L696] 0 int threads_total = __VERIFIER_nondet_int(); VAL [data=0, data_mutex={1:0}, threads_alive=0, threads_total=2] [L697] CALL 0 assume_abort_if_not(threads_total >= 0) [L682] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, data=0, data_mutex={1:0}, threads_alive=0] [L697] RET 0 assume_abort_if_not(threads_total >= 0) [L698] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_alive=0, threads_total=2] [L699] 0 threads_alive++ VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L700] 0 pthread_t tid; VAL [data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2] [L701] FCALL, FORK 0 pthread_create(&tid, ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_alive=1, threads_total=2, tid=-1] [L698] 0 i++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L698] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=1, threads_total=2] [L690] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=1] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] [L699] 0 threads_alive++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_alive=2, threads_total=2] [L692] 1 threads_alive-- VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_alive=2] Now there is a data race on ~threads_alive~0 between C: threads_alive++ [699] and C: threads_alive-- [692] - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 41 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=5, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 148 locations, 14 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 88 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 37 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=663occurred in iteration=6, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-23 22:59:17,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31bbaf7b-1700-40cb-9b65-dae28fd03d3d/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)