./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX --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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:35:35,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:35:35,256 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-08 16:35:35,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:35:35,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:35:35,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:35:35,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:35:35,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:35:35,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:35:35,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:35:35,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:35:35,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:35:35,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:35:35,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:35:35,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:35:35,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:35:35,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:35:35,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:35:35,296 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:35:35,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:35:35,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:35:35,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:35:35,301 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 16:35:35,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:35:35,301 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 16:35:35,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:35:35,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:35:35,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:35:35,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:35:35,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:35:35,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:35:35,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:35:35,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:35:35,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:35:35,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:35:35,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:35:35,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:35:35,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:35:35,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:35:35,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:35:35,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:35:35,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2024-11-08 16:35:35,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:35:35,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:35:35,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:35:35,626 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:35:35,626 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:35:35,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i Unable to find full path for "g++" [2024-11-08 16:35:37,660 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:35:37,987 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:35:37,989 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-08 16:35:38,011 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/data/dd77e4885/68cbca33c3474381b6339f2fd885b817/FLAG29ad0cf8c [2024-11-08 16:35:38,239 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/data/dd77e4885/68cbca33c3474381b6339f2fd885b817 [2024-11-08 16:35:38,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:35:38,244 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:35:38,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:35:38,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:35:38,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:35:38,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:35:38" (1/1) ... [2024-11-08 16:35:38,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e7bed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:38, skipping insertion in model container [2024-11-08 16:35:38,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:35:38" (1/1) ... [2024-11-08 16:35:38,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:35:38,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:35:38,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:35:38,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:35:39,015 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:35:39,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39 WrapperNode [2024-11-08 16:35:39,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:35:39,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:35:39,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:35:39,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:35:39,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,104 INFO L138 Inliner]: procedures = 273, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 130 [2024-11-08 16:35:39,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:35:39,105 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:35:39,105 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:35:39,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:35:39,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:35:39,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:35:39,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:35:39,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:35:39,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (1/1) ... [2024-11-08 16:35:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:35:39,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:39,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:35:39,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:35:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:35:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-08 16:35:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-08 16:35:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 16:35:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-08 16:35:39,224 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-08 16:35:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:35:39,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:35:39,227 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 16:35:39,419 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:35:39,422 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:35:39,885 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 16:35:39,885 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:35:39,932 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:35:39,933 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:35:39,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:35:39 BoogieIcfgContainer [2024-11-08 16:35:39,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:35:39,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:35:39,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:35:39,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:35:39,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:35:38" (1/3) ... [2024-11-08 16:35:39,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3879bd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:35:39, skipping insertion in model container [2024-11-08 16:35:39,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:39" (2/3) ... [2024-11-08 16:35:39,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3879bd6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:35:39, skipping insertion in model container [2024-11-08 16:35:39,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:35:39" (3/3) ... [2024-11-08 16:35:39,946 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-11-08 16:35:39,967 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:35:39,967 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-08 16:35:39,967 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 16:35:40,067 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-08 16:35:40,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 189 transitions, 385 flow [2024-11-08 16:35:40,240 INFO L124 PetriNetUnfolderBase]: 30/285 cut-off events. [2024-11-08 16:35:40,240 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-08 16:35:40,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 285 events. 30/285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 624 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. [2024-11-08 16:35:40,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 189 transitions, 385 flow [2024-11-08 16:35:40,266 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 189 transitions, 385 flow [2024-11-08 16:35:40,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:35:40,293 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, 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;@624c8933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:35:40,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-08 16:35:40,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:35:40,308 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-08 16:35:40,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:35:40,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:40,311 INFO L204 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] [2024-11-08 16:35:40,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 18186226, now seen corresponding path program 1 times [2024-11-08 16:35:40,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:40,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110055669] [2024-11-08 16:35:40,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:40,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:40,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110055669] [2024-11-08 16:35:40,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110055669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:40,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:40,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:40,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141282569] [2024-11-08 16:35:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:40,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:40,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:40,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:40,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2024-11-08 16:35:40,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 189 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:40,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:40,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2024-11-08 16:35:40,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:40,859 INFO L124 PetriNetUnfolderBase]: 65/552 cut-off events. [2024-11-08 16:35:40,859 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-08 16:35:40,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 552 events. 65/552 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2277 event pairs, 3 based on Foata normal form. 2/448 useless extension candidates. Maximal degree in co-relation 457. Up to 57 conditions per place. [2024-11-08 16:35:40,868 INFO L140 encePairwiseOnDemand]: 184/189 looper letters, 15 selfloop transitions, 2 changer transitions 2/186 dead transitions. [2024-11-08 16:35:40,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 186 transitions, 413 flow [2024-11-08 16:35:40,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:35:40,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2024-11-08 16:35:40,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9294532627865961 [2024-11-08 16:35:40,886 INFO L175 Difference]: Start difference. First operand has 174 places, 189 transitions, 385 flow. Second operand 3 states and 527 transitions. [2024-11-08 16:35:40,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 186 transitions, 413 flow [2024-11-08 16:35:40,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 186 transitions, 413 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:35:40,896 INFO L231 Difference]: Finished difference. Result has 175 places, 184 transitions, 379 flow [2024-11-08 16:35:40,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=175, PETRI_TRANSITIONS=184} [2024-11-08 16:35:40,903 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 1 predicate places. [2024-11-08 16:35:40,904 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 184 transitions, 379 flow [2024-11-08 16:35:40,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:40,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:40,905 INFO L204 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] [2024-11-08 16:35:40,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:35:40,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -512711079, now seen corresponding path program 1 times [2024-11-08 16:35:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616463440] [2024-11-08 16:35:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:41,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:41,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616463440] [2024-11-08 16:35:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616463440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:41,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:41,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027856857] [2024-11-08 16:35:41,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:41,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:41,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:41,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:41,107 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 189 [2024-11-08 16:35:41,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 184 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:41,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:41,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 189 [2024-11-08 16:35:41,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:41,289 INFO L124 PetriNetUnfolderBase]: 128/719 cut-off events. [2024-11-08 16:35:41,289 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 16:35:41,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 719 events. 128/719 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3531 event pairs, 8 based on Foata normal form. 0/591 useless extension candidates. Maximal degree in co-relation 828. Up to 97 conditions per place. [2024-11-08 16:35:41,298 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 27 selfloop transitions, 8 changer transitions 0/199 dead transitions. [2024-11-08 16:35:41,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 199 transitions, 479 flow [2024-11-08 16:35:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:35:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2024-11-08 16:35:41,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9506172839506173 [2024-11-08 16:35:41,304 INFO L175 Difference]: Start difference. First operand has 175 places, 184 transitions, 379 flow. Second operand 3 states and 539 transitions. [2024-11-08 16:35:41,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 199 transitions, 479 flow [2024-11-08 16:35:41,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 199 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:35:41,312 INFO L231 Difference]: Finished difference. Result has 175 places, 192 transitions, 445 flow [2024-11-08 16:35:41,315 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=175, PETRI_TRANSITIONS=192} [2024-11-08 16:35:41,316 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 1 predicate places. [2024-11-08 16:35:41,316 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 192 transitions, 445 flow [2024-11-08 16:35:41,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:41,317 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:41,317 INFO L204 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] [2024-11-08 16:35:41,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:35:41,317 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:41,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:41,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1445639156, now seen corresponding path program 1 times [2024-11-08 16:35:41,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:41,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523201712] [2024-11-08 16:35:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:41,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:41,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523201712] [2024-11-08 16:35:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523201712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:41,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:41,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165531640] [2024-11-08 16:35:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:41,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:41,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:41,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:41,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:41,455 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 189 [2024-11-08 16:35:41,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 192 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:41,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:41,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 189 [2024-11-08 16:35:41,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:41,628 INFO L124 PetriNetUnfolderBase]: 125/804 cut-off events. [2024-11-08 16:35:41,628 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-08 16:35:41,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 804 events. 125/804 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4151 event pairs, 10 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 823. Up to 67 conditions per place. [2024-11-08 16:35:41,634 INFO L140 encePairwiseOnDemand]: 185/189 looper letters, 19 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2024-11-08 16:35:41,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 197 transitions, 497 flow [2024-11-08 16:35:41,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:35:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2024-11-08 16:35:41,636 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453262786596119 [2024-11-08 16:35:41,636 INFO L175 Difference]: Start difference. First operand has 175 places, 192 transitions, 445 flow. Second operand 3 states and 536 transitions. [2024-11-08 16:35:41,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 197 transitions, 497 flow [2024-11-08 16:35:41,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 197 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:35:41,642 INFO L231 Difference]: Finished difference. Result has 174 places, 192 transitions, 439 flow [2024-11-08 16:35:41,643 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=439, PETRI_PLACES=174, PETRI_TRANSITIONS=192} [2024-11-08 16:35:41,643 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 0 predicate places. [2024-11-08 16:35:41,644 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 192 transitions, 439 flow [2024-11-08 16:35:41,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:41,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:41,645 INFO L204 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] [2024-11-08 16:35:41,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:35:41,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:41,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1063626390, now seen corresponding path program 1 times [2024-11-08 16:35:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:41,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078722984] [2024-11-08 16:35:41,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:41,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:41,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078722984] [2024-11-08 16:35:41,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078722984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:41,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:35:41,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307702429] [2024-11-08 16:35:41,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:35:41,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:41,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:35:41,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:35:42,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 189 [2024-11-08 16:35:42,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 192 transitions, 439 flow. Second operand has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:42,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:42,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 189 [2024-11-08 16:35:42,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:42,216 INFO L124 PetriNetUnfolderBase]: 113/696 cut-off events. [2024-11-08 16:35:42,217 INFO L125 PetriNetUnfolderBase]: For 17/24 co-relation queries the response was YES. [2024-11-08 16:35:42,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 696 events. 113/696 cut-off events. For 17/24 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3369 event pairs, 18 based on Foata normal form. 2/587 useless extension candidates. Maximal degree in co-relation 685. Up to 84 conditions per place. [2024-11-08 16:35:42,223 INFO L140 encePairwiseOnDemand]: 180/189 looper letters, 27 selfloop transitions, 2 changer transitions 6/205 dead transitions. [2024-11-08 16:35:42,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 205 transitions, 535 flow [2024-11-08 16:35:42,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:35:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:35:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1026 transitions. [2024-11-08 16:35:42,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-08 16:35:42,228 INFO L175 Difference]: Start difference. First operand has 174 places, 192 transitions, 439 flow. Second operand 6 states and 1026 transitions. [2024-11-08 16:35:42,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 205 transitions, 535 flow [2024-11-08 16:35:42,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 205 transitions, 535 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:35:42,235 INFO L231 Difference]: Finished difference. Result has 183 places, 192 transitions, 459 flow [2024-11-08 16:35:42,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=183, PETRI_TRANSITIONS=192} [2024-11-08 16:35:42,238 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 9 predicate places. [2024-11-08 16:35:42,238 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 192 transitions, 459 flow [2024-11-08 16:35:42,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 166.6) internal successors, (833), 5 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:42,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:42,240 INFO L204 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] [2024-11-08 16:35:42,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:35:42,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:42,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2031214254, now seen corresponding path program 1 times [2024-11-08 16:35:42,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:42,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439939744] [2024-11-08 16:35:42,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:42,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:42,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439939744] [2024-11-08 16:35:42,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439939744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:42,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:35:42,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940459368] [2024-11-08 16:35:42,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:42,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:42,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:42,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 189 [2024-11-08 16:35:42,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 192 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:42,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:42,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 189 [2024-11-08 16:35:42,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:42,532 INFO L124 PetriNetUnfolderBase]: 99/631 cut-off events. [2024-11-08 16:35:42,533 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-08 16:35:42,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 631 events. 99/631 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2711 event pairs, 10 based on Foata normal form. 1/533 useless extension candidates. Maximal degree in co-relation 712. Up to 64 conditions per place. [2024-11-08 16:35:42,537 INFO L140 encePairwiseOnDemand]: 186/189 looper letters, 17 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2024-11-08 16:35:42,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 198 transitions, 509 flow [2024-11-08 16:35:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:42,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:35:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2024-11-08 16:35:42,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9559082892416225 [2024-11-08 16:35:42,539 INFO L175 Difference]: Start difference. First operand has 183 places, 192 transitions, 459 flow. Second operand 3 states and 542 transitions. [2024-11-08 16:35:42,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 198 transitions, 509 flow [2024-11-08 16:35:42,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 198 transitions, 495 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-08 16:35:42,545 INFO L231 Difference]: Finished difference. Result has 178 places, 193 transitions, 457 flow [2024-11-08 16:35:42,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=178, PETRI_TRANSITIONS=193} [2024-11-08 16:35:42,546 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 4 predicate places. [2024-11-08 16:35:42,546 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 193 transitions, 457 flow [2024-11-08 16:35:42,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:42,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:42,547 INFO L204 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, 1, 1, 1] [2024-11-08 16:35:42,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:35:42,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:42,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash -160721370, now seen corresponding path program 1 times [2024-11-08 16:35:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:42,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793370626] [2024-11-08 16:35:42,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:42,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:42,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793370626] [2024-11-08 16:35:42,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793370626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:42,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:42,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:35:42,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714855434] [2024-11-08 16:35:42,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:42,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:35:42,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:42,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:35:42,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:35:42,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2024-11-08 16:35:42,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 193 transitions, 457 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:42,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:42,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2024-11-08 16:35:42,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:42,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][189], [116#L1058-11true, 200#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 175#true, Black: 180#true, Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 185#true, 204#true, 150#L1048-16true]) [2024-11-08 16:35:42,825 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is not cut-off event [2024-11-08 16:35:42,825 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is not cut-off event [2024-11-08 16:35:42,825 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:42,825 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:42,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][189], [200#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 175#true, Black: 180#true, Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), 117#L1058-14true, Black: 185#true, 204#true, 150#L1048-16true]) [2024-11-08 16:35:42,833 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event [2024-11-08 16:35:42,833 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:42,833 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2024-11-08 16:35:42,833 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2024-11-08 16:35:42,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][189], [200#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 175#true, Black: 180#true, 102#L1058-27true, Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 185#true, 204#true, 150#L1048-16true]) [2024-11-08 16:35:42,873 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is not cut-off event [2024-11-08 16:35:42,873 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-11-08 16:35:42,873 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-08 16:35:42,873 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is not cut-off event [2024-11-08 16:35:42,934 INFO L124 PetriNetUnfolderBase]: 208/1006 cut-off events. [2024-11-08 16:35:42,934 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-08 16:35:42,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1006 events. 208/1006 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5735 event pairs, 20 based on Foata normal form. 1/889 useless extension candidates. Maximal degree in co-relation 1271. Up to 102 conditions per place. [2024-11-08 16:35:42,941 INFO L140 encePairwiseOnDemand]: 176/189 looper letters, 36 selfloop transitions, 13 changer transitions 0/218 dead transitions. [2024-11-08 16:35:42,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 218 transitions, 607 flow [2024-11-08 16:35:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:35:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 16:35:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 706 transitions. [2024-11-08 16:35:42,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338624338624338 [2024-11-08 16:35:42,944 INFO L175 Difference]: Start difference. First operand has 178 places, 193 transitions, 457 flow. Second operand 4 states and 706 transitions. [2024-11-08 16:35:42,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 218 transitions, 607 flow [2024-11-08 16:35:42,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 218 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 16:35:42,950 INFO L231 Difference]: Finished difference. Result has 183 places, 204 transitions, 555 flow [2024-11-08 16:35:42,951 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=183, PETRI_TRANSITIONS=204} [2024-11-08 16:35:42,953 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 9 predicate places. [2024-11-08 16:35:42,954 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 204 transitions, 555 flow [2024-11-08 16:35:42,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:42,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:42,955 INFO L204 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, 1, 1, 1, 1] [2024-11-08 16:35:42,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:35:42,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:42,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash -497405359, now seen corresponding path program 1 times [2024-11-08 16:35:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:42,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331379140] [2024-11-08 16:35:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:43,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:43,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331379140] [2024-11-08 16:35:43,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331379140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:43,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:43,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:35:43,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682923741] [2024-11-08 16:35:43,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:43,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:35:43,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:43,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:35:43,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:35:43,266 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2024-11-08 16:35:43,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 204 transitions, 555 flow. Second operand has 4 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:43,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:43,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2024-11-08 16:35:43,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:43,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][196], [Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 175#true, Black: 180#true, 70#L1059-10true, Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 185#true, 204#true, 150#L1048-16true]) [2024-11-08 16:35:43,429 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-11-08 16:35:43,429 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-08 16:35:43,429 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-08 16:35:43,429 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-11-08 16:35:43,461 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L1059-15-->L1059-16: Formula: (= v_~threads_mask~0_22 |v_ULTIMATE.start_main_#t~bitwise18#1_6|) InVars {ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} OutVars{~threads_mask~0=v_~threads_mask~0_22, ULTIMATE.start_main_#t~bitwise18#1=|v_ULTIMATE.start_main_#t~bitwise18#1_6|} AuxVars[] AssignedVars[~threads_mask~0][213], [Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 180#true, 175#true, 98#L1059-16true, Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), Black: 185#true, 204#true, 150#L1048-16true]) [2024-11-08 16:35:43,461 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-11-08 16:35:43,461 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 16:35:43,462 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-08 16:35:43,462 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-11-08 16:35:43,477 INFO L124 PetriNetUnfolderBase]: 212/1103 cut-off events. [2024-11-08 16:35:43,478 INFO L125 PetriNetUnfolderBase]: For 360/370 co-relation queries the response was YES. [2024-11-08 16:35:43,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 1103 events. 212/1103 cut-off events. For 360/370 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6672 event pairs, 20 based on Foata normal form. 5/978 useless extension candidates. Maximal degree in co-relation 1550. Up to 168 conditions per place. [2024-11-08 16:35:43,485 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 34 selfloop transitions, 9 changer transitions 0/222 dead transitions. [2024-11-08 16:35:43,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 222 transitions, 711 flow [2024-11-08 16:35:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:35:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 16:35:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 710 transitions. [2024-11-08 16:35:43,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9391534391534392 [2024-11-08 16:35:43,487 INFO L175 Difference]: Start difference. First operand has 183 places, 204 transitions, 555 flow. Second operand 4 states and 710 transitions. [2024-11-08 16:35:43,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 222 transitions, 711 flow [2024-11-08 16:35:43,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 222 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:35:43,493 INFO L231 Difference]: Finished difference. Result has 188 places, 210 transitions, 634 flow [2024-11-08 16:35:43,494 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=634, PETRI_PLACES=188, PETRI_TRANSITIONS=210} [2024-11-08 16:35:43,494 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 14 predicate places. [2024-11-08 16:35:43,494 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 210 transitions, 634 flow [2024-11-08 16:35:43,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:43,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:43,495 INFO L204 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, 1, 1, 1, 1] [2024-11-08 16:35:43,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:35:43,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:43,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1382516246, now seen corresponding path program 1 times [2024-11-08 16:35:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949560678] [2024-11-08 16:35:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:43,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949560678] [2024-11-08 16:35:43,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949560678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:43,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:43,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:35:43,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227237080] [2024-11-08 16:35:43,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:43,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:35:43,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:43,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:35:43,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:35:43,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 189 [2024-11-08 16:35:43,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 210 transitions, 634 flow. Second operand has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:43,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:43,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 189 [2024-11-08 16:35:43,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:43,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][193], [Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), 217#true, 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), 116#L1058-11true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), Black: 180#true, 175#true, Black: 185#true, 204#true]) [2024-11-08 16:35:43,774 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is not cut-off event [2024-11-08 16:35:43,774 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:43,774 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:43,775 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:43,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][176], [Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 187#(= |#race~datas~0| 0), 217#true, 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), Black: 180#true, 175#true, Black: 185#true, 204#true]) [2024-11-08 16:35:43,876 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-08 16:35:43,876 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:43,876 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:43,877 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-08 16:35:43,907 INFO L124 PetriNetUnfolderBase]: 269/1281 cut-off events. [2024-11-08 16:35:43,908 INFO L125 PetriNetUnfolderBase]: For 710/725 co-relation queries the response was YES. [2024-11-08 16:35:43,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 1281 events. 269/1281 cut-off events. For 710/725 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8068 event pairs, 28 based on Foata normal form. 15/1156 useless extension candidates. Maximal degree in co-relation 2061. Up to 192 conditions per place. [2024-11-08 16:35:43,917 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 41 selfloop transitions, 16 changer transitions 0/229 dead transitions. [2024-11-08 16:35:43,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 229 transitions, 800 flow [2024-11-08 16:35:43,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:35:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 16:35:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2024-11-08 16:35:43,919 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9298941798941799 [2024-11-08 16:35:43,919 INFO L175 Difference]: Start difference. First operand has 188 places, 210 transitions, 634 flow. Second operand 4 states and 703 transitions. [2024-11-08 16:35:43,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 229 transitions, 800 flow [2024-11-08 16:35:43,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 229 transitions, 800 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:35:43,926 INFO L231 Difference]: Finished difference. Result has 193 places, 214 transitions, 708 flow [2024-11-08 16:35:43,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=708, PETRI_PLACES=193, PETRI_TRANSITIONS=214} [2024-11-08 16:35:43,927 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 19 predicate places. [2024-11-08 16:35:43,927 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 214 transitions, 708 flow [2024-11-08 16:35:43,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:43,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:43,928 INFO L204 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, 1, 1, 1, 1] [2024-11-08 16:35:43,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:35:43,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:43,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash 849826457, now seen corresponding path program 1 times [2024-11-08 16:35:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:43,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695171473] [2024-11-08 16:35:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:44,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695171473] [2024-11-08 16:35:44,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695171473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:44,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:44,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:35:44,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252075210] [2024-11-08 16:35:44,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:44,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:35:44,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:44,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:35:44,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:35:44,091 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2024-11-08 16:35:44,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 214 transitions, 708 flow. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:44,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:44,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2024-11-08 16:35:44,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:44,193 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][195], [Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 217#true, 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), 116#L1058-11true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), 175#true, Black: 180#true, Black: 185#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), 223#true, Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:44,194 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is not cut-off event [2024-11-08 16:35:44,194 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:44,194 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:44,194 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:44,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][222], [Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 217#true, 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), 175#true, Black: 180#true, Black: 185#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), 223#true, 204#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-11-08 16:35:44,296 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,296 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,296 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,296 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:44,297 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][178], [Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 217#true, 150#L1048-16true, Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), 175#true, Black: 180#true, Black: 185#true, 223#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:44,297 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,297 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:44,297 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:44,297 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-08 16:35:44,378 INFO L124 PetriNetUnfolderBase]: 315/1443 cut-off events. [2024-11-08 16:35:44,378 INFO L125 PetriNetUnfolderBase]: For 1418/1440 co-relation queries the response was YES. [2024-11-08 16:35:44,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 1443 events. 315/1443 cut-off events. For 1418/1440 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9319 event pairs, 34 based on Foata normal form. 15/1295 useless extension candidates. Maximal degree in co-relation 2683. Up to 192 conditions per place. [2024-11-08 16:35:44,388 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 39 selfloop transitions, 20 changer transitions 0/234 dead transitions. [2024-11-08 16:35:44,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 234 transitions, 924 flow [2024-11-08 16:35:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:35:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 16:35:44,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 705 transitions. [2024-11-08 16:35:44,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9325396825396826 [2024-11-08 16:35:44,390 INFO L175 Difference]: Start difference. First operand has 193 places, 214 transitions, 708 flow. Second operand 4 states and 705 transitions. [2024-11-08 16:35:44,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 234 transitions, 924 flow [2024-11-08 16:35:44,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 234 transitions, 905 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 16:35:44,398 INFO L231 Difference]: Finished difference. Result has 197 places, 220 transitions, 820 flow [2024-11-08 16:35:44,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=820, PETRI_PLACES=197, PETRI_TRANSITIONS=220} [2024-11-08 16:35:44,399 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 23 predicate places. [2024-11-08 16:35:44,399 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 220 transitions, 820 flow [2024-11-08 16:35:44,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:44,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:44,400 INFO L204 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, 1, 1, 1, 1] [2024-11-08 16:35:44,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:35:44,400 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:44,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash 849826457, now seen corresponding path program 1 times [2024-11-08 16:35:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424499126] [2024-11-08 16:35:44,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424499126] [2024-11-08 16:35:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424499126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:44,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:44,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:35:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916911016] [2024-11-08 16:35:44,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:44,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:35:44,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:44,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:35:44,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:35:44,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 189 [2024-11-08 16:35:44,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 220 transitions, 820 flow. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:44,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:44,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 189 [2024-11-08 16:35:44,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:44,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][194], [Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), 229#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 150#L1048-16true, Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 116#L1058-11true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), Black: 180#true, 175#true, Black: 185#true, 223#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:44,661 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is not cut-off event [2024-11-08 16:35:44,661 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is not cut-off event [2024-11-08 16:35:44,661 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:44,661 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is not cut-off event [2024-11-08 16:35:44,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][197], [Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#true, 70#L1059-10true, 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 180#true, Black: 213#(not (= ~threads_mask~0 1)), 175#true, Black: 185#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), 223#true, Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:44,740 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-11-08 16:35:44,741 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-11-08 16:35:44,741 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-11-08 16:35:44,741 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2024-11-08 16:35:44,747 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][175], [Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#true, 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 150#L1048-16true, Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), Black: 180#true, 175#true, Black: 185#true, 223#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:44,748 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-08 16:35:44,748 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,748 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:44,748 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][215], [Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#true, 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 150#L1048-16true, Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), Black: 180#true, 175#true, Black: 185#true, 223#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), 204#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-11-08 16:35:44,754 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-08 16:35:44,754 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,754 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,754 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:44,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][197], [Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#true, 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 36#L1059-15true, 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 180#true, Black: 213#(not (= ~threads_mask~0 1)), 175#true, Black: 185#true, 223#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:44,758 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-08 16:35:44,758 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:44,759 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-08 16:35:44,759 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-11-08 16:35:44,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][172], [Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#true, 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 180#true, Black: 213#(not (= ~threads_mask~0 1)), 175#true, 98#L1059-16true, Black: 185#true, 223#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:44,763 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is not cut-off event [2024-11-08 16:35:44,763 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-11-08 16:35:44,763 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is not cut-off event [2024-11-08 16:35:44,764 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2024-11-08 16:35:44,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][172], [Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#true, 164#L1059-20true, 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 182#(= |#race~threads_mask~0| 0), Black: 213#(not (= ~threads_mask~0 1)), 175#true, Black: 185#true, 223#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), 204#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-11-08 16:35:44,792 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-11-08 16:35:44,792 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-11-08 16:35:44,793 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-11-08 16:35:44,793 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-11-08 16:35:44,832 INFO L124 PetriNetUnfolderBase]: 333/1405 cut-off events. [2024-11-08 16:35:44,832 INFO L125 PetriNetUnfolderBase]: For 2355/2459 co-relation queries the response was YES. [2024-11-08 16:35:44,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3195 conditions, 1405 events. 333/1405 cut-off events. For 2355/2459 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8864 event pairs, 34 based on Foata normal form. 29/1271 useless extension candidates. Maximal degree in co-relation 2922. Up to 204 conditions per place. [2024-11-08 16:35:44,844 INFO L140 encePairwiseOnDemand]: 179/189 looper letters, 39 selfloop transitions, 24 changer transitions 0/238 dead transitions. [2024-11-08 16:35:44,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 238 transitions, 1038 flow [2024-11-08 16:35:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:35:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-08 16:35:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 705 transitions. [2024-11-08 16:35:44,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9325396825396826 [2024-11-08 16:35:44,846 INFO L175 Difference]: Start difference. First operand has 197 places, 220 transitions, 820 flow. Second operand 4 states and 705 transitions. [2024-11-08 16:35:44,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 238 transitions, 1038 flow [2024-11-08 16:35:44,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 238 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 16:35:44,856 INFO L231 Difference]: Finished difference. Result has 201 places, 225 transitions, 934 flow [2024-11-08 16:35:44,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=934, PETRI_PLACES=201, PETRI_TRANSITIONS=225} [2024-11-08 16:35:44,857 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 27 predicate places. [2024-11-08 16:35:44,858 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 225 transitions, 934 flow [2024-11-08 16:35:44,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:44,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:44,859 INFO L204 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, 1, 1, 1, 1, 1] [2024-11-08 16:35:44,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 16:35:44,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:44,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:44,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1451442878, now seen corresponding path program 1 times [2024-11-08 16:35:44,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:44,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197751337] [2024-11-08 16:35:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:44,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197751337] [2024-11-08 16:35:44,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197751337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:44,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:44,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:44,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472119390] [2024-11-08 16:35:44,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:44,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:44,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:44,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:44,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:44,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 189 [2024-11-08 16:35:44,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 225 transitions, 934 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:44,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:44,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 189 [2024-11-08 16:35:44,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:45,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][171], [235#true, Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#true, Black: 231#(not (= ~threads_mask~0 0)), Black: 232#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 150#L1048-16true, Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), Black: 180#true, 175#true, Black: 185#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:45,153 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-08 16:35:45,153 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:45,153 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:45,153 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:45,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][209], [235#true, Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 229#true, Black: 231#(not (= ~threads_mask~0 0)), Black: 232#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), 150#L1048-16true, 211#true, Black: 206#(not (= ~threads_mask~0 0)), Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 180#true, Black: 213#(not (= ~threads_mask~0 1)), 175#true, Black: 185#true, Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 204#true]) [2024-11-08 16:35:45,162 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-08 16:35:45,162 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:45,162 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:45,163 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:45,251 INFO L124 PetriNetUnfolderBase]: 330/1553 cut-off events. [2024-11-08 16:35:45,251 INFO L125 PetriNetUnfolderBase]: For 2086/2116 co-relation queries the response was YES. [2024-11-08 16:35:45,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1553 events. 330/1553 cut-off events. For 2086/2116 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 10864 event pairs, 35 based on Foata normal form. 5/1365 useless extension candidates. Maximal degree in co-relation 2950. Up to 261 conditions per place. [2024-11-08 16:35:45,263 INFO L140 encePairwiseOnDemand]: 183/189 looper letters, 27 selfloop transitions, 7 changer transitions 0/232 dead transitions. [2024-11-08 16:35:45,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 232 transitions, 1022 flow [2024-11-08 16:35:45,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:35:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2024-11-08 16:35:45,265 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9312169312169312 [2024-11-08 16:35:45,265 INFO L175 Difference]: Start difference. First operand has 201 places, 225 transitions, 934 flow. Second operand 3 states and 528 transitions. [2024-11-08 16:35:45,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 232 transitions, 1022 flow [2024-11-08 16:35:45,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 232 transitions, 999 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 16:35:45,276 INFO L231 Difference]: Finished difference. Result has 204 places, 230 transitions, 967 flow [2024-11-08 16:35:45,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=967, PETRI_PLACES=204, PETRI_TRANSITIONS=230} [2024-11-08 16:35:45,277 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 30 predicate places. [2024-11-08 16:35:45,277 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 230 transitions, 967 flow [2024-11-08 16:35:45,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:45,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:45,278 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:45,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:35:45,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:45,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash -988634879, now seen corresponding path program 1 times [2024-11-08 16:35:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744535593] [2024-11-08 16:35:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744535593] [2024-11-08 16:35:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744535593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:45,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:45,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:35:45,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789912446] [2024-11-08 16:35:45,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:45,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:35:45,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:45,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:35:45,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:35:45,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 189 [2024-11-08 16:35:45,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 230 transitions, 967 flow. Second operand has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:45,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:45,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 189 [2024-11-08 16:35:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:46,439 INFO L124 PetriNetUnfolderBase]: 477/2144 cut-off events. [2024-11-08 16:35:46,440 INFO L125 PetriNetUnfolderBase]: For 2239/2267 co-relation queries the response was YES. [2024-11-08 16:35:46,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4203 conditions, 2144 events. 477/2144 cut-off events. For 2239/2267 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 15687 event pairs, 80 based on Foata normal form. 5/1868 useless extension candidates. Maximal degree in co-relation 3927. Up to 377 conditions per place. [2024-11-08 16:35:46,454 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 40 selfloop transitions, 22 changer transitions 0/259 dead transitions. [2024-11-08 16:35:46,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 259 transitions, 1149 flow [2024-11-08 16:35:46,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:35:46,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:35:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2024-11-08 16:35:46,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8791887125220459 [2024-11-08 16:35:46,456 INFO L175 Difference]: Start difference. First operand has 204 places, 230 transitions, 967 flow. Second operand 6 states and 997 transitions. [2024-11-08 16:35:46,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 259 transitions, 1149 flow [2024-11-08 16:35:46,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 259 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:35:46,469 INFO L231 Difference]: Finished difference. Result has 212 places, 251 transitions, 1103 flow [2024-11-08 16:35:46,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1103, PETRI_PLACES=212, PETRI_TRANSITIONS=251} [2024-11-08 16:35:46,471 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 38 predicate places. [2024-11-08 16:35:46,471 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 251 transitions, 1103 flow [2024-11-08 16:35:46,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.83333333333334) internal successors, (947), 6 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:46,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:46,472 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:46,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:35:46,472 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:46,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1911280894, now seen corresponding path program 1 times [2024-11-08 16:35:46,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:46,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421407698] [2024-11-08 16:35:46,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:46,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:47,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:47,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421407698] [2024-11-08 16:35:47,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421407698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:47,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:47,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:35:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706319319] [2024-11-08 16:35:47,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:47,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:35:47,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:47,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:35:47,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:35:47,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2024-11-08 16:35:47,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 251 transitions, 1103 flow. Second operand has 6 states, 6 states have (on average 161.66666666666666) internal successors, (970), 6 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:47,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:47,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2024-11-08 16:35:47,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:47,797 INFO L124 PetriNetUnfolderBase]: 578/2260 cut-off events. [2024-11-08 16:35:47,797 INFO L125 PetriNetUnfolderBase]: For 2342/2439 co-relation queries the response was YES. [2024-11-08 16:35:47,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 2260 events. 578/2260 cut-off events. For 2342/2439 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 17112 event pairs, 78 based on Foata normal form. 9/2010 useless extension candidates. Maximal degree in co-relation 4531. Up to 502 conditions per place. [2024-11-08 16:35:47,817 INFO L140 encePairwiseOnDemand]: 174/189 looper letters, 68 selfloop transitions, 48 changer transitions 0/318 dead transitions. [2024-11-08 16:35:47,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 318 transitions, 1579 flow [2024-11-08 16:35:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:35:47,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:35:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1040 transitions. [2024-11-08 16:35:47,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9171075837742504 [2024-11-08 16:35:47,821 INFO L175 Difference]: Start difference. First operand has 212 places, 251 transitions, 1103 flow. Second operand 6 states and 1040 transitions. [2024-11-08 16:35:47,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 318 transitions, 1579 flow [2024-11-08 16:35:47,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 318 transitions, 1579 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:35:47,842 INFO L231 Difference]: Finished difference. Result has 222 places, 294 transitions, 1491 flow [2024-11-08 16:35:47,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1103, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1491, PETRI_PLACES=222, PETRI_TRANSITIONS=294} [2024-11-08 16:35:47,844 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 48 predicate places. [2024-11-08 16:35:47,844 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 294 transitions, 1491 flow [2024-11-08 16:35:47,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 161.66666666666666) internal successors, (970), 6 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:47,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:47,845 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:47,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:35:47,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:47,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1013480075, now seen corresponding path program 1 times [2024-11-08 16:35:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:47,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602702214] [2024-11-08 16:35:47,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:35:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602702214] [2024-11-08 16:35:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602702214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:35:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737245761] [2024-11-08 16:35:48,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:48,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:35:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:35:48,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:35:48,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 189 [2024-11-08 16:35:48,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 294 transitions, 1491 flow. Second operand has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:48,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:48,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 189 [2024-11-08 16:35:48,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:49,065 INFO L124 PetriNetUnfolderBase]: 580/2385 cut-off events. [2024-11-08 16:35:49,065 INFO L125 PetriNetUnfolderBase]: For 2907/3064 co-relation queries the response was YES. [2024-11-08 16:35:49,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5609 conditions, 2385 events. 580/2385 cut-off events. For 2907/3064 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 18514 event pairs, 89 based on Foata normal form. 14/2144 useless extension candidates. Maximal degree in co-relation 5316. Up to 566 conditions per place. [2024-11-08 16:35:49,086 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 92 selfloop transitions, 31 changer transitions 7/330 dead transitions. [2024-11-08 16:35:49,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 330 transitions, 1928 flow [2024-11-08 16:35:49,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:35:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:35:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1008 transitions. [2024-11-08 16:35:49,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-08 16:35:49,089 INFO L175 Difference]: Start difference. First operand has 222 places, 294 transitions, 1491 flow. Second operand 6 states and 1008 transitions. [2024-11-08 16:35:49,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 330 transitions, 1928 flow [2024-11-08 16:35:49,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 330 transitions, 1910 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-08 16:35:49,117 INFO L231 Difference]: Finished difference. Result has 232 places, 315 transitions, 1774 flow [2024-11-08 16:35:49,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1774, PETRI_PLACES=232, PETRI_TRANSITIONS=315} [2024-11-08 16:35:49,119 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 58 predicate places. [2024-11-08 16:35:49,120 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 315 transitions, 1774 flow [2024-11-08 16:35:49,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:49,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:49,122 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:49,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:35:49,122 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:49,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:49,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2081078602, now seen corresponding path program 1 times [2024-11-08 16:35:49,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:49,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454346684] [2024-11-08 16:35:49,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:49,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:49,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454346684] [2024-11-08 16:35:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454346684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:49,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:49,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798234851] [2024-11-08 16:35:49,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:49,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:49,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:49,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:49,210 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 189 [2024-11-08 16:35:49,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 315 transitions, 1774 flow. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:49,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:49,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 189 [2024-11-08 16:35:49,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:49,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][178], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 204#true, Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 231#(not (= ~threads_mask~0 0)), Black: 232#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 150#L1048-16true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), 175#true, Black: 180#true, Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 185#true]) [2024-11-08 16:35:49,485 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-11-08 16:35:49,485 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:49,485 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-08 16:35:49,485 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:49,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([493] L1048-15-->L1048-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise6_3| v_~threads_mask~0_24) InVars {threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} OutVars{~threads_mask~0=v_~threads_mask~0_24, threadThread1of1ForFork0_#t~bitwise6=|v_threadThread1of1ForFork0_#t~bitwise6_3|} AuxVars[] AssignedVars[~threads_mask~0][271], [Black: 253#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|), Black: 255#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 240#true, Black: 254#(and (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), Black: 256#(and (= (select (select |#race| ~datas~0.base) (+ 2 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4) 1))) (= |threadThread1of1ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4)))) (= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset (* threadThread1of1ForFork0_~j~0 4))) |threadThread1of1ForFork0_#t~nondet4|)), 262#true, 251#true, Black: 191#(= |ULTIMATE.start_main_~i~0#1| 0), 187#(= |#race~datas~0| 0), Black: 202#(<= (+ ~threads_mask~0 1) 0), Black: 265#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 273#true, Black: 266#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 264#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), Black: 206#(not (= ~threads_mask~0 0)), 211#true, Black: 207#(and (<= 1 |ULTIMATE.start_main_#t~bitwise13#1|) (not (= ~threads_mask~0 0))), 49#L1058-36true, Black: 214#(and (= |ULTIMATE.start_main_#t~bitwise13#1| 1) (not (= ~threads_mask~0 1))), Black: 213#(not (= ~threads_mask~0 1)), Black: 220#(and (<= (+ |ULTIMATE.start_main_#t~bitwise15#1| 1) 0) (not (= ~threads_mask~0 0))), 204#true, Black: 219#(not (= ~threads_mask~0 0)), Black: 225#(not (= ~threads_mask~0 0)), Black: 226#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise17#1| 1)), Black: 231#(not (= ~threads_mask~0 0)), Black: 232#(and (not (= ~threads_mask~0 0)) (<= 2 |ULTIMATE.start_main_#t~bitwise17#1|)), 150#L1048-16true, Black: 237#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 243#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|)), Black: 242#(= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))), 175#true, Black: 180#true, Black: 244#(and (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 245#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet21#1|) (= |ULTIMATE.start_main_#t~nondet21#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4))))), Black: 185#true]) [2024-11-08 16:35:49,502 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-11-08 16:35:49,503 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:49,503 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:49,503 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-08 16:35:49,734 INFO L124 PetriNetUnfolderBase]: 678/2689 cut-off events. [2024-11-08 16:35:49,734 INFO L125 PetriNetUnfolderBase]: For 3346/3445 co-relation queries the response was YES. [2024-11-08 16:35:49,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6325 conditions, 2689 events. 678/2689 cut-off events. For 3346/3445 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 21604 event pairs, 67 based on Foata normal form. 16/2439 useless extension candidates. Maximal degree in co-relation 6031. Up to 451 conditions per place. [2024-11-08 16:35:49,758 INFO L140 encePairwiseOnDemand]: 182/189 looper letters, 30 selfloop transitions, 11 changer transitions 3/329 dead transitions. [2024-11-08 16:35:49,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 329 transitions, 1910 flow [2024-11-08 16:35:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:35:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2024-11-08 16:35:49,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435626102292769 [2024-11-08 16:35:49,761 INFO L175 Difference]: Start difference. First operand has 232 places, 315 transitions, 1774 flow. Second operand 3 states and 535 transitions. [2024-11-08 16:35:49,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 329 transitions, 1910 flow [2024-11-08 16:35:49,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 329 transitions, 1854 flow, removed 28 selfloop flow, removed 0 redundant places. [2024-11-08 16:35:49,787 INFO L231 Difference]: Finished difference. Result has 232 places, 319 transitions, 1776 flow [2024-11-08 16:35:49,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1718, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1776, PETRI_PLACES=232, PETRI_TRANSITIONS=319} [2024-11-08 16:35:49,788 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 58 predicate places. [2024-11-08 16:35:49,788 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 319 transitions, 1776 flow [2024-11-08 16:35:49,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:49,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:49,789 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:49,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 16:35:49,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:49,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:49,790 INFO L85 PathProgramCache]: Analyzing trace with hash 612394164, now seen corresponding path program 1 times [2024-11-08 16:35:49,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880037731] [2024-11-08 16:35:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880037731] [2024-11-08 16:35:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880037731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:50,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:35:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524363855] [2024-11-08 16:35:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:35:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:50,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:35:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:35:51,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 189 [2024-11-08 16:35:51,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 319 transitions, 1776 flow. Second operand has 12 states, 12 states have (on average 149.16666666666666) internal successors, (1790), 12 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:51,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:51,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 189 [2024-11-08 16:35:51,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:52,382 INFO L124 PetriNetUnfolderBase]: 749/2998 cut-off events. [2024-11-08 16:35:52,382 INFO L125 PetriNetUnfolderBase]: For 4566/4846 co-relation queries the response was YES. [2024-11-08 16:35:52,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 2998 events. 749/2998 cut-off events. For 4566/4846 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 24734 event pairs, 93 based on Foata normal form. 89/2836 useless extension candidates. Maximal degree in co-relation 7435. Up to 485 conditions per place. [2024-11-08 16:35:52,414 INFO L140 encePairwiseOnDemand]: 174/189 looper letters, 177 selfloop transitions, 67 changer transitions 4/437 dead transitions. [2024-11-08 16:35:52,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 437 transitions, 2920 flow [2024-11-08 16:35:52,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 16:35:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-08 16:35:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2782 transitions. [2024-11-08 16:35:52,421 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8177542621987066 [2024-11-08 16:35:52,422 INFO L175 Difference]: Start difference. First operand has 232 places, 319 transitions, 1776 flow. Second operand 18 states and 2782 transitions. [2024-11-08 16:35:52,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 437 transitions, 2920 flow [2024-11-08 16:35:52,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 437 transitions, 2898 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:35:52,461 INFO L231 Difference]: Finished difference. Result has 247 places, 337 transitions, 2013 flow [2024-11-08 16:35:52,461 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2013, PETRI_PLACES=247, PETRI_TRANSITIONS=337} [2024-11-08 16:35:52,462 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 73 predicate places. [2024-11-08 16:35:52,462 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 337 transitions, 2013 flow [2024-11-08 16:35:52,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 149.16666666666666) internal successors, (1790), 12 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:52,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:52,464 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:52,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:35:52,464 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:52,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash -945294443, now seen corresponding path program 1 times [2024-11-08 16:35:52,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291230271] [2024-11-08 16:35:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:52,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:35:53,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:53,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291230271] [2024-11-08 16:35:53,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291230271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:53,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:53,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:35:53,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243845434] [2024-11-08 16:35:53,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:53,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:35:53,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:53,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:35:53,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:35:53,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 189 [2024-11-08 16:35:53,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 337 transitions, 2013 flow. Second operand has 12 states, 12 states have (on average 149.08333333333334) internal successors, (1789), 12 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:53,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:53,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 189 [2024-11-08 16:35:53,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:54,684 INFO L124 PetriNetUnfolderBase]: 663/2787 cut-off events. [2024-11-08 16:35:54,685 INFO L125 PetriNetUnfolderBase]: For 4478/4640 co-relation queries the response was YES. [2024-11-08 16:35:54,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7338 conditions, 2787 events. 663/2787 cut-off events. For 4478/4640 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 22676 event pairs, 89 based on Foata normal form. 26/2575 useless extension candidates. Maximal degree in co-relation 7015. Up to 543 conditions per place. [2024-11-08 16:35:54,708 INFO L140 encePairwiseOnDemand]: 176/189 looper letters, 73 selfloop transitions, 6 changer transitions 114/371 dead transitions. [2024-11-08 16:35:54,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 371 transitions, 2643 flow [2024-11-08 16:35:54,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:35:54,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-08 16:35:54,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1985 transitions. [2024-11-08 16:35:54,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.807895807895808 [2024-11-08 16:35:54,713 INFO L175 Difference]: Start difference. First operand has 247 places, 337 transitions, 2013 flow. Second operand 13 states and 1985 transitions. [2024-11-08 16:35:54,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 371 transitions, 2643 flow [2024-11-08 16:35:54,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 371 transitions, 2487 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-11-08 16:35:54,748 INFO L231 Difference]: Finished difference. Result has 250 places, 257 transitions, 1414 flow [2024-11-08 16:35:54,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1414, PETRI_PLACES=250, PETRI_TRANSITIONS=257} [2024-11-08 16:35:54,749 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 76 predicate places. [2024-11-08 16:35:54,749 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 257 transitions, 1414 flow [2024-11-08 16:35:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 149.08333333333334) internal successors, (1789), 12 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:54,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:54,750 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:54,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 16:35:54,751 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:54,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash -162747126, now seen corresponding path program 1 times [2024-11-08 16:35:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615445946] [2024-11-08 16:35:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615445946] [2024-11-08 16:35:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615445946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:54,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:35:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050934080] [2024-11-08 16:35:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:54,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:55,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:55,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:35:55,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 189 [2024-11-08 16:35:55,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 257 transitions, 1414 flow. Second operand has 7 states, 7 states have (on average 162.71428571428572) internal successors, (1139), 7 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:55,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:55,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 189 [2024-11-08 16:35:55,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:56,232 INFO L124 PetriNetUnfolderBase]: 1310/4468 cut-off events. [2024-11-08 16:35:56,232 INFO L125 PetriNetUnfolderBase]: For 8382/8531 co-relation queries the response was YES. [2024-11-08 16:35:56,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11564 conditions, 4468 events. 1310/4468 cut-off events. For 8382/8531 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 37381 event pairs, 213 based on Foata normal form. 96/4266 useless extension candidates. Maximal degree in co-relation 11526. Up to 1093 conditions per place. [2024-11-08 16:35:56,267 INFO L140 encePairwiseOnDemand]: 176/189 looper letters, 96 selfloop transitions, 52 changer transitions 0/359 dead transitions. [2024-11-08 16:35:56,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 359 transitions, 2314 flow [2024-11-08 16:35:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:35:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 16:35:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2373 transitions. [2024-11-08 16:35:56,275 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8968253968253969 [2024-11-08 16:35:56,276 INFO L175 Difference]: Start difference. First operand has 250 places, 257 transitions, 1414 flow. Second operand 14 states and 2373 transitions. [2024-11-08 16:35:56,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 359 transitions, 2314 flow [2024-11-08 16:35:56,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 359 transitions, 2267 flow, removed 8 selfloop flow, removed 13 redundant places. [2024-11-08 16:35:56,307 INFO L231 Difference]: Finished difference. Result has 226 places, 308 transitions, 2028 flow [2024-11-08 16:35:56,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=1367, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2028, PETRI_PLACES=226, PETRI_TRANSITIONS=308} [2024-11-08 16:35:56,308 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 52 predicate places. [2024-11-08 16:35:56,309 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 308 transitions, 2028 flow [2024-11-08 16:35:56,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 162.71428571428572) internal successors, (1139), 7 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:56,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:56,310 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:56,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:35:56,310 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:56,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:56,310 INFO L85 PathProgramCache]: Analyzing trace with hash -811559842, now seen corresponding path program 1 times [2024-11-08 16:35:56,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:56,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032455185] [2024-11-08 16:35:56,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:56,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:56,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:56,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032455185] [2024-11-08 16:35:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032455185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:56,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:56,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:35:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838857879] [2024-11-08 16:35:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:56,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:56,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:56,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:35:56,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 189 [2024-11-08 16:35:56,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 308 transitions, 2028 flow. Second operand has 7 states, 7 states have (on average 163.71428571428572) internal successors, (1146), 7 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:56,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:56,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 189 [2024-11-08 16:35:56,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:57,759 INFO L124 PetriNetUnfolderBase]: 1204/4263 cut-off events. [2024-11-08 16:35:57,760 INFO L125 PetriNetUnfolderBase]: For 11490/11664 co-relation queries the response was YES. [2024-11-08 16:35:57,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12436 conditions, 4263 events. 1204/4263 cut-off events. For 11490/11664 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 35610 event pairs, 188 based on Foata normal form. 64/4042 useless extension candidates. Maximal degree in co-relation 12392. Up to 995 conditions per place. [2024-11-08 16:35:57,791 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 88 selfloop transitions, 64 changer transitions 0/364 dead transitions. [2024-11-08 16:35:57,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 364 transitions, 2687 flow [2024-11-08 16:35:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:35:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 16:35:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2375 transitions. [2024-11-08 16:35:57,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8975812547241119 [2024-11-08 16:35:57,795 INFO L175 Difference]: Start difference. First operand has 226 places, 308 transitions, 2028 flow. Second operand 14 states and 2375 transitions. [2024-11-08 16:35:57,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 364 transitions, 2687 flow [2024-11-08 16:35:57,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 364 transitions, 2673 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-08 16:35:57,851 INFO L231 Difference]: Finished difference. Result has 243 places, 324 transitions, 2337 flow [2024-11-08 16:35:57,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2016, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2337, PETRI_PLACES=243, PETRI_TRANSITIONS=324} [2024-11-08 16:35:57,852 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 69 predicate places. [2024-11-08 16:35:57,852 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 324 transitions, 2337 flow [2024-11-08 16:35:57,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 163.71428571428572) internal successors, (1146), 7 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:57,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:57,853 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:57,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 16:35:57,854 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:57,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:57,854 INFO L85 PathProgramCache]: Analyzing trace with hash 853093438, now seen corresponding path program 1 times [2024-11-08 16:35:57,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:57,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678330752] [2024-11-08 16:35:57,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:57,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:58,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:58,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678330752] [2024-11-08 16:35:58,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678330752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:58,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:58,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:35:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946406040] [2024-11-08 16:35:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:58,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:35:58,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 189 [2024-11-08 16:35:58,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 324 transitions, 2337 flow. Second operand has 7 states, 7 states have (on average 162.71428571428572) internal successors, (1139), 7 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:58,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:35:58,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 189 [2024-11-08 16:35:58,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:35:59,399 INFO L124 PetriNetUnfolderBase]: 1444/5176 cut-off events. [2024-11-08 16:35:59,399 INFO L125 PetriNetUnfolderBase]: For 18628/18882 co-relation queries the response was YES. [2024-11-08 16:35:59,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16026 conditions, 5176 events. 1444/5176 cut-off events. For 18628/18882 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 46221 event pairs, 187 based on Foata normal form. 87/4933 useless extension candidates. Maximal degree in co-relation 15977. Up to 1318 conditions per place. [2024-11-08 16:35:59,441 INFO L140 encePairwiseOnDemand]: 176/189 looper letters, 144 selfloop transitions, 56 changer transitions 0/411 dead transitions. [2024-11-08 16:35:59,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 411 transitions, 3461 flow [2024-11-08 16:35:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:35:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 16:35:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2368 transitions. [2024-11-08 16:35:59,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8949357520786092 [2024-11-08 16:35:59,446 INFO L175 Difference]: Start difference. First operand has 243 places, 324 transitions, 2337 flow. Second operand 14 states and 2368 transitions. [2024-11-08 16:35:59,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 411 transitions, 3461 flow [2024-11-08 16:35:59,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 411 transitions, 3416 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-11-08 16:35:59,535 INFO L231 Difference]: Finished difference. Result has 262 places, 365 transitions, 2939 flow [2024-11-08 16:35:59,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2939, PETRI_PLACES=262, PETRI_TRANSITIONS=365} [2024-11-08 16:35:59,536 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 88 predicate places. [2024-11-08 16:35:59,536 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 365 transitions, 2939 flow [2024-11-08 16:35:59,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 162.71428571428572) internal successors, (1139), 7 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:59,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:35:59,537 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:35:59,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 16:35:59,537 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:35:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash -59134592, now seen corresponding path program 1 times [2024-11-08 16:35:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570294678] [2024-11-08 16:35:59,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:59,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:59,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:59,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:59,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570294678] [2024-11-08 16:35:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570294678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 16:35:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658878805] [2024-11-08 16:35:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:59,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:59,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:36:00,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 189 [2024-11-08 16:36:00,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 365 transitions, 2939 flow. Second operand has 7 states, 7 states have (on average 163.71428571428572) internal successors, (1146), 7 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:00,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:00,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 189 [2024-11-08 16:36:00,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:01,333 INFO L124 PetriNetUnfolderBase]: 1339/4988 cut-off events. [2024-11-08 16:36:01,333 INFO L125 PetriNetUnfolderBase]: For 23595/23872 co-relation queries the response was YES. [2024-11-08 16:36:01,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16529 conditions, 4988 events. 1339/4988 cut-off events. For 23595/23872 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 44865 event pairs, 168 based on Foata normal form. 61/4734 useless extension candidates. Maximal degree in co-relation 16469. Up to 1199 conditions per place. [2024-11-08 16:36:01,383 INFO L140 encePairwiseOnDemand]: 178/189 looper letters, 136 selfloop transitions, 68 changer transitions 0/416 dead transitions. [2024-11-08 16:36:01,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 416 transitions, 3811 flow [2024-11-08 16:36:01,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:36:01,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 16:36:01,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2370 transitions. [2024-11-08 16:36:01,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8956916099773242 [2024-11-08 16:36:01,387 INFO L175 Difference]: Start difference. First operand has 262 places, 365 transitions, 2939 flow. Second operand 14 states and 2370 transitions. [2024-11-08 16:36:01,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 416 transitions, 3811 flow [2024-11-08 16:36:01,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 416 transitions, 3718 flow, removed 44 selfloop flow, removed 1 redundant places. [2024-11-08 16:36:01,540 INFO L231 Difference]: Finished difference. Result has 278 places, 381 transitions, 3219 flow [2024-11-08 16:36:01,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=2858, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3219, PETRI_PLACES=278, PETRI_TRANSITIONS=381} [2024-11-08 16:36:01,541 INFO L277 CegarLoopForPetriNet]: 174 programPoint places, 104 predicate places. [2024-11-08 16:36:01,541 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 381 transitions, 3219 flow [2024-11-08 16:36:01,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 163.71428571428572) internal successors, (1146), 7 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:01,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:01,543 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:36:01,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 16:36:01,544 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:01,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash 196332088, now seen corresponding path program 1 times [2024-11-08 16:36:01,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:01,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869078257] [2024-11-08 16:36:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:01,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:36:01,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:36:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:36:01,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:36:01,647 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:36:01,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-11-08 16:36:01,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-08 16:36:01,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-08 16:36:01,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-08 16:36:01,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-08 16:36:01,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-08 16:36:01,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-08 16:36:01,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-11-08 16:36:01,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-08 16:36:01,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-08 16:36:01,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-08 16:36:01,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-08 16:36:01,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-08 16:36:01,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-08 16:36:01,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-08 16:36:01,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-08 16:36:01,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 16:36:01,656 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:01,748 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 16:36:01,748 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:36:01,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:36:01 BasicIcfg [2024-11-08 16:36:01,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:36:01,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:36:01,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:36:01,755 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:36:01,755 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:35:39" (3/4) ... [2024-11-08 16:36:01,757 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:36:01,758 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:36:01,760 INFO L158 Benchmark]: Toolchain (without parser) took 23515.63ms. Allocated memory was 134.2MB in the beginning and 943.7MB in the end (delta: 809.5MB). Free memory was 94.5MB in the beginning and 349.1MB in the end (delta: -254.6MB). Peak memory consumption was 555.5MB. Max. memory is 16.1GB. [2024-11-08 16:36:01,760 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 134.2MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:36:01,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 768.53ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 94.5MB in the beginning and 160.2MB in the end (delta: -65.7MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-11-08 16:36:01,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.06ms. Allocated memory is still 192.9MB. Free memory was 160.2MB in the beginning and 158.6MB in the end (delta: 1.6MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-08 16:36:01,761 INFO L158 Benchmark]: Boogie Preprocessor took 36.31ms. Allocated memory is still 192.9MB. Free memory was 158.6MB in the beginning and 156.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:36:01,761 INFO L158 Benchmark]: RCFGBuilder took 791.79ms. Allocated memory is still 192.9MB. Free memory was 156.5MB in the beginning and 132.2MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 16:36:01,762 INFO L158 Benchmark]: TraceAbstraction took 21817.82ms. Allocated memory was 192.9MB in the beginning and 943.7MB in the end (delta: 750.8MB). Free memory was 131.3MB in the beginning and 349.1MB in the end (delta: -217.9MB). Peak memory consumption was 532.7MB. Max. memory is 16.1GB. [2024-11-08 16:36:01,763 INFO L158 Benchmark]: Witness Printer took 4.45ms. Allocated memory is still 943.7MB. Free memory is still 349.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:36:01,764 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 134.2MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 768.53ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 94.5MB in the beginning and 160.2MB in the end (delta: -65.7MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 87.06ms. Allocated memory is still 192.9MB. Free memory was 160.2MB in the beginning and 158.6MB in the end (delta: 1.6MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.31ms. Allocated memory is still 192.9MB. Free memory was 158.6MB in the beginning and 156.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 791.79ms. Allocated memory is still 192.9MB. Free memory was 156.5MB in the beginning and 132.2MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21817.82ms. Allocated memory was 192.9MB in the beginning and 943.7MB in the end (delta: 750.8MB). Free memory was 131.3MB in the beginning and 349.1MB in the end (delta: -217.9MB). Peak memory consumption was 532.7MB. Max. memory is 16.1GB. * Witness Printer took 4.45ms. Allocated memory is still 943.7MB. Free memory is still 349.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1058]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: overapproximation of shiftRight at line 1058, overapproximation of bitwiseOr at line 1048, overapproximation of bitwiseAnd at line 1059. Possible FailurePath: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=31] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=31, tids={-3:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={-4:0}, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] 0 int i = 0; VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] COND FALSE 0 !(i < threads_total) VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={-4:0}, i=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] EXPR 0 1 << j VAL [datas={-4:0}, i=0, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={-4:0}, i=0, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, i=1, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1057] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, i=1, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, i=1, j=0, threads_mask=-2, threads_total=31, tids={-3:0}] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] EXPR 1 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-2] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={-4:0}, i=1, j=0, threads_mask=-1, threads_total=31, tids={-3:0}] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: 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: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: 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, 211 locations, 16 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: 21.5s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2437 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1697 mSDsluCounter, 1517 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1245 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5147 IncrementalHoareTripleChecker+Invalid, 5336 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 272 mSDtfsCounter, 5147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3219occurred in iteration=21, InterpolantAutomatonStates: 149, 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.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 1768 NumberOfCodeBlocks, 1768 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1631 ConstructedInterpolants, 0 QuantifiedInterpolants, 5666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 19/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 16:36:01,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX --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 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:36:04,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:36:04,459 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf [2024-11-08 16:36:04,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:36:04,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:36:04,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:36:04,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:36:04,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:36:04,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:36:04,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:36:04,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:36:04,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:36:04,513 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:36:04,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:36:04,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:36:04,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:36:04,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:36:04,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:36:04,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:36:04,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:36:04,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:36:04,520 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-08 16:36:04,520 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:36:04,521 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:36:04,521 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:36:04,521 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 16:36:04,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:36:04,522 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:36:04,522 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:36:04,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:36:04,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:36:04,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:36:04,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:36:04,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:36:04,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:36:04,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:36:04,525 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:36:04,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:36:04,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:36:04,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:36:04,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:36:04,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:36:04,528 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX 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 -> 9dc253a71095a3ed3b49fc56a3d17da307efb7fa91be8525b1f50977899b5b3d [2024-11-08 16:36:04,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:36:04,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:36:04,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:36:04,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:36:04,925 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:36:04,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i Unable to find full path for "g++" [2024-11-08 16:36:06,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:36:07,329 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:36:07,331 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race.i [2024-11-08 16:36:07,353 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/data/68e7aa03d/6aedb6729ab24bf29da7596726b9896a/FLAGe59677de7 [2024-11-08 16:36:07,375 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/data/68e7aa03d/6aedb6729ab24bf29da7596726b9896a [2024-11-08 16:36:07,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:36:07,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:36:07,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:36:07,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:36:07,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:36:07,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:36:07" (1/1) ... [2024-11-08 16:36:07,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a76287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:07, skipping insertion in model container [2024-11-08 16:36:07,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:36:07" (1/1) ... [2024-11-08 16:36:07,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:36:08,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:36:08,088 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:36:08,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:36:08,304 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:36:08,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08 WrapperNode [2024-11-08 16:36:08,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:36:08,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:36:08,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:36:08,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:36:08,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,344 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,384 INFO L138 Inliner]: procedures = 274, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2024-11-08 16:36:08,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:36:08,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:36:08,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:36:08,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:36:08,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:36:08,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:36:08,426 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:36:08,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:36:08,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (1/1) ... [2024-11-08 16:36:08,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:36:08,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:08,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:36:08,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:36:08,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-08 16:36:08,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:36:08,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-08 16:36:08,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 16:36:08,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-08 16:36:08,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-08 16:36:08,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:36:08,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:36:08,499 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 16:36:08,697 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:36:08,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:36:09,057 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 16:36:09,057 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:36:09,078 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:36:09,080 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:36:09,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:09 BoogieIcfgContainer [2024-11-08 16:36:09,081 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:36:09,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:36:09,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:36:09,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:36:09,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:36:07" (1/3) ... [2024-11-08 16:36:09,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcb1c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:36:09, skipping insertion in model container [2024-11-08 16:36:09,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:36:08" (2/3) ... [2024-11-08 16:36:09,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcb1c19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:36:09, skipping insertion in model container [2024-11-08 16:36:09,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:09" (3/3) ... [2024-11-08 16:36:09,110 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i [2024-11-08 16:36:09,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:36:09,131 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-08 16:36:09,131 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 16:36:09,280 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-08 16:36:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 136 transitions, 279 flow [2024-11-08 16:36:09,415 INFO L124 PetriNetUnfolderBase]: 9/193 cut-off events. [2024-11-08 16:36:09,415 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-08 16:36:09,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 193 events. 9/193 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 333 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2024-11-08 16:36:09,421 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 136 transitions, 279 flow [2024-11-08 16:36:09,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 136 transitions, 279 flow [2024-11-08 16:36:09,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:36:09,441 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@5c80ca29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:36:09,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-08 16:36:09,450 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:36:09,450 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-11-08 16:36:09,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-08 16:36:09,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:09,452 INFO L204 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] [2024-11-08 16:36:09,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:09,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:09,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2051160053, now seen corresponding path program 1 times [2024-11-08 16:36:09,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2077967712] [2024-11-08 16:36:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:09,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:09,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:09,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:36:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:09,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:36:09,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:09,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:09,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:09,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077967712] [2024-11-08 16:36:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077967712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:09,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:09,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:09,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976731983] [2024-11-08 16:36:09,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:09,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:09,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:09,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:09,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:09,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 136 [2024-11-08 16:36:09,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 136 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:09,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:09,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 136 [2024-11-08 16:36:09,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:09,848 INFO L124 PetriNetUnfolderBase]: 9/242 cut-off events. [2024-11-08 16:36:09,848 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 16:36:09,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 242 events. 9/242 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 549 event pairs, 2 based on Foata normal form. 2/206 useless extension candidates. Maximal degree in co-relation 150. Up to 15 conditions per place. [2024-11-08 16:36:09,851 INFO L140 encePairwiseOnDemand]: 131/136 looper letters, 8 selfloop transitions, 2 changer transitions 2/133 dead transitions. [2024-11-08 16:36:09,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 133 transitions, 293 flow [2024-11-08 16:36:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2024-11-08 16:36:09,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9362745098039216 [2024-11-08 16:36:09,871 INFO L175 Difference]: Start difference. First operand has 133 places, 136 transitions, 279 flow. Second operand 3 states and 382 transitions. [2024-11-08 16:36:09,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 133 transitions, 293 flow [2024-11-08 16:36:09,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 133 transitions, 293 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:36:09,882 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 273 flow [2024-11-08 16:36:09,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=273, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2024-11-08 16:36:09,890 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 1 predicate places. [2024-11-08 16:36:09,892 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 273 flow [2024-11-08 16:36:09,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:09,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:09,893 INFO L204 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] [2024-11-08 16:36:09,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:36:10,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:10,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:10,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:10,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1176786728, now seen corresponding path program 1 times [2024-11-08 16:36:10,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:10,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252705648] [2024-11-08 16:36:10,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:10,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:10,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:10,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:10,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:36:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:10,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:36:10,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:10,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:10,253 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:10,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252705648] [2024-11-08 16:36:10,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252705648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:10,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:10,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:10,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84423291] [2024-11-08 16:36:10,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:10,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:10,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:10,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:10,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 136 [2024-11-08 16:36:10,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 273 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:10,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:10,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 136 [2024-11-08 16:36:10,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:10,408 INFO L124 PetriNetUnfolderBase]: 24/305 cut-off events. [2024-11-08 16:36:10,408 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 16:36:10,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 305 events. 24/305 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1044 event pairs, 6 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 330. Up to 36 conditions per place. [2024-11-08 16:36:10,413 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 13 selfloop transitions, 8 changer transitions 0/139 dead transitions. [2024-11-08 16:36:10,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 331 flow [2024-11-08 16:36:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:10,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2024-11-08 16:36:10,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485294117647058 [2024-11-08 16:36:10,417 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 273 flow. Second operand 3 states and 387 transitions. [2024-11-08 16:36:10,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 331 flow [2024-11-08 16:36:10,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:36:10,435 INFO L231 Difference]: Finished difference. Result has 134 places, 139 transitions, 339 flow [2024-11-08 16:36:10,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=134, PETRI_TRANSITIONS=139} [2024-11-08 16:36:10,438 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 1 predicate places. [2024-11-08 16:36:10,438 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 139 transitions, 339 flow [2024-11-08 16:36:10,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:10,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:10,439 INFO L204 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] [2024-11-08 16:36:10,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:36:10,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:10,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:10,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash 648040808, now seen corresponding path program 1 times [2024-11-08 16:36:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:10,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1529854530] [2024-11-08 16:36:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:10,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:10,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:10,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:36:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:10,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:36:10,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:10,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:10,747 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:10,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529854530] [2024-11-08 16:36:10,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529854530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:10,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:10,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:10,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958183400] [2024-11-08 16:36:10,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:10,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:10,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:10,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:10,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:10,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 136 [2024-11-08 16:36:10,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 139 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:10,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:10,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 136 [2024-11-08 16:36:10,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:10,834 INFO L124 PetriNetUnfolderBase]: 29/375 cut-off events. [2024-11-08 16:36:10,834 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-08 16:36:10,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 375 events. 29/375 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1419 event pairs, 9 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 351. Up to 40 conditions per place. [2024-11-08 16:36:10,837 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 7 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2024-11-08 16:36:10,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 357 flow [2024-11-08 16:36:10,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:10,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2024-11-08 16:36:10,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2024-11-08 16:36:10,840 INFO L175 Difference]: Start difference. First operand has 134 places, 139 transitions, 339 flow. Second operand 3 states and 386 transitions. [2024-11-08 16:36:10,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 357 flow [2024-11-08 16:36:10,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:36:10,845 INFO L231 Difference]: Finished difference. Result has 133 places, 139 transitions, 333 flow [2024-11-08 16:36:10,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=133, PETRI_TRANSITIONS=139} [2024-11-08 16:36:10,846 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 0 predicate places. [2024-11-08 16:36:10,846 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 139 transitions, 333 flow [2024-11-08 16:36:10,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:10,847 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:10,847 INFO L204 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] [2024-11-08 16:36:10,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:36:11,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:11,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:11,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:11,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1580881334, now seen corresponding path program 1 times [2024-11-08 16:36:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [439460552] [2024-11-08 16:36:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:11,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:11,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:11,054 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:11,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:36:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:11,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 16:36:11,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:11,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:11,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439460552] [2024-11-08 16:36:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439460552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:11,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:11,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:36:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600290623] [2024-11-08 16:36:11,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:11,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:36:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:11,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:36:11,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:36:11,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 136 [2024-11-08 16:36:11,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 139 transitions, 333 flow. Second operand has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:11,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:11,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 136 [2024-11-08 16:36:11,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:12,078 INFO L124 PetriNetUnfolderBase]: 25/344 cut-off events. [2024-11-08 16:36:12,078 INFO L125 PetriNetUnfolderBase]: For 11/18 co-relation queries the response was YES. [2024-11-08 16:36:12,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 344 events. 25/344 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1209 event pairs, 7 based on Foata normal form. 2/316 useless extension candidates. Maximal degree in co-relation 303. Up to 38 conditions per place. [2024-11-08 16:36:12,081 INFO L140 encePairwiseOnDemand]: 122/136 looper letters, 19 selfloop transitions, 8 changer transitions 6/145 dead transitions. [2024-11-08 16:36:12,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 145 transitions, 411 flow [2024-11-08 16:36:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 16:36:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-08 16:36:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1211 transitions. [2024-11-08 16:36:12,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8094919786096256 [2024-11-08 16:36:12,088 INFO L175 Difference]: Start difference. First operand has 133 places, 139 transitions, 333 flow. Second operand 11 states and 1211 transitions. [2024-11-08 16:36:12,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 145 transitions, 411 flow [2024-11-08 16:36:12,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 145 transitions, 411 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:36:12,094 INFO L231 Difference]: Finished difference. Result has 147 places, 139 transitions, 363 flow [2024-11-08 16:36:12,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=363, PETRI_PLACES=147, PETRI_TRANSITIONS=139} [2024-11-08 16:36:12,095 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 14 predicate places. [2024-11-08 16:36:12,095 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 139 transitions, 363 flow [2024-11-08 16:36:12,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.5) internal successors, (876), 8 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:12,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:12,096 INFO L204 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] [2024-11-08 16:36:12,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 16:36:12,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:12,297 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:12,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash -988116819, now seen corresponding path program 1 times [2024-11-08 16:36:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:12,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1268009907] [2024-11-08 16:36:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:12,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:12,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:12,302 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:12,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:36:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:12,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:36:12,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:12,411 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:12,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268009907] [2024-11-08 16:36:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268009907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:12,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:12,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533921436] [2024-11-08 16:36:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:12,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:12,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:12,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:12,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 136 [2024-11-08 16:36:12,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 139 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:12,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:12,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 136 [2024-11-08 16:36:12,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:12,511 INFO L124 PetriNetUnfolderBase]: 37/361 cut-off events. [2024-11-08 16:36:12,511 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2024-11-08 16:36:12,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 361 events. 37/361 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1428 event pairs, 11 based on Foata normal form. 0/326 useless extension candidates. Maximal degree in co-relation 447. Up to 63 conditions per place. [2024-11-08 16:36:12,514 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 16 selfloop transitions, 7 changer transitions 0/144 dead transitions. [2024-11-08 16:36:12,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 144 transitions, 425 flow [2024-11-08 16:36:12,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2024-11-08 16:36:12,516 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338235294117647 [2024-11-08 16:36:12,516 INFO L175 Difference]: Start difference. First operand has 147 places, 139 transitions, 363 flow. Second operand 3 states and 381 transitions. [2024-11-08 16:36:12,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 144 transitions, 425 flow [2024-11-08 16:36:12,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 144 transitions, 401 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-11-08 16:36:12,521 INFO L231 Difference]: Finished difference. Result has 138 places, 144 transitions, 395 flow [2024-11-08 16:36:12,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=138, PETRI_TRANSITIONS=144} [2024-11-08 16:36:12,522 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 5 predicate places. [2024-11-08 16:36:12,523 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 144 transitions, 395 flow [2024-11-08 16:36:12,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:12,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:12,523 INFO L204 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] [2024-11-08 16:36:12,545 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 16:36:12,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:12,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:12,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:12,725 INFO L85 PathProgramCache]: Analyzing trace with hash 221935898, now seen corresponding path program 1 times [2024-11-08 16:36:12,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:12,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815521522] [2024-11-08 16:36:12,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:12,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:12,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:12,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:12,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 16:36:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:12,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:36:12,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:12,921 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:12,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:12,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815521522] [2024-11-08 16:36:12,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815521522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:12,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:12,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:36:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404208540] [2024-11-08 16:36:12,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:12,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:12,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:12,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:12,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 136 [2024-11-08 16:36:12,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 144 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:12,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:12,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 136 [2024-11-08 16:36:12,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:13,003 INFO L124 PetriNetUnfolderBase]: 32/344 cut-off events. [2024-11-08 16:36:13,004 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-08 16:36:13,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 344 events. 32/344 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1281 event pairs, 7 based on Foata normal form. 1/318 useless extension candidates. Maximal degree in co-relation 404. Up to 40 conditions per place. [2024-11-08 16:36:13,006 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 4 selfloop transitions, 2 changer transitions 0/145 dead transitions. [2024-11-08 16:36:13,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 409 flow [2024-11-08 16:36:13,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2024-11-08 16:36:13,008 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9656862745098039 [2024-11-08 16:36:13,009 INFO L175 Difference]: Start difference. First operand has 138 places, 144 transitions, 395 flow. Second operand 3 states and 394 transitions. [2024-11-08 16:36:13,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 409 flow [2024-11-08 16:36:13,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 145 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-08 16:36:13,013 INFO L231 Difference]: Finished difference. Result has 139 places, 145 transitions, 393 flow [2024-11-08 16:36:13,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=139, PETRI_TRANSITIONS=145} [2024-11-08 16:36:13,014 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 6 predicate places. [2024-11-08 16:36:13,015 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 145 transitions, 393 flow [2024-11-08 16:36:13,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:13,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:13,016 INFO L204 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-08 16:36:13,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 16:36:13,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:13,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:13,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash -796400810, now seen corresponding path program 1 times [2024-11-08 16:36:13,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:13,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774797609] [2024-11-08 16:36:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:13,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:13,225 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:13,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 16:36:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:13,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 16:36:13,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:13,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-08 16:36:13,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2024-11-08 16:36:13,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:13,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 38 [2024-11-08 16:36:13,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:13,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 52 [2024-11-08 16:36:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:13,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:13,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:13,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774797609] [2024-11-08 16:36:13,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774797609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:13,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:13,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:36:13,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943136395] [2024-11-08 16:36:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:13,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:36:13,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:13,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:36:13,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:36:14,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 136 [2024-11-08 16:36:14,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 145 transitions, 393 flow. Second operand has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:14,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:14,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 136 [2024-11-08 16:36:14,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:14,638 INFO L124 PetriNetUnfolderBase]: 93/570 cut-off events. [2024-11-08 16:36:14,639 INFO L125 PetriNetUnfolderBase]: For 44/47 co-relation queries the response was YES. [2024-11-08 16:36:14,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 570 events. 93/570 cut-off events. For 44/47 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3035 event pairs, 57 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 854. Up to 138 conditions per place. [2024-11-08 16:36:14,643 INFO L140 encePairwiseOnDemand]: 115/136 looper letters, 32 selfloop transitions, 20 changer transitions 0/161 dead transitions. [2024-11-08 16:36:14,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 161 transitions, 529 flow [2024-11-08 16:36:14,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:36:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-08 16:36:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1205 transitions. [2024-11-08 16:36:14,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7383578431372549 [2024-11-08 16:36:14,647 INFO L175 Difference]: Start difference. First operand has 139 places, 145 transitions, 393 flow. Second operand 12 states and 1205 transitions. [2024-11-08 16:36:14,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 161 transitions, 529 flow [2024-11-08 16:36:14,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 161 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 16:36:14,652 INFO L231 Difference]: Finished difference. Result has 154 places, 151 transitions, 471 flow [2024-11-08 16:36:14,652 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=471, PETRI_PLACES=154, PETRI_TRANSITIONS=151} [2024-11-08 16:36:14,653 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 21 predicate places. [2024-11-08 16:36:14,653 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 471 flow [2024-11-08 16:36:14,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:14,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:14,654 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:14,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 16:36:14,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:14,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:14,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash -138767400, now seen corresponding path program 1 times [2024-11-08 16:36:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:14,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873267224] [2024-11-08 16:36:14,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:14,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:14,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:14,863 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:14,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 16:36:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:14,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 16:36:14,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:14,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-08 16:36:15,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2024-11-08 16:36:15,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:15,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52 [2024-11-08 16:36:15,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:15,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71 [2024-11-08 16:36:15,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:15,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:15,206 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:15,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873267224] [2024-11-08 16:36:15,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873267224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:15,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:15,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:36:15,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97092102] [2024-11-08 16:36:15,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:15,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:36:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:36:15,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:36:15,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2024-11-08 16:36:15,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:15,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:15,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2024-11-08 16:36:15,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:15,827 INFO L124 PetriNetUnfolderBase]: 135/644 cut-off events. [2024-11-08 16:36:15,827 INFO L125 PetriNetUnfolderBase]: For 84/88 co-relation queries the response was YES. [2024-11-08 16:36:15,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 644 events. 135/644 cut-off events. For 84/88 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3398 event pairs, 33 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 1020. Up to 198 conditions per place. [2024-11-08 16:36:15,831 INFO L140 encePairwiseOnDemand]: 121/136 looper letters, 24 selfloop transitions, 39 changer transitions 0/188 dead transitions. [2024-11-08 16:36:15,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 188 transitions, 703 flow [2024-11-08 16:36:15,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:36:15,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:36:15,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2024-11-08 16:36:15,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9031862745098039 [2024-11-08 16:36:15,835 INFO L175 Difference]: Start difference. First operand has 154 places, 151 transitions, 471 flow. Second operand 6 states and 737 transitions. [2024-11-08 16:36:15,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 188 transitions, 703 flow [2024-11-08 16:36:15,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 188 transitions, 677 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-08 16:36:15,840 INFO L231 Difference]: Finished difference. Result has 158 places, 188 transitions, 735 flow [2024-11-08 16:36:15,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=735, PETRI_PLACES=158, PETRI_TRANSITIONS=188} [2024-11-08 16:36:15,841 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 25 predicate places. [2024-11-08 16:36:15,841 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 188 transitions, 735 flow [2024-11-08 16:36:15,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:15,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:15,842 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:15,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 16:36:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:16,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:16,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1331514975, now seen corresponding path program 1 times [2024-11-08 16:36:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241241075] [2024-11-08 16:36:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:16,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:16,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:16,050 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:16,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 16:36:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:16,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 16:36:16,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:16,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:36:16,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2024-11-08 16:36:16,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:16,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2024-11-08 16:36:16,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:16,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 44 [2024-11-08 16:36:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:36:16,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:16,542 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:16,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241241075] [2024-11-08 16:36:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241241075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:16,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:16,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:36:16,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678955983] [2024-11-08 16:36:16,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:16,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:36:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:36:16,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:36:17,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 136 [2024-11-08 16:36:17,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 188 transitions, 735 flow. Second operand has 11 states, 11 states have (on average 100.36363636363636) internal successors, (1104), 11 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:17,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:17,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 136 [2024-11-08 16:36:17,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:17,523 INFO L124 PetriNetUnfolderBase]: 156/764 cut-off events. [2024-11-08 16:36:17,523 INFO L125 PetriNetUnfolderBase]: For 350/383 co-relation queries the response was YES. [2024-11-08 16:36:17,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 764 events. 156/764 cut-off events. For 350/383 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4517 event pairs, 20 based on Foata normal form. 0/710 useless extension candidates. Maximal degree in co-relation 1612. Up to 135 conditions per place. [2024-11-08 16:36:17,528 INFO L140 encePairwiseOnDemand]: 111/136 looper letters, 71 selfloop transitions, 47 changer transitions 2/234 dead transitions. [2024-11-08 16:36:17,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 234 transitions, 1198 flow [2024-11-08 16:36:17,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:36:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-08 16:36:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1248 transitions. [2024-11-08 16:36:17,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-11-08 16:36:17,532 INFO L175 Difference]: Start difference. First operand has 158 places, 188 transitions, 735 flow. Second operand 12 states and 1248 transitions. [2024-11-08 16:36:17,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 234 transitions, 1198 flow [2024-11-08 16:36:17,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 234 transitions, 1174 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-11-08 16:36:17,544 INFO L231 Difference]: Finished difference. Result has 174 places, 221 transitions, 1077 flow [2024-11-08 16:36:17,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1077, PETRI_PLACES=174, PETRI_TRANSITIONS=221} [2024-11-08 16:36:17,548 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 41 predicate places. [2024-11-08 16:36:17,548 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 221 transitions, 1077 flow [2024-11-08 16:36:17,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.36363636363636) internal successors, (1104), 11 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:17,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:17,550 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:17,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 16:36:17,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:17,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:17,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:17,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1179127710, now seen corresponding path program 1 times [2024-11-08 16:36:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:17,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [330599713] [2024-11-08 16:36:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:17,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:17,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:17,758 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:17,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 16:36:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:17,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 16:36:17,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:17,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:17,881 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:17,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330599713] [2024-11-08 16:36:17,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330599713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:17,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:36:17,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:36:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801122305] [2024-11-08 16:36:17,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:17,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:36:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:17,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:36:17,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:36:17,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 136 [2024-11-08 16:36:17,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 221 transitions, 1077 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:17,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:17,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 136 [2024-11-08 16:36:17,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:18,066 INFO L124 PetriNetUnfolderBase]: 155/793 cut-off events. [2024-11-08 16:36:18,066 INFO L125 PetriNetUnfolderBase]: For 451/484 co-relation queries the response was YES. [2024-11-08 16:36:18,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 793 events. 155/793 cut-off events. For 451/484 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4855 event pairs, 19 based on Foata normal form. 4/766 useless extension candidates. Maximal degree in co-relation 1780. Up to 143 conditions per place. [2024-11-08 16:36:18,071 INFO L140 encePairwiseOnDemand]: 129/136 looper letters, 15 selfloop transitions, 11 changer transitions 12/228 dead transitions. [2024-11-08 16:36:18,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 228 transitions, 1157 flow [2024-11-08 16:36:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:36:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:36:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2024-11-08 16:36:18,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946078431372549 [2024-11-08 16:36:18,074 INFO L175 Difference]: Start difference. First operand has 174 places, 221 transitions, 1077 flow. Second operand 3 states and 386 transitions. [2024-11-08 16:36:18,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 228 transitions, 1157 flow [2024-11-08 16:36:18,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 228 transitions, 1111 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-11-08 16:36:18,085 INFO L231 Difference]: Finished difference. Result has 174 places, 216 transitions, 1077 flow [2024-11-08 16:36:18,086 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1077, PETRI_PLACES=174, PETRI_TRANSITIONS=216} [2024-11-08 16:36:18,086 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 41 predicate places. [2024-11-08 16:36:18,086 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 216 transitions, 1077 flow [2024-11-08 16:36:18,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:18,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:36:18,087 INFO L204 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, 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-08 16:36:18,108 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 16:36:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:18,288 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:36:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:18,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1178481287, now seen corresponding path program 1 times [2024-11-08 16:36:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:36:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760992248] [2024-11-08 16:36:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:18,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:18,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:18,292 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:18,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 16:36:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:18,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-08 16:36:18,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:18,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 16:36:18,586 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 16:36:18,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-08 16:36:19,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-08 16:36:20,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2024-11-08 16:36:20,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 16:36:20,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 66 [2024-11-08 16:36:21,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2024-11-08 16:36:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:21,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:36:21,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (let ((.cse2 (bvadd .cse1 (_ bv3 32) c_~datas~0.offset))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 (_ bv2 32) c_~datas~0.offset))))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse2)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 c_~datas~0.offset))))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 (_ bv1 32) c_~datas~0.offset))))))))) is different from false [2024-11-08 16:36:21,700 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (let ((.cse3 (bvadd .cse1 (_ bv2 32) c_~datas~0.offset)) (.cse2 (bvadd .cse1 (_ bv3 32) c_~datas~0.offset))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 c_~datas~0.offset))))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse2)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 (_ bv1 32) c_~datas~0.offset))))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse3)))))))) is different from false [2024-11-08 16:36:22,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:22,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 76 [2024-11-08 16:36:22,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:22,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 44 [2024-11-08 16:36:22,175 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2024-11-08 16:36:22,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 1 [2024-11-08 16:36:22,185 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2024-11-08 16:36:22,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 1 [2024-11-08 16:36:22,208 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2024-11-08 16:36:22,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 1 [2024-11-08 16:36:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:23,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:36:23,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760992248] [2024-11-08 16:36:23,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760992248] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 16:36:23,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:36:23,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 31 [2024-11-08 16:36:23,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450286706] [2024-11-08 16:36:23,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:23,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:36:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:36:23,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:36:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=719, Unknown=12, NotChecked=114, Total=992 [2024-11-08 16:36:23,623 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 136 [2024-11-08 16:36:23,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 216 transitions, 1077 flow. Second operand has 14 states, 14 states have (on average 87.42857142857143) internal successors, (1224), 14 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:23,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:36:23,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 136 [2024-11-08 16:36:23,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:36:24,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (let ((.cse3 (bvadd .cse5 (_ bv1 32) c_~datas~0.offset)) (.cse1 (bvadd .cse5 (_ bv2 32) c_~datas~0.offset)) (.cse2 (bvadd .cse5 (_ bv3 32) c_~datas~0.offset))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse1)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse2)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse3)))) (or (forall ((|ULTIMATE.start_main_#t~ret10#1| (_ BitVec 32))) (let ((.cse4 (bvadd |ULTIMATE.start_main_#t~ret10#1| (_ bv4294967295 32)))) (or (= (_ bv0 32) (bvand c_~threads_mask~0 (bvshl (_ bv1 32) .cse4))) (not (= (bvand c_~threads_mask~0 (bvlshr (_ bv4294967295 32) (bvadd (_ bv32 32) (bvneg .cse4)))) (_ bv0 32)))))) (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~tids~0#1.base|)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse5 c_~datas~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2024-11-08 16:36:25,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|ULTIMATE.start_main_#t~ret10#1| (_ BitVec 32))) (let ((.cse2 (bvadd |ULTIMATE.start_main_#t~ret10#1| (_ bv4294967295 32)))) (or (= (_ bv0 32) (bvand c_~threads_mask~0 (bvshl (_ bv1 32) .cse2))) (not (= (bvand c_~threads_mask~0 (bvlshr (_ bv4294967295 32) (bvadd (_ bv32 32) (bvneg .cse2)))) (_ bv0 32))))))) (.cse1 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (and (or (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~tids~0#1.base|)) .cse0) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 (_ bv2 32) c_~datas~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 (_ bv3 32) c_~datas~0.offset))))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 c_~datas~0.offset))))) (or .cse0 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|)))) (or .cse0 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~tids~0#1.base|)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse1 (_ bv1 32) c_~datas~0.offset))))))) is different from false [2024-11-08 16:36:25,395 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (let ((.cse3 (bvadd .cse6 c_~datas~0.offset)) (.cse1 (bvadd .cse6 (_ bv2 32) c_~datas~0.offset)) (.cse0 (forall ((|ULTIMATE.start_main_#t~ret10#1| (_ BitVec 32))) (let ((.cse7 (bvadd |ULTIMATE.start_main_#t~ret10#1| (_ bv4294967295 32)))) (or (= (_ bv0 32) (bvand c_~threads_mask~0 (bvshl (_ bv1 32) .cse7))) (not (= (bvand c_~threads_mask~0 (bvlshr (_ bv4294967295 32) (bvadd (_ bv32 32) (bvneg .cse7)))) (_ bv0 32))))))) (.cse2 (select |c_#race| c_~datas~0.base)) (.cse4 (bvadd .cse6 (_ bv3 32) c_~datas~0.offset)) (.cse5 (bvadd .cse6 (_ bv1 32) c_~datas~0.offset))) (and (or (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~tids~0#1.base|)) .cse0) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))) (= (_ bv0 1) (bvadd (select .cse2 .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse4)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse3)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select .cse2 .cse1))) (or .cse0 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|)))) (or .cse0 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~tids~0#1.base|)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select .cse2 .cse5))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select .cse2 .cse4))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse5))))))) is different from false [2024-11-08 16:36:25,894 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (let ((.cse4 (bvadd .cse5 (_ bv1 32) c_~datas~0.offset)) (.cse2 (bvadd .cse5 (_ bv2 32) c_~datas~0.offset)) (.cse3 (bvadd .cse5 (_ bv3 32) c_~datas~0.offset))) (let ((.cse0 (forall ((|ULTIMATE.start_main_#t~ret10#1| (_ BitVec 32))) (let ((.cse6 (bvadd |ULTIMATE.start_main_#t~ret10#1| (_ bv4294967295 32)))) (or (= (_ bv0 32) (bvand c_~threads_mask~0 (bvshl (_ bv1 32) .cse6))) (not (= (bvand c_~threads_mask~0 (bvlshr (_ bv4294967295 32) (bvadd (_ bv32 32) (bvneg .cse6)))) (_ bv0 32))))))) (.cse1 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (or (not (= |c_ULTIMATE.start_main_#t~malloc8#1.base| |c_ULTIMATE.start_main_~tids~0#1.base|)) .cse0) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse2)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse3)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) .cse4)))) (or .cse0 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc7#1.base|)))) (or .cse0 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~tids~0#1.base|)))) (forall ((v_ArrVal_179 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store .cse1 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_179) c_~datas~0.base) (bvadd .cse5 c_~datas~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2024-11-08 16:36:39,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:36:43,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:36:50,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:36:54,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:36:59,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:37:03,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:37:08,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:37:08,840 INFO L124 PetriNetUnfolderBase]: 761/2658 cut-off events. [2024-11-08 16:37:08,841 INFO L125 PetriNetUnfolderBase]: For 2358/2410 co-relation queries the response was YES. [2024-11-08 16:37:08,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7487 conditions, 2658 events. 761/2658 cut-off events. For 2358/2410 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 21715 event pairs, 125 based on Foata normal form. 39/2629 useless extension candidates. Maximal degree in co-relation 7217. Up to 492 conditions per place. [2024-11-08 16:37:08,858 INFO L140 encePairwiseOnDemand]: 99/136 looper letters, 228 selfloop transitions, 165 changer transitions 0/489 dead transitions. [2024-11-08 16:37:08,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 489 transitions, 3086 flow [2024-11-08 16:37:08,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 16:37:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-08 16:37:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2613 transitions. [2024-11-08 16:37:08,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7116013071895425 [2024-11-08 16:37:08,866 INFO L175 Difference]: Start difference. First operand has 174 places, 216 transitions, 1077 flow. Second operand 27 states and 2613 transitions. [2024-11-08 16:37:08,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 489 transitions, 3086 flow [2024-11-08 16:37:08,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 489 transitions, 3058 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-08 16:37:08,904 INFO L231 Difference]: Finished difference. Result has 202 places, 356 transitions, 2392 flow [2024-11-08 16:37:08,905 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=2392, PETRI_PLACES=202, PETRI_TRANSITIONS=356} [2024-11-08 16:37:08,905 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 69 predicate places. [2024-11-08 16:37:08,906 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 356 transitions, 2392 flow [2024-11-08 16:37:08,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.42857142857143) internal successors, (1224), 14 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:08,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:37:08,907 INFO L204 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, 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-08 16:37:08,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 16:37:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:09,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:37:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:09,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1879933811, now seen corresponding path program 2 times [2024-11-08 16:37:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:37:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [50107731] [2024-11-08 16:37:09,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 16:37:09,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:09,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:09,116 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:09,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 16:37:09,236 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 16:37:09,236 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:37:09,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 16:37:09,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:09,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 16:37:09,491 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 16:37:09,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-08 16:37:11,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-08 16:37:11,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2024-11-08 16:37:11,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2024-11-08 16:37:12,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 66 [2024-11-08 16:37:12,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2024-11-08 16:37:12,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:12,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:37:12,955 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (and (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse0 (_ bv3 32) c_~datas~0.offset))))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse0 (_ bv1 32) c_~datas~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse0 c_~datas~0.offset))))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse0 (_ bv2 32) c_~datas~0.offset))))))) is different from false [2024-11-08 16:37:12,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (let ((.cse2 (bvadd .cse1 (_ bv3 32) c_~datas~0.offset))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse1 c_~datas~0.offset))))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) .cse2)))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse1 (_ bv2 32) c_~datas~0.offset))))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse1 (_ bv1 32) c_~datas~0.offset))))))))) is different from false [2024-11-08 16:37:13,396 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (let ((.cse3 (bvadd .cse1 (_ bv2 32) c_~datas~0.offset)) (.cse2 (bvadd .cse1 (_ bv3 32) c_~datas~0.offset))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse1 (_ bv1 32) c_~datas~0.offset))))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) .cse2)))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) .cse3)))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse1 c_~datas~0.offset))) (_ bv0 1))))))) is different from false [2024-11-08 16:37:13,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul (_ bv4 32) c_threadThread1of1ForFork0_~j~0))) (let ((.cse1 (bvadd .cse3 (_ bv1 32) c_~datas~0.offset)) (.cse4 (bvadd .cse3 (_ bv2 32) c_~datas~0.offset)) (.cse2 (bvadd .cse3 (_ bv3 32) c_~datas~0.offset))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) .cse1)))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) .cse2)))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (_ bv0 1) (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) (bvadd .cse3 c_~datas~0.offset))))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 1)))) (= (bvadd |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~tids~0#1.base| v_ArrVal_214) c_~datas~0.base) .cse4)) (_ bv0 1))))))) is different from false [2024-11-08 16:37:13,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:13,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 77 [2024-11-08 16:37:13,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:13,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 39 [2024-11-08 16:37:13,516 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2024-11-08 16:37:13,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 1 [2024-11-08 16:37:13,527 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2024-11-08 16:37:13,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 1 [2024-11-08 16:37:13,539 INFO L349 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2024-11-08 16:37:13,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 1 [2024-11-08 16:37:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 16:37:14,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:37:14,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50107731] [2024-11-08 16:37:14,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50107731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:37:14,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:37:14,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 29 [2024-11-08 16:37:14,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650578963] [2024-11-08 16:37:14,069 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:37:14,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 16:37:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:37:14,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 16:37:14,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=558, Unknown=4, NotChecked=204, Total=870 [2024-11-08 16:37:14,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 136 [2024-11-08 16:37:14,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 356 transitions, 2392 flow. Second operand has 30 states, 30 states have (on average 72.16666666666667) internal successors, (2165), 30 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:14,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:37:14,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 136 [2024-11-08 16:37:14,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:37:24,006 INFO L124 PetriNetUnfolderBase]: 778/2721 cut-off events. [2024-11-08 16:37:24,006 INFO L125 PetriNetUnfolderBase]: For 7973/8072 co-relation queries the response was YES. [2024-11-08 16:37:24,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10463 conditions, 2721 events. 778/2721 cut-off events. For 7973/8072 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 22274 event pairs, 60 based on Foata normal form. 57/2708 useless extension candidates. Maximal degree in co-relation 10123. Up to 769 conditions per place. [2024-11-08 16:37:24,023 INFO L140 encePairwiseOnDemand]: 106/136 looper letters, 361 selfloop transitions, 84 changer transitions 0/527 dead transitions. [2024-11-08 16:37:24,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 527 transitions, 4666 flow [2024-11-08 16:37:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 16:37:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-11-08 16:37:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2296 transitions. [2024-11-08 16:37:24,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5627450980392157 [2024-11-08 16:37:24,031 INFO L175 Difference]: Start difference. First operand has 202 places, 356 transitions, 2392 flow. Second operand 30 states and 2296 transitions. [2024-11-08 16:37:24,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 527 transitions, 4666 flow [2024-11-08 16:37:24,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 527 transitions, 4596 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-11-08 16:37:24,106 INFO L231 Difference]: Finished difference. Result has 229 places, 372 transitions, 2620 flow [2024-11-08 16:37:24,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=2324, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2620, PETRI_PLACES=229, PETRI_TRANSITIONS=372} [2024-11-08 16:37:24,108 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 96 predicate places. [2024-11-08 16:37:24,110 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 372 transitions, 2620 flow [2024-11-08 16:37:24,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 72.16666666666667) internal successors, (2165), 30 states have internal predecessors, (2165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:24,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:37:24,112 INFO L204 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, 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-08 16:37:24,135 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 16:37:24,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:24,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:37:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash -897220860, now seen corresponding path program 1 times [2024-11-08 16:37:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:37:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047012587] [2024-11-08 16:37:24,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:24,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:24,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:24,317 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:24,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 16:37:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:24,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 16:37:24,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:24,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-08 16:37:24,645 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-08 16:37:24,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-08 16:37:25,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:37:25,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2024-11-08 16:37:25,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2024-11-08 16:37:25,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 44 [2024-11-08 16:37:25,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2024-11-08 16:37:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 16:37:25,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:37:25,644 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:37:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047012587] [2024-11-08 16:37:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047012587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:37:25,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:37:25,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 16:37:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754954460] [2024-11-08 16:37:25,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:37:25,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 16:37:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:37:25,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 16:37:25,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:37:27,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 136 [2024-11-08 16:37:27,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 372 transitions, 2620 flow. Second operand has 14 states, 14 states have (on average 94.21428571428571) internal successors, (1319), 14 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:27,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:37:27,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 136 [2024-11-08 16:37:27,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:37:28,885 INFO L124 PetriNetUnfolderBase]: 448/2108 cut-off events. [2024-11-08 16:37:28,885 INFO L125 PetriNetUnfolderBase]: For 5981/6009 co-relation queries the response was YES. [2024-11-08 16:37:28,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7766 conditions, 2108 events. 448/2108 cut-off events. For 5981/6009 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 17741 event pairs, 35 based on Foata normal form. 20/2057 useless extension candidates. Maximal degree in co-relation 7418. Up to 360 conditions per place. [2024-11-08 16:37:28,898 INFO L140 encePairwiseOnDemand]: 115/136 looper letters, 128 selfloop transitions, 60 changer transitions 1/400 dead transitions. [2024-11-08 16:37:28,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 400 transitions, 3303 flow [2024-11-08 16:37:28,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:37:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-08 16:37:28,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1442 transitions. [2024-11-08 16:37:28,902 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7068627450980393 [2024-11-08 16:37:28,902 INFO L175 Difference]: Start difference. First operand has 229 places, 372 transitions, 2620 flow. Second operand 15 states and 1442 transitions. [2024-11-08 16:37:28,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 400 transitions, 3303 flow [2024-11-08 16:37:28,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 400 transitions, 3112 flow, removed 18 selfloop flow, removed 17 redundant places. [2024-11-08 16:37:28,962 INFO L231 Difference]: Finished difference. Result has 230 places, 371 transitions, 2675 flow [2024-11-08 16:37:28,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=2452, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2675, PETRI_PLACES=230, PETRI_TRANSITIONS=371} [2024-11-08 16:37:28,963 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, 97 predicate places. [2024-11-08 16:37:28,964 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 371 transitions, 2675 flow [2024-11-08 16:37:28,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 94.21428571428571) internal successors, (1319), 14 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:28,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:37:28,965 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 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-08 16:37:28,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 16:37:29,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:29,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-08 16:37:29,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:29,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1502574702, now seen corresponding path program 1 times [2024-11-08 16:37:29,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:37:29,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [487414238] [2024-11-08 16:37:29,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:29,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:29,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:29,168 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:29,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 16:37:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:37:29,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:37:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:37:29,417 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-08 16:37:29,418 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:37:29,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-11-08 16:37:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-08 16:37:29,421 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-08 16:37:29,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-08 16:37:29,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-08 16:37:29,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-08 16:37:29,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-08 16:37:29,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-11-08 16:37:29,422 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-08 16:37:29,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-08 16:37:29,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-08 16:37:29,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-08 16:37:29,423 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-08 16:37:29,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-08 16:37:29,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-08 16:37:29,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-08 16:37:29,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 16:37:29,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:29,625 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:29,713 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-08 16:37:29,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:37:29,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:37:29 BasicIcfg [2024-11-08 16:37:29,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:37:29,720 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:37:29,721 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:37:29,721 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:37:29,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:36:09" (3/4) ... [2024-11-08 16:37:29,723 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 16:37:29,811 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 16:37:29,811 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:37:29,812 INFO L158 Benchmark]: Toolchain (without parser) took 82433.12ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 64.4MB in the beginning and 127.7MB in the end (delta: -63.3MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-11-08 16:37:29,812 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 60.8MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:37:29,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 922.26ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 55.1MB in the end (delta: 9.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-08 16:37:29,813 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.31ms. Allocated memory is still 90.2MB. Free memory was 55.1MB in the beginning and 52.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:37:29,813 INFO L158 Benchmark]: Boogie Preprocessor took 38.49ms. Allocated memory is still 90.2MB. Free memory was 52.4MB in the beginning and 50.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:37:29,813 INFO L158 Benchmark]: RCFGBuilder took 654.89ms. Allocated memory is still 90.2MB. Free memory was 50.4MB in the beginning and 28.9MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 16:37:29,814 INFO L158 Benchmark]: TraceAbstraction took 80617.32ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 63.5MB in the beginning and 135.0MB in the end (delta: -71.5MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2024-11-08 16:37:29,814 INFO L158 Benchmark]: Witness Printer took 91.85ms. Allocated memory is still 232.8MB. Free memory was 135.0MB in the beginning and 127.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 16:37:29,819 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.29ms. Allocated memory is still 60.8MB. Free memory was 36.9MB in the beginning and 36.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 922.26ms. Allocated memory is still 90.2MB. Free memory was 64.1MB in the beginning and 55.1MB in the end (delta: 9.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.31ms. Allocated memory is still 90.2MB. Free memory was 55.1MB in the beginning and 52.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.49ms. Allocated memory is still 90.2MB. Free memory was 52.4MB in the beginning and 50.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 654.89ms. Allocated memory is still 90.2MB. Free memory was 50.4MB in the beginning and 28.9MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 80617.32ms. Allocated memory was 90.2MB in the beginning and 232.8MB in the end (delta: 142.6MB). Free memory was 63.5MB in the beginning and 135.0MB in the end (delta: -71.5MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. * Witness Printer took 91.85ms. Allocated memory is still 232.8MB. Free memory was 135.0MB in the beginning and 127.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1058]: Data race detected Data race detected The following path leads to a data race: [L1043] 0 int threads_mask = -1; VAL [threads_mask=-1] [L1044] 0 int *datas; VAL [datas={0:0}, threads_mask=-1] [L1052] 0 int threads_total = __VERIFIER_nondet_int(); VAL [datas={0:0}, threads_mask=-1, threads_total=2] [L1053] CALL 0 assume_abort_if_not(threads_total >= 0) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1053] RET 0 assume_abort_if_not(threads_total >= 0) [L1054] CALL 0 assume_abort_if_not(threads_total < 32) [L1040] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, datas={0:0}, threads_mask=-1] [L1054] RET 0 assume_abort_if_not(threads_total < 32) [L1055] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [datas={0:0}, threads_mask=-1, threads_total=2, tids={2:0}] [L1056] 0 datas = malloc(threads_total * sizeof(int)) VAL [datas={1:0}, threads_mask=-1, threads_total=2, tids={2:0}] [L1057] 0 int i = 0; VAL [datas={1:0}, i=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1057] COND FALSE 0 !(i < threads_total) VAL [datas={1:0}, i=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1057] COND TRUE 0 i < threads_total VAL [datas={1:0}, i=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1058] EXPR 0 ffs(threads_mask) VAL [datas={1:0}, i=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1058] 0 int j = ffs(threads_mask) - 1; VAL [datas={1:0}, i=0, j=0, threads_mask=-1, threads_total=2, tids={2:0}] [L1059] 0 threads_mask &= ~(1 << j) VAL [datas={1:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1060] 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [datas={1:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1060] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, (void*)j) VAL [\old(arg)={0:0}, datas={1:0}, i=0, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1046] 1 int j = (int)arg; VAL [\old(arg)={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2] [L1047] EXPR 1 datas[j] VAL [\old(arg)={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2] [L1047] 1 datas[j] = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2] [L1057] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, datas={1:0}, i=1, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1057] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, arg={0:0}, datas={1:0}, i=1, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1057] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, datas={1:0}, i=1, j=0, threads_mask=-2, threads_total=2, tids={2:0}] [L1048] 1 threads_mask |= 1 << j VAL [\old(arg)={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-1] [L1058] 0 ffs(threads_mask) VAL [\old(arg)={0:0}, arg={0:0}, datas={1:0}, i=1, j=0, threads_mask=-1, threads_total=2, tids={2:0}] Now there is a data race on ~threads_mask~0 between C: threads_mask |= 1 << j [1048] and C: ffs(threads_mask) [1058] - UnprovableResult [Line: 1056]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1060]: 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: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1048]: 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, 159 locations, 16 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: 80.3s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 62.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 142 mSolverCounterUnknown, 1985 SdHoareTripleChecker+Valid, 41.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1639 mSDsluCounter, 3305 SdHoareTripleChecker+Invalid, 39.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2505 IncrementalHoareTripleChecker+Unchecked, 3028 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5468 IncrementalHoareTripleChecker+Invalid, 8298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 277 mSDtfsCounter, 5468 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1027 GetRequests, 863 SyntacticMatches, 3 SemanticMatches, 161 ConstructedPredicates, 10 IntricatePredicates, 1 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 23.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2675occurred in iteration=13, InterpolantAutomatonStates: 131, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 893 NumberOfCodeBlocks, 893 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 960 ConstructedInterpolants, 44 QuantifiedInterpolants, 11358 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1248 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 16:37:29,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cb2f68d-3478-4bb0-823d-d7495d5882b8/bin/uautomizer-verify-jihMAELWvX/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