./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu --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 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:54,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:54,590 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-19 08:03:54,596 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:54,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:54,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:54,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:54,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:54,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:03:54,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:03:54,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:54,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:54,625 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:54,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:54,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:03:54,627 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:54,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:03:54,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:54,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:54,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:03:54,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:03:54,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:03:54,636 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-19 08:03:54,637 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:03:54,637 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:54,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:03:54,644 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:54,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:54,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:54,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:03:54,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:54,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:54,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:03:54,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:03:54,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:03:54,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:03:54,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:03:54,654 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:03:54,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:03:54,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:03:54,656 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:03:54,656 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_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/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_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu 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 -> 0bf02669c3dd381b0745ab8dce392518dfe698af15c4a94bd383f1dab20a8c06 [2023-11-19 08:03:54,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:54,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:54,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:54,985 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:54,985 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:54,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2023-11-19 08:03:58,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:03:58,516 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:03:58,517 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/sv-benchmarks/c/pthread-ext/09_fmaxsym-race.i [2023-11-19 08:03:58,533 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/data/79644c894/02f440d1892d49d1ae3dd12a8ce364a4/FLAG721e24d3f [2023-11-19 08:03:58,548 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/data/79644c894/02f440d1892d49d1ae3dd12a8ce364a4 [2023-11-19 08:03:58,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:03:58,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:03:58,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:58,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:03:58,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:03:58,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:58" (1/1) ... [2023-11-19 08:03:58,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217a54c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:58, skipping insertion in model container [2023-11-19 08:03:58,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:58" (1/1) ... [2023-11-19 08:03:58,619 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:03:58,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:59,003 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:03:59,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:59,124 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:03:59,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59 WrapperNode [2023-11-19 08:03:59,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:59,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:59,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:03:59,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:03:59,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,180 INFO L138 Inliner]: procedures = 171, calls = 25, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 105 [2023-11-19 08:03:59,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:59,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:03:59,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:03:59,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:03:59,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:03:59,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:03:59,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:03:59,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:03:59,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (1/1) ... [2023-11-19 08:03:59,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:59,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:59,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8831ceaf-2826-489b-a00d-cf237bbdd48f/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:03:59,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:03:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-19 08:03:59,321 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-19 08:03:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:03:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:03:59,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:03:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:03:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:03:59,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:03:59,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:03:59,324 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:03:59,456 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:03:59,458 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:03:59,731 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:03:59,844 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:03:59,845 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 08:03:59,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:59 BoogieIcfgContainer [2023-11-19 08:03:59,849 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:03:59,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:03:59,853 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:03:59,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:03:59,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:58" (1/3) ... [2023-11-19 08:03:59,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305c233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:59, skipping insertion in model container [2023-11-19 08:03:59,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:59" (2/3) ... [2023-11-19 08:03:59,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305c233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:59, skipping insertion in model container [2023-11-19 08:03:59,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:59" (3/3) ... [2023-11-19 08:03:59,861 INFO L112 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-race.i [2023-11-19 08:03:59,871 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 08:03:59,883 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:03:59,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-19 08:03:59,885 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:03:59,974 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:04:00,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 101 transitions, 206 flow [2023-11-19 08:04:00,069 INFO L124 PetriNetUnfolderBase]: 8/112 cut-off events. [2023-11-19 08:04:00,069 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:00,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 112 events. 8/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-11-19 08:04:00,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 101 transitions, 206 flow [2023-11-19 08:04:00,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 101 transitions, 206 flow [2023-11-19 08:04:00,086 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:04:00,096 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 101 transitions, 206 flow [2023-11-19 08:04:00,099 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 101 transitions, 206 flow [2023-11-19 08:04:00,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 101 transitions, 206 flow [2023-11-19 08:04:00,138 INFO L124 PetriNetUnfolderBase]: 8/112 cut-off events. [2023-11-19 08:04:00,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:00,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 112 events. 8/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2023-11-19 08:04:00,143 INFO L119 LiptonReduction]: Number of co-enabled transitions 1876 [2023-11-19 08:04:04,259 INFO L134 LiptonReduction]: Checked pairs total: 2057 [2023-11-19 08:04:04,260 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-11-19 08:04:04,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:04,283 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@5dc15139, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:04,283 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-19 08:04:04,287 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:04:04,288 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2023-11-19 08:04:04,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:04,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:04,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:04:04,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-19 08:04:04,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 505878653, now seen corresponding path program 1 times [2023-11-19 08:04:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617205977] [2023-11-19 08:04:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:04,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617205977] [2023-11-19 08:04:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617205977] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:04,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:04,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:04,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062403648] [2023-11-19 08:04:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:04,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:04:04,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:04:04,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:04:04,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 223 [2023-11-19 08:04:04,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 38 flow. Second operand has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 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) [2023-11-19 08:04:04,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:04,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 223 [2023-11-19 08:04:04,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:04,716 INFO L124 PetriNetUnfolderBase]: 7/19 cut-off events. [2023-11-19 08:04:04,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:04:04,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 7/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 4 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 30. Up to 19 conditions per place. [2023-11-19 08:04:04,718 INFO L140 encePairwiseOnDemand]: 214/223 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2023-11-19 08:04:04,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 11 places, 8 transitions, 34 flow [2023-11-19 08:04:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:04:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:04:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2023-11-19 08:04:04,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4260089686098655 [2023-11-19 08:04:04,747 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 190 transitions. [2023-11-19 08:04:04,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 190 transitions. [2023-11-19 08:04:04,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:04,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 190 transitions. [2023-11-19 08:04:04,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 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) [2023-11-19 08:04:04,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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) [2023-11-19 08:04:04,769 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 223.0) internal successors, (669), 3 states have internal predecessors, (669), 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) [2023-11-19 08:04:04,771 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 38 flow. Second operand 2 states and 190 transitions. [2023-11-19 08:04:04,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 11 places, 8 transitions, 34 flow [2023-11-19 08:04:04,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 11 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:04,776 INFO L231 Difference]: Finished difference. Result has 11 places, 8 transitions, 20 flow [2023-11-19 08:04:04,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=20, PETRI_PLACES=11, PETRI_TRANSITIONS=8} [2023-11-19 08:04:04,783 INFO L281 CegarLoopForPetriNet]: 19 programPoint places, -8 predicate places. [2023-11-19 08:04:04,784 INFO L495 AbstractCegarLoop]: Abstraction has has 11 places, 8 transitions, 20 flow [2023-11-19 08:04:04,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 89.5) internal successors, (179), 2 states have internal predecessors, (179), 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) [2023-11-19 08:04:04,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:04,785 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-19 08:04:04,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:04:04,786 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2023-11-19 08:04:04,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1497718846, now seen corresponding path program 1 times [2023-11-19 08:04:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628806728] [2023-11-19 08:04:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:04,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:04:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:04,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:04:04,912 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:04:04,914 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2023-11-19 08:04:04,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2023-11-19 08:04:04,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2023-11-19 08:04:04,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2023-11-19 08:04:04,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2023-11-19 08:04:04,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2023-11-19 08:04:04,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2023-11-19 08:04:04,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2023-11-19 08:04:04,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2023-11-19 08:04:04,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2023-11-19 08:04:04,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2023-11-19 08:04:04,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2023-11-19 08:04:04,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2023-11-19 08:04:04,923 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2023-11-19 08:04:04,924 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2023-11-19 08:04:04,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2023-11-19 08:04:04,925 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2023-11-19 08:04:04,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:04:04,926 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-19 08:04:04,930 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:04:04,930 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-19 08:04:04,995 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:04:05,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 169 transitions, 348 flow [2023-11-19 08:04:05,108 INFO L124 PetriNetUnfolderBase]: 15/193 cut-off events. [2023-11-19 08:04:05,109 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 08:04:05,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 193 events. 15/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 399 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 147. Up to 6 conditions per place. [2023-11-19 08:04:05,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 169 transitions, 348 flow [2023-11-19 08:04:05,116 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 169 transitions, 348 flow [2023-11-19 08:04:05,117 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:04:05,117 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 169 transitions, 348 flow [2023-11-19 08:04:05,118 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 169 transitions, 348 flow [2023-11-19 08:04:05,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 169 transitions, 348 flow [2023-11-19 08:04:05,182 INFO L124 PetriNetUnfolderBase]: 15/193 cut-off events. [2023-11-19 08:04:05,185 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-19 08:04:05,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 193 events. 15/193 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 399 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 147. Up to 6 conditions per place. [2023-11-19 08:04:05,203 INFO L119 LiptonReduction]: Number of co-enabled transitions 12864 [2023-11-19 08:04:07,804 INFO L134 LiptonReduction]: Checked pairs total: 39762 [2023-11-19 08:04:07,807 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-11-19 08:04:07,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:07,816 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@5dc15139, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:07,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-11-19 08:04:07,821 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:04:07,826 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-19 08:04:07,826 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:04:07,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:07,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:07,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-19 08:04:07,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash 700855026, now seen corresponding path program 1 times [2023-11-19 08:04:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608317664] [2023-11-19 08:04:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:07,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:07,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:07,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608317664] [2023-11-19 08:04:07,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608317664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:07,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:07,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:07,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827677786] [2023-11-19 08:04:07,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:07,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:04:07,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:07,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:04:07,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:04:07,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 311 [2023-11-19 08:04:07,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 142 flow. Second operand has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 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) [2023-11-19 08:04:07,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:07,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 311 [2023-11-19 08:04:07,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:08,081 INFO L124 PetriNetUnfolderBase]: 257/768 cut-off events. [2023-11-19 08:04:08,081 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-19 08:04:08,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 768 events. 257/768 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4804 event pairs, 183 based on Foata normal form. 66/686 useless extension candidates. Maximal degree in co-relation 604. Up to 412 conditions per place. [2023-11-19 08:04:08,089 INFO L140 encePairwiseOnDemand]: 300/311 looper letters, 22 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2023-11-19 08:04:08,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 55 transitions, 164 flow [2023-11-19 08:04:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:04:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:04:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2023-11-19 08:04:08,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128617363344051 [2023-11-19 08:04:08,093 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 319 transitions. [2023-11-19 08:04:08,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 319 transitions. [2023-11-19 08:04:08,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:08,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 319 transitions. [2023-11-19 08:04:08,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 159.5) internal successors, (319), 2 states have internal predecessors, (319), 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) [2023-11-19 08:04:08,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 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) [2023-11-19 08:04:08,099 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 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) [2023-11-19 08:04:08,099 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 142 flow. Second operand 2 states and 319 transitions. [2023-11-19 08:04:08,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 55 transitions, 164 flow [2023-11-19 08:04:08,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:08,102 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 120 flow [2023-11-19 08:04:08,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=120, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2023-11-19 08:04:08,104 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -8 predicate places. [2023-11-19 08:04:08,104 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 120 flow [2023-11-19 08:04:08,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 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) [2023-11-19 08:04:08,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:08,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:08,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:04:08,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-19 08:04:08,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:08,106 INFO L85 PathProgramCache]: Analyzing trace with hash 251665846, now seen corresponding path program 1 times [2023-11-19 08:04:08,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:08,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382940548] [2023-11-19 08:04:08,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:08,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:08,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382940548] [2023-11-19 08:04:08,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382940548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:08,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:08,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:08,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909559345] [2023-11-19 08:04:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:08,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:08,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:08,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:08,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:08,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 311 [2023-11-19 08:04:08,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 120 flow. Second operand has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 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) [2023-11-19 08:04:08,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:08,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 311 [2023-11-19 08:04:08,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:09,073 INFO L124 PetriNetUnfolderBase]: 381/949 cut-off events. [2023-11-19 08:04:09,073 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-19 08:04:09,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 949 events. 381/949 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5854 event pairs, 79 based on Foata normal form. 0/816 useless extension candidates. Maximal degree in co-relation 1602. Up to 275 conditions per place. [2023-11-19 08:04:09,083 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 65 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-11-19 08:04:09,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 366 flow [2023-11-19 08:04:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions. [2023-11-19 08:04:09,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4592711682743837 [2023-11-19 08:04:09,089 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 857 transitions. [2023-11-19 08:04:09,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions. [2023-11-19 08:04:09,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:09,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions. [2023-11-19 08:04:09,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 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) [2023-11-19 08:04:09,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 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) [2023-11-19 08:04:09,102 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 311.0) internal successors, (2177), 7 states have internal predecessors, (2177), 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) [2023-11-19 08:04:09,102 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 120 flow. Second operand 6 states and 857 transitions. [2023-11-19 08:04:09,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 98 transitions, 366 flow [2023-11-19 08:04:09,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:09,107 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 128 flow [2023-11-19 08:04:09,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-11-19 08:04:09,110 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2023-11-19 08:04:09,111 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 128 flow [2023-11-19 08:04:09,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 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) [2023-11-19 08:04:09,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:09,112 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-19 08:04:09,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:04:09,113 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-11-19 08:04:09,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash -149342972, now seen corresponding path program 1 times [2023-11-19 08:04:09,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:09,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608026233] [2023-11-19 08:04:09,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:09,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:04:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:09,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:04:09,164 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:04:09,164 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2023-11-19 08:04:09,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2023-11-19 08:04:09,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2023-11-19 08:04:09,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2023-11-19 08:04:09,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2023-11-19 08:04:09,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2023-11-19 08:04:09,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2023-11-19 08:04:09,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2023-11-19 08:04:09,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2023-11-19 08:04:09,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2023-11-19 08:04:09,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2023-11-19 08:04:09,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2023-11-19 08:04:09,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2023-11-19 08:04:09,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2023-11-19 08:04:09,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2023-11-19 08:04:09,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2023-11-19 08:04:09,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2023-11-19 08:04:09,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2023-11-19 08:04:09,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2023-11-19 08:04:09,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2023-11-19 08:04:09,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2023-11-19 08:04:09,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2023-11-19 08:04:09,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2023-11-19 08:04:09,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2023-11-19 08:04:09,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2023-11-19 08:04:09,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:04:09,181 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-19 08:04:09,182 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:04:09,182 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-19 08:04:09,264 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:04:09,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 237 transitions, 492 flow [2023-11-19 08:04:09,332 INFO L124 PetriNetUnfolderBase]: 22/274 cut-off events. [2023-11-19 08:04:09,332 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 08:04:09,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 274 events. 22/274 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 214. Up to 8 conditions per place. [2023-11-19 08:04:09,337 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 237 transitions, 492 flow [2023-11-19 08:04:09,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 237 transitions, 492 flow [2023-11-19 08:04:09,343 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:04:09,343 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 237 transitions, 492 flow [2023-11-19 08:04:09,343 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 237 transitions, 492 flow [2023-11-19 08:04:09,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 237 transitions, 492 flow [2023-11-19 08:04:09,395 INFO L124 PetriNetUnfolderBase]: 22/274 cut-off events. [2023-11-19 08:04:09,395 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-19 08:04:09,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 274 events. 22/274 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 776 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 214. Up to 8 conditions per place. [2023-11-19 08:04:09,422 INFO L119 LiptonReduction]: Number of co-enabled transitions 32964 [2023-11-19 08:04:12,853 INFO L134 LiptonReduction]: Checked pairs total: 109579 [2023-11-19 08:04:12,854 INFO L136 LiptonReduction]: Total number of compositions: 205 [2023-11-19 08:04:12,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:12,862 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@5dc15139, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:12,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-11-19 08:04:12,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:04:12,867 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-19 08:04:12,867 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:04:12,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:12,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:12,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-19 08:04:12,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1102847468, now seen corresponding path program 1 times [2023-11-19 08:04:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:12,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206696838] [2023-11-19 08:04:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:12,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:12,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206696838] [2023-11-19 08:04:12,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206696838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:12,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:12,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:12,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949679071] [2023-11-19 08:04:12,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:12,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:04:12,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:12,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:04:12,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:04:12,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 442 [2023-11-19 08:04:12,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 96 transitions, 210 flow. Second operand has 2 states, 2 states have (on average 202.0) internal successors, (404), 2 states have internal predecessors, (404), 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) [2023-11-19 08:04:12,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:12,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 442 [2023-11-19 08:04:12,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:14,018 INFO L124 PetriNetUnfolderBase]: 3827/8372 cut-off events. [2023-11-19 08:04:14,018 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2023-11-19 08:04:14,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13880 conditions, 8372 events. 3827/8372 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 72227 event pairs, 2841 based on Foata normal form. 893/7657 useless extension candidates. Maximal degree in co-relation 3842. Up to 5206 conditions per place. [2023-11-19 08:04:14,106 INFO L140 encePairwiseOnDemand]: 426/442 looper letters, 32 selfloop transitions, 0 changer transitions 0/80 dead transitions. [2023-11-19 08:04:14,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 242 flow [2023-11-19 08:04:14,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:04:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:04:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 446 transitions. [2023-11-19 08:04:14,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504524886877828 [2023-11-19 08:04:14,109 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 446 transitions. [2023-11-19 08:04:14,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 446 transitions. [2023-11-19 08:04:14,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:14,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 446 transitions. [2023-11-19 08:04:14,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.0) internal successors, (446), 2 states have internal predecessors, (446), 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) [2023-11-19 08:04:14,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 442.0) internal successors, (1326), 3 states have internal predecessors, (1326), 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) [2023-11-19 08:04:14,114 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 442.0) internal successors, (1326), 3 states have internal predecessors, (1326), 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) [2023-11-19 08:04:14,115 INFO L175 Difference]: Start difference. First operand has 94 places, 96 transitions, 210 flow. Second operand 2 states and 446 transitions. [2023-11-19 08:04:14,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 242 flow [2023-11-19 08:04:14,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 240 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:14,121 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 176 flow [2023-11-19 08:04:14,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=176, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2023-11-19 08:04:14,123 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -12 predicate places. [2023-11-19 08:04:14,123 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 176 flow [2023-11-19 08:04:14,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 202.0) internal successors, (404), 2 states have internal predecessors, (404), 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) [2023-11-19 08:04:14,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:14,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:14,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:04:14,124 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-19 08:04:14,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash 171460287, now seen corresponding path program 1 times [2023-11-19 08:04:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392592891] [2023-11-19 08:04:14,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:14,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:14,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392592891] [2023-11-19 08:04:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392592891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:14,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:14,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152172883] [2023-11-19 08:04:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:14,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:14,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:14,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 442 [2023-11-19 08:04:14,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 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) [2023-11-19 08:04:14,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:14,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 442 [2023-11-19 08:04:14,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:16,324 INFO L124 PetriNetUnfolderBase]: 5671/10995 cut-off events. [2023-11-19 08:04:16,324 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2023-11-19 08:04:16,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19096 conditions, 10995 events. 5671/10995 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 91613 event pairs, 1191 based on Foata normal form. 0/9377 useless extension candidates. Maximal degree in co-relation 19090. Up to 3497 conditions per place. [2023-11-19 08:04:16,450 INFO L140 encePairwiseOnDemand]: 436/442 looper letters, 115 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2023-11-19 08:04:16,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 163 transitions, 622 flow [2023-11-19 08:04:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1243 transitions. [2023-11-19 08:04:16,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687028657616893 [2023-11-19 08:04:16,457 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1243 transitions. [2023-11-19 08:04:16,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1243 transitions. [2023-11-19 08:04:16,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:16,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1243 transitions. [2023-11-19 08:04:16,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.16666666666666) internal successors, (1243), 6 states have internal predecessors, (1243), 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) [2023-11-19 08:04:16,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 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) [2023-11-19 08:04:16,473 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 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) [2023-11-19 08:04:16,473 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 176 flow. Second operand 6 states and 1243 transitions. [2023-11-19 08:04:16,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 163 transitions, 622 flow [2023-11-19 08:04:16,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 163 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:16,480 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 184 flow [2023-11-19 08:04:16,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2023-11-19 08:04:16,484 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -8 predicate places. [2023-11-19 08:04:16,484 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 184 flow [2023-11-19 08:04:16,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 6 states have internal predecessors, (1132), 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) [2023-11-19 08:04:16,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:16,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:16,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:04:16,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-19 08:04:16,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1262077326, now seen corresponding path program 1 times [2023-11-19 08:04:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:16,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223534255] [2023-11-19 08:04:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:16,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223534255] [2023-11-19 08:04:16,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223534255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:16,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679129164] [2023-11-19 08:04:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:16,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:16,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:16,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:16,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 442 [2023-11-19 08:04:16,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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) [2023-11-19 08:04:16,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:16,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 442 [2023-11-19 08:04:16,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:21,267 INFO L124 PetriNetUnfolderBase]: 24519/40244 cut-off events. [2023-11-19 08:04:21,267 INFO L125 PetriNetUnfolderBase]: For 1430/1430 co-relation queries the response was YES. [2023-11-19 08:04:21,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77279 conditions, 40244 events. 24519/40244 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 324655 event pairs, 8046 based on Foata normal form. 0/36061 useless extension candidates. Maximal degree in co-relation 77272. Up to 22183 conditions per place. [2023-11-19 08:04:21,709 INFO L140 encePairwiseOnDemand]: 421/442 looper letters, 77 selfloop transitions, 15 changer transitions 0/121 dead transitions. [2023-11-19 08:04:21,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 121 transitions, 464 flow [2023-11-19 08:04:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2023-11-19 08:04:21,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766214177978884 [2023-11-19 08:04:21,713 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 632 transitions. [2023-11-19 08:04:21,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 632 transitions. [2023-11-19 08:04:21,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:21,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 632 transitions. [2023-11-19 08:04:21,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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) [2023-11-19 08:04:21,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 442.0) internal successors, (1768), 4 states have internal predecessors, (1768), 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) [2023-11-19 08:04:21,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 442.0) internal successors, (1768), 4 states have internal predecessors, (1768), 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) [2023-11-19 08:04:21,721 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 184 flow. Second operand 3 states and 632 transitions. [2023-11-19 08:04:21,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 121 transitions, 464 flow [2023-11-19 08:04:21,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-19 08:04:21,782 INFO L231 Difference]: Finished difference. Result has 85 places, 94 transitions, 306 flow [2023-11-19 08:04:21,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=85, PETRI_TRANSITIONS=94} [2023-11-19 08:04:21,785 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -9 predicate places. [2023-11-19 08:04:21,786 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 94 transitions, 306 flow [2023-11-19 08:04:21,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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) [2023-11-19 08:04:21,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:21,786 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:21,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:04:21,787 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-19 08:04:21,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:21,787 INFO L85 PathProgramCache]: Analyzing trace with hash 94730216, now seen corresponding path program 1 times [2023-11-19 08:04:21,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:21,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695422484] [2023-11-19 08:04:21,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:21,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 08:04:22,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695422484] [2023-11-19 08:04:22,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695422484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:22,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:22,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051135850] [2023-11-19 08:04:22,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:22,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:22,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:22,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:22,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:22,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 442 [2023-11-19 08:04:22,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 94 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 188.83333333333334) internal successors, (1133), 6 states have internal predecessors, (1133), 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) [2023-11-19 08:04:22,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:22,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 442 [2023-11-19 08:04:22,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:25,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:25,956 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-19 08:04:25,956 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:04:25,956 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-19 08:04:25,956 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-19 08:04:26,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 93#thr1EXITtrue, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,245 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-19 08:04:26,245 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:04:26,245 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:04:26,245 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:04:26,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 4#L706-1true, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,246 INFO L294 olderBase$Statistics]: this new event has 54 ancestors and is cut-off event [2023-11-19 08:04:26,246 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:04:26,246 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-19 08:04:26,246 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:04:26,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 142#L705-6true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,247 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-19 08:04:26,247 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:04:26,247 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:04:26,247 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-19 08:04:26,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 110#L709-3true, 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,251 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-19 08:04:26,251 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:04:26,251 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:04:26,251 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:04:26,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,309 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-19 08:04:26,309 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-19 08:04:26,309 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2023-11-19 08:04:26,310 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2023-11-19 08:04:26,447 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][132], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 7#L706-2true, 131#L725-5true, 19#L713true, 246#(= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0), 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,447 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:04:26,447 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:04:26,447 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-19 08:04:26,448 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:04:26,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 93#thr1EXITtrue, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,488 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-19 08:04:26,488 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,488 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:04:26,488 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, 4#L706-1true, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,489 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-19 08:04:26,489 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:04:26,489 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,489 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 142#L705-6true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,489 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-19 08:04:26,489 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:04:26,490 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:04:26,490 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:04:26,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 110#L709-3true, 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,492 INFO L294 olderBase$Statistics]: this new event has 55 ancestors and is cut-off event [2023-11-19 08:04:26,492 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-19 08:04:26,493 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-19 08:04:26,493 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2023-11-19 08:04:26,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][131], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 247#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0)), 240#(= |#race~max~0| 0), 85#L713true, 131#L725-5true, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse, 92#L706-3true]) [2023-11-19 08:04:26,546 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-19 08:04:26,546 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:04:26,546 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-19 08:04:26,547 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:04:26,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][130], [thr1Thread2of3ForFork0InUse, 248#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 131#L725-5true, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse, 23#L706-4true]) [2023-11-19 08:04:26,652 INFO L294 olderBase$Statistics]: this new event has 57 ancestors and is cut-off event [2023-11-19 08:04:26,653 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:04:26,653 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-19 08:04:26,653 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][132], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 7#L706-2true, 19#L713true, 246#(= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0), 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,689 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-19 08:04:26,689 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:04:26,689 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:04:26,689 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:04:26,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 126#L706-7true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,725 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-11-19 08:04:26,725 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:04:26,726 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:04:26,726 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:04:26,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 3#L706-5true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,734 INFO L294 olderBase$Statistics]: this new event has 58 ancestors and is cut-off event [2023-11-19 08:04:26,735 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:04:26,735 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:04:26,735 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-19 08:04:26,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][131], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 247#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0)), 240#(= |#race~max~0| 0), 85#L713true, 19#L713true, 228#true, 92#L706-3true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,769 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-11-19 08:04:26,769 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:04:26,770 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:04:26,770 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:04:26,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 175#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 174#L707-1true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,798 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-11-19 08:04:26,799 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:04:26,799 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,799 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:04:26,805 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, 115#L706-7true, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,805 INFO L294 olderBase$Statistics]: this new event has 59 ancestors and is cut-off event [2023-11-19 08:04:26,805 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:04:26,805 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-19 08:04:26,806 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:04:26,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][130], [thr1Thread2of3ForFork0InUse, 248#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 19#L713true, 228#true, thr1Thread1of3ForFork0InUse, 23#L706-4true]) [2023-11-19 08:04:26,837 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-11-19 08:04:26,837 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:04:26,838 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,838 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [5#L707-1true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 240#(= |#race~max~0| 0), 85#L713true, 131#L725-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,859 INFO L294 olderBase$Statistics]: this new event has 60 ancestors and is cut-off event [2023-11-19 08:04:26,859 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,860 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-19 08:04:26,860 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:04:26,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 126#L706-7true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,876 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-11-19 08:04:26,876 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:04:26,876 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:04:26,876 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:04:26,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 3#L706-5true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,882 INFO L294 olderBase$Statistics]: this new event has 61 ancestors and is cut-off event [2023-11-19 08:04:26,882 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-19 08:04:26,882 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:04:26,882 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-19 08:04:26,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 175#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, 174#L707-1true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,916 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-11-19 08:04:26,916 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:04:26,916 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:04:26,916 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:04:26,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, 115#L706-7true, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,920 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2023-11-19 08:04:26,920 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-19 08:04:26,921 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:04:26,921 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-19 08:04:26,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1032] L709-3-->L713: Formula: (and (not (= (ite (= v_~m~0_67 1) 1 0) 0)) (= v_~m~0_66 0)) InVars {~m~0=v_~m~0_67} OutVars{thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1=|v_thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1_5|, ~m~0=v_~m~0_66, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1_17|, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1=|v_thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1_13|, #race~m~0=|v_#race~m~0_85|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0___VERIFIER_atomic_release_#t~nondet4#1, ~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_~cond#1, #race~m~0, thr1Thread3of3ForFork0_assume_abort_if_not_#in~cond#1][139], [thr1Thread2of3ForFork0InUse, 5#L707-1true, thr1Thread3of3ForFork0InUse, Black: 238#true, 83#L725-4true, 240#(= |#race~max~0| 0), 85#L713true, 249#(and (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 3 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4) 1)) 0) (= (select (select |#race| |~#storage~0.base|) (+ |~#storage~0.offset| 2 (* |thr1Thread2of3ForFork0_findMax_~i~0#1| 4))) 0)), 19#L713true, 228#true, thr1Thread1of3ForFork0InUse]) [2023-11-19 08:04:26,958 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2023-11-19 08:04:26,959 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:04:26,959 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-19 08:04:26,959 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2023-11-19 08:04:27,233 INFO L124 PetriNetUnfolderBase]: 21956/38205 cut-off events. [2023-11-19 08:04:27,233 INFO L125 PetriNetUnfolderBase]: For 9227/9889 co-relation queries the response was YES. [2023-11-19 08:04:27,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79321 conditions, 38205 events. 21956/38205 cut-off events. For 9227/9889 co-relation queries the response was YES. Maximal size of possible extension queue 1135. Compared 330812 event pairs, 4557 based on Foata normal form. 116/33930 useless extension candidates. Maximal degree in co-relation 79313. Up to 14765 conditions per place. [2023-11-19 08:04:27,559 INFO L140 encePairwiseOnDemand]: 436/442 looper letters, 122 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2023-11-19 08:04:27,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 181 transitions, 802 flow [2023-11-19 08:04:27,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1239 transitions. [2023-11-19 08:04:27,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671945701357466 [2023-11-19 08:04:27,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1239 transitions. [2023-11-19 08:04:27,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1239 transitions. [2023-11-19 08:04:27,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:27,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1239 transitions. [2023-11-19 08:04:27,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 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) [2023-11-19 08:04:27,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 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) [2023-11-19 08:04:27,579 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 442.0) internal successors, (3094), 7 states have internal predecessors, (3094), 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) [2023-11-19 08:04:27,579 INFO L175 Difference]: Start difference. First operand has 85 places, 94 transitions, 306 flow. Second operand 6 states and 1239 transitions. [2023-11-19 08:04:27,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 181 transitions, 802 flow [2023-11-19 08:04:27,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 181 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:04:27,681 INFO L231 Difference]: Finished difference. Result has 87 places, 93 transitions, 284 flow [2023-11-19 08:04:27,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=442, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=87, PETRI_TRANSITIONS=93} [2023-11-19 08:04:27,683 INFO L281 CegarLoopForPetriNet]: 94 programPoint places, -7 predicate places. [2023-11-19 08:04:27,683 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 93 transitions, 284 flow [2023-11-19 08:04:27,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.83333333333334) internal successors, (1133), 6 states have internal predecessors, (1133), 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) [2023-11-19 08:04:27,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:27,685 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-19 08:04:27,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:04:27,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-11-19 08:04:27,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash 580603578, now seen corresponding path program 1 times [2023-11-19 08:04:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407863475] [2023-11-19 08:04:27,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:27,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:27,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:04:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:04:27,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:04:27,727 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:04:27,728 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2023-11-19 08:04:27,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2023-11-19 08:04:27,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2023-11-19 08:04:27,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2023-11-19 08:04:27,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2023-11-19 08:04:27,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2023-11-19 08:04:27,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2023-11-19 08:04:27,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2023-11-19 08:04:27,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2023-11-19 08:04:27,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2023-11-19 08:04:27,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2023-11-19 08:04:27,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2023-11-19 08:04:27,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2023-11-19 08:04:27,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2023-11-19 08:04:27,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2023-11-19 08:04:27,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2023-11-19 08:04:27,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2023-11-19 08:04:27,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2023-11-19 08:04:27,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2023-11-19 08:04:27,731 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2023-11-19 08:04:27,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2023-11-19 08:04:27,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2023-11-19 08:04:27,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2023-11-19 08:04:27,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2023-11-19 08:04:27,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2023-11-19 08:04:27,732 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2023-11-19 08:04:27,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2023-11-19 08:04:27,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2023-11-19 08:04:27,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2023-11-19 08:04:27,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2023-11-19 08:04:27,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2023-11-19 08:04:27,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2023-11-19 08:04:27,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2023-11-19 08:04:27,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:04:27,734 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-19 08:04:27,735 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-19 08:04:27,735 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-19 08:04:27,787 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:04:27,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 305 transitions, 638 flow [2023-11-19 08:04:27,860 INFO L124 PetriNetUnfolderBase]: 29/355 cut-off events. [2023-11-19 08:04:27,860 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 08:04:27,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 355 events. 29/355 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1188 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 282. Up to 10 conditions per place. [2023-11-19 08:04:27,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 289 places, 305 transitions, 638 flow [2023-11-19 08:04:27,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 289 places, 305 transitions, 638 flow [2023-11-19 08:04:27,873 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:04:27,874 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 289 places, 305 transitions, 638 flow [2023-11-19 08:04:27,874 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 289 places, 305 transitions, 638 flow [2023-11-19 08:04:27,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 289 places, 305 transitions, 638 flow [2023-11-19 08:04:27,940 INFO L124 PetriNetUnfolderBase]: 29/355 cut-off events. [2023-11-19 08:04:27,940 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-19 08:04:27,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 355 events. 29/355 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1188 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 282. Up to 10 conditions per place. [2023-11-19 08:04:27,970 INFO L119 LiptonReduction]: Number of co-enabled transitions 62176 [2023-11-19 08:04:32,055 INFO L134 LiptonReduction]: Checked pairs total: 204173 [2023-11-19 08:04:32,056 INFO L136 LiptonReduction]: Total number of compositions: 249 [2023-11-19 08:04:32,057 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:32,058 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@5dc15139, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:32,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-19 08:04:32,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:04:32,062 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-11-19 08:04:32,062 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:04:32,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:32,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:32,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-19 08:04:32,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:32,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1818905280, now seen corresponding path program 1 times [2023-11-19 08:04:32,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:32,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107373115] [2023-11-19 08:04:32,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:32,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:32,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107373115] [2023-11-19 08:04:32,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107373115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:32,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:32,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:04:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264548323] [2023-11-19 08:04:32,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:32,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:04:32,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:32,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:04:32,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:04:32,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 554 [2023-11-19 08:04:32,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 126 transitions, 280 flow. Second operand has 2 states, 2 states have (on average 258.0) internal successors, (516), 2 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) [2023-11-19 08:04:32,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:32,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 554 [2023-11-19 08:04:32,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:41,189 INFO L124 PetriNetUnfolderBase]: 48232/88538 cut-off events. [2023-11-19 08:04:41,189 INFO L125 PetriNetUnfolderBase]: For 7635/7635 co-relation queries the response was YES. [2023-11-19 08:04:41,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152538 conditions, 88538 events. 48232/88538 cut-off events. For 7635/7635 co-relation queries the response was YES. Maximal size of possible extension queue 2863. Compared 914578 event pairs, 36580 based on Foata normal form. 10747/83013 useless extension candidates. Maximal degree in co-relation 13952. Up to 60637 conditions per place. [2023-11-19 08:04:42,132 INFO L140 encePairwiseOnDemand]: 533/554 looper letters, 42 selfloop transitions, 0 changer transitions 0/105 dead transitions. [2023-11-19 08:04:42,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 322 flow [2023-11-19 08:04:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:04:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:04:42,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 573 transitions. [2023-11-19 08:04:42,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171480144404332 [2023-11-19 08:04:42,136 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 573 transitions. [2023-11-19 08:04:42,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 573 transitions. [2023-11-19 08:04:42,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:42,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 573 transitions. [2023-11-19 08:04:42,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 286.5) internal successors, (573), 2 states have internal predecessors, (573), 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) [2023-11-19 08:04:42,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 554.0) internal successors, (1662), 3 states have internal predecessors, (1662), 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) [2023-11-19 08:04:42,143 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 554.0) internal successors, (1662), 3 states have internal predecessors, (1662), 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) [2023-11-19 08:04:42,143 INFO L175 Difference]: Start difference. First operand has 123 places, 126 transitions, 280 flow. Second operand 2 states and 573 transitions. [2023-11-19 08:04:42,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 322 flow [2023-11-19 08:04:42,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 316 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-19 08:04:42,157 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 232 flow [2023-11-19 08:04:42,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=232, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2023-11-19 08:04:42,158 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -16 predicate places. [2023-11-19 08:04:42,158 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 232 flow [2023-11-19 08:04:42,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 258.0) internal successors, (516), 2 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) [2023-11-19 08:04:42,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:42,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:42,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:04:42,159 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 37 more)] === [2023-11-19 08:04:42,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -551496657, now seen corresponding path program 1 times [2023-11-19 08:04:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783627061] [2023-11-19 08:04:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:42,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:42,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783627061] [2023-11-19 08:04:42,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783627061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:42,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:42,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:04:42,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096676933] [2023-11-19 08:04:42,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:42,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:42,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:42,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:42,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 554 [2023-11-19 08:04:42,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 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) [2023-11-19 08:04:42,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:42,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 554 [2023-11-19 08:04:42,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand