./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version 6497de01
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb
--- Real Ultimate output ---
This is Ultimate 0.3.0-dev-6497de0
[2024-11-24 01:14:26,800 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-24 01:14:26,882 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-11-24 01:14:26,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-24 01:14:26,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-24 01:14:26,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-24 01:14:26,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-24 01:14:26,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-24 01:14:26,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-24 01:14:26,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-24 01:14:26,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-24 01:14:26,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-24 01:14:26,931 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-24 01:14:26,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-24 01:14:26,931 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-24 01:14:26,931 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-24 01:14:26,931 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-24 01:14:26,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-24 01:14:26,933 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2024-11-24 01:14:26,933 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-24 01:14:26,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-24 01:14:26,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:14:26,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:14:26,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:14:26,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-24 01:14:26,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-24 01:14:26,933 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-24 01:14:26,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:14:26,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-24 01:14:26,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-24 01:14:26,937 INFO L153 SettingsManager]: * Compute procedure contracts=false
[2024-11-24 01:14:26,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-24 01:14:26,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-24 01:14:26,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-24 01:14:26,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-24 01:14:26,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-24 01:14:26,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-24 01:14:26,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-24 01:14:26,938 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc2bc8e2b738274330116922d0213f314e2f92c105156edd0131038d71009ecb
[2024-11-24 01:14:27,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-24 01:14:27,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-24 01:14:27,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-24 01:14:27,263 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-24 01:14:27,263 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-24 01:14:27,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i
[2024-11-24 01:14:30,279 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/data/8fc4977cf/31662c9f7a894bf49c9013b8d44b1734/FLAG535e9adf9
[2024-11-24 01:14:30,610 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-24 01:14:30,610 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/sv-benchmarks/c/pthread-race-challenges/thread-join-counter-outer-race-4.i
[2024-11-24 01:14:30,629 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/data/8fc4977cf/31662c9f7a894bf49c9013b8d44b1734/FLAG535e9adf9
[2024-11-24 01:14:30,839 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/data/8fc4977cf/31662c9f7a894bf49c9013b8d44b1734
[2024-11-24 01:14:30,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-24 01:14:30,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-24 01:14:30,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-24 01:14:30,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-24 01:14:30,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-24 01:14:30,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:14:30" (1/1) ...
[2024-11-24 01:14:30,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24aaf659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:30, skipping insertion in model container
[2024-11-24 01:14:30,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:14:30" (1/1) ...
[2024-11-24 01:14:30,880 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-24 01:14:31,284 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:14:31,324 INFO L200 MainTranslator]: Completed pre-run
[2024-11-24 01:14:31,391 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-24 01:14:31,450 INFO L204 MainTranslator]: Completed translation
[2024-11-24 01:14:31,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31 WrapperNode
[2024-11-24 01:14:31,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-24 01:14:31,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-24 01:14:31,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-24 01:14:31,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-24 01:14:31,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,502 INFO L138 Inliner]: procedures = 159, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196
[2024-11-24 01:14:31,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-24 01:14:31,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-24 01:14:31,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-24 01:14:31,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-24 01:14:31,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,520 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-24 01:14:31,556 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-24 01:14:31,556 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-24 01:14:31,556 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-24 01:14:31,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (1/1) ...
[2024-11-24 01:14:31,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-24 01:14:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/z3
[2024-11-24 01:14:31,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-24 01:14:31,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_07677cc4-1e94-4736-856b-13ac9855e8f7/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-24 01:14:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-11-24 01:14:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-24 01:14:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-11-24 01:14:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread
[2024-11-24 01:14:31,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread
[2024-11-24 01:14:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-11-24 01:14:31,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-24 01:14:31,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-24 01:14:31,635 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-24 01:14:31,801 INFO L234 CfgBuilder]: Building ICFG
[2024-11-24 01:14:31,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-24 01:14:32,189 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-24 01:14:32,189 INFO L283 CfgBuilder]: Performing block encoding
[2024-11-24 01:14:32,252 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-24 01:14:32,253 INFO L312 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-24 01:14:32,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:14:32 BoogieIcfgContainer
[2024-11-24 01:14:32,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-24 01:14:32,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-24 01:14:32,257 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-24 01:14:32,264 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-24 01:14:32,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:14:30" (1/3) ...
[2024-11-24 01:14:32,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12add8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:14:32, skipping insertion in model container
[2024-11-24 01:14:32,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:14:31" (2/3) ...
[2024-11-24 01:14:32,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12add8b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:14:32, skipping insertion in model container
[2024-11-24 01:14:32,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:14:32" (3/3) ...
[2024-11-24 01:14:32,267 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i
[2024-11-24 01:14:32,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-24 01:14:32,286 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-counter-outer-race-4.i that has 2 procedures, 228 locations, 1 initial locations, 2 loop locations, and 7 error locations.
[2024-11-24 01:14:32,287 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-24 01:14:32,379 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 01:14:32,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 232 transitions, 468 flow
[2024-11-24 01:14:32,633 INFO L124 PetriNetUnfolderBase]: 7/274 cut-off events.
[2024-11-24 01:14:32,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:14:32,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 274 events. 7/274 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 238 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 193. Up to 4 conditions per place.
[2024-11-24 01:14:32,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 232 transitions, 468 flow
[2024-11-24 01:14:32,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 232 transitions, 468 flow
[2024-11-24 01:14:32,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:14:32,685 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70ad9213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:14:32,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations.
[2024-11-24 01:14:32,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:14:32,736 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events.
[2024-11-24 01:14:32,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:14:32,738 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:32,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:32,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-11-24 01:14:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2028486066, now seen corresponding path program 1 times
[2024-11-24 01:14:32,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101725165]
[2024-11-24 01:14:32,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:32,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:33,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101725165]
[2024-11-24 01:14:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101725165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:33,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:33,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:33,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978071159]
[2024-11-24 01:14:33,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:33,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:33,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:33,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:33,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232
[2024-11-24 01:14:33,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 232 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:33,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:33,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232
[2024-11-24 01:14:33,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:33,752 INFO L124 PetriNetUnfolderBase]: 98/684 cut-off events.
[2024-11-24 01:14:33,752 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-11-24 01:14:33,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 684 events. 98/684 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3145 event pairs, 33 based on Foata normal form. 9/637 useless extension candidates. Maximal degree in co-relation 707. Up to 138 conditions per place.
[2024-11-24 01:14:33,762 INFO L140 encePairwiseOnDemand]: 218/232 looper letters, 32 selfloop transitions, 8 changer transitions 1/247 dead transitions.
[2024-11-24 01:14:33,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 247 transitions, 578 flow
[2024-11-24 01:14:33,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions.
[2024-11-24 01:14:33,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9612068965517241
[2024-11-24 01:14:33,784 INFO L175 Difference]: Start difference. First operand has 231 places, 232 transitions, 468 flow. Second operand 3 states and 669 transitions.
[2024-11-24 01:14:33,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 247 transitions, 578 flow
[2024-11-24 01:14:33,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 247 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-11-24 01:14:33,806 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 530 flow
[2024-11-24 01:14:33,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=235, PETRI_TRANSITIONS=236}
[2024-11-24 01:14:33,815 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 4 predicate places.
[2024-11-24 01:14:33,815 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 530 flow
[2024-11-24 01:14:33,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:33,817 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:33,817 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:33,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-24 01:14:33,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-11-24 01:14:33,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash 939832752, now seen corresponding path program 1 times
[2024-11-24 01:14:33,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:33,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917549422]
[2024-11-24 01:14:33,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:33,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:34,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917549422]
[2024-11-24 01:14:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917549422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:34,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:34,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:34,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260873371]
[2024-11-24 01:14:34,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:34,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:34,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:34,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:34,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 232
[2024-11-24 01:14:34,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:34,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:34,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 232
[2024-11-24 01:14:34,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:34,368 INFO L124 PetriNetUnfolderBase]: 114/812 cut-off events.
[2024-11-24 01:14:34,369 INFO L125 PetriNetUnfolderBase]: For 164/171 co-relation queries the response was YES.
[2024-11-24 01:14:34,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 812 events. 114/812 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4196 event pairs, 72 based on Foata normal form. 5/762 useless extension candidates. Maximal degree in co-relation 1025. Up to 226 conditions per place.
[2024-11-24 01:14:34,375 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 29 selfloop transitions, 7 changer transitions 0/245 dead transitions.
[2024-11-24 01:14:34,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 245 transitions, 630 flow
[2024-11-24 01:14:34,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions.
[2024-11-24 01:14:34,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9367816091954023
[2024-11-24 01:14:34,378 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 530 flow. Second operand 3 states and 652 transitions.
[2024-11-24 01:14:34,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 245 transitions, 630 flow
[2024-11-24 01:14:34,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:34,394 INFO L231 Difference]: Finished difference. Result has 236 places, 241 transitions, 570 flow
[2024-11-24 01:14:34,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=236, PETRI_TRANSITIONS=241}
[2024-11-24 01:14:34,398 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 5 predicate places.
[2024-11-24 01:14:34,398 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 241 transitions, 570 flow
[2024-11-24 01:14:34,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:34,398 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:34,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:34,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-24 01:14:34,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-11-24 01:14:34,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:34,400 INFO L85 PathProgramCache]: Analyzing trace with hash -883348309, now seen corresponding path program 1 times
[2024-11-24 01:14:34,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:34,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035829116]
[2024-11-24 01:14:34,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:34,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:34,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:34,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035829116]
[2024-11-24 01:14:34,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035829116] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:34,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:34,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:34,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575922800]
[2024-11-24 01:14:34,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:34,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:34,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:34,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:34,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:34,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 232
[2024-11-24 01:14:34,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 241 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:34,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:34,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 232
[2024-11-24 01:14:34,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:34,801 INFO L124 PetriNetUnfolderBase]: 83/734 cut-off events.
[2024-11-24 01:14:34,801 INFO L125 PetriNetUnfolderBase]: For 64/67 co-relation queries the response was YES.
[2024-11-24 01:14:34,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 734 events. 83/734 cut-off events. For 64/67 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3728 event pairs, 45 based on Foata normal form. 0/674 useless extension candidates. Maximal degree in co-relation 838. Up to 114 conditions per place.
[2024-11-24 01:14:34,805 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 17 selfloop transitions, 3 changer transitions 1/247 dead transitions.
[2024-11-24 01:14:34,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 247 transitions, 624 flow
[2024-11-24 01:14:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions.
[2024-11-24 01:14:34,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540229885057471
[2024-11-24 01:14:34,808 INFO L175 Difference]: Start difference. First operand has 236 places, 241 transitions, 570 flow. Second operand 3 states and 664 transitions.
[2024-11-24 01:14:34,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 247 transitions, 624 flow
[2024-11-24 01:14:34,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 247 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:34,816 INFO L231 Difference]: Finished difference. Result has 238 places, 243 transitions, 578 flow
[2024-11-24 01:14:34,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=238, PETRI_TRANSITIONS=243}
[2024-11-24 01:14:34,817 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 7 predicate places.
[2024-11-24 01:14:34,817 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 243 transitions, 578 flow
[2024-11-24 01:14:34,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:34,818 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:34,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:34,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-24 01:14:34,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-11-24 01:14:34,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1752848521, now seen corresponding path program 1 times
[2024-11-24 01:14:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709300671]
[2024-11-24 01:14:34,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:35,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:35,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709300671]
[2024-11-24 01:14:35,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709300671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:35,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:35,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:35,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26351755]
[2024-11-24 01:14:35,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:35,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:35,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:35,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:35,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 232
[2024-11-24 01:14:35,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 243 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:35,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:35,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 232
[2024-11-24 01:14:35,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:35,253 INFO L124 PetriNetUnfolderBase]: 92/747 cut-off events.
[2024-11-24 01:14:35,253 INFO L125 PetriNetUnfolderBase]: For 73/77 co-relation queries the response was YES.
[2024-11-24 01:14:35,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 747 events. 92/747 cut-off events. For 73/77 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3972 event pairs, 54 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 914. Up to 141 conditions per place.
[2024-11-24 01:14:35,256 INFO L140 encePairwiseOnDemand]: 227/232 looper letters, 22 selfloop transitions, 5 changer transitions 0/252 dead transitions.
[2024-11-24 01:14:35,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 252 transitions, 654 flow
[2024-11-24 01:14:35,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions.
[2024-11-24 01:14:35,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525862068965517
[2024-11-24 01:14:35,260 INFO L175 Difference]: Start difference. First operand has 238 places, 243 transitions, 578 flow. Second operand 3 states and 663 transitions.
[2024-11-24 01:14:35,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 252 transitions, 654 flow
[2024-11-24 01:14:35,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 252 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:35,268 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 608 flow
[2024-11-24 01:14:35,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=240, PETRI_TRANSITIONS=246}
[2024-11-24 01:14:35,270 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 9 predicate places.
[2024-11-24 01:14:35,270 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 608 flow
[2024-11-24 01:14:35,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:35,271 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:35,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:35,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-24 01:14:35,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-11-24 01:14:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1043531951, now seen corresponding path program 1 times
[2024-11-24 01:14:35,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618611677]
[2024-11-24 01:14:35,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:35,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:35,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618611677]
[2024-11-24 01:14:35,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618611677] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:35,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:35,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:35,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401809194]
[2024-11-24 01:14:35,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:35,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:35,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:35,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:35,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:35,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232
[2024-11-24 01:14:35,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:35,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:35,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232
[2024-11-24 01:14:35,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:35,674 INFO L124 PetriNetUnfolderBase]: 159/927 cut-off events.
[2024-11-24 01:14:35,675 INFO L125 PetriNetUnfolderBase]: For 211/217 co-relation queries the response was YES.
[2024-11-24 01:14:35,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1610 conditions, 927 events. 159/927 cut-off events. For 211/217 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5171 event pairs, 73 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1385. Up to 275 conditions per place.
[2024-11-24 01:14:35,680 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 11 changer transitions 4/259 dead transitions.
[2024-11-24 01:14:35,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 259 transitions, 730 flow
[2024-11-24 01:14:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions.
[2024-11-24 01:14:35,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468390804597702
[2024-11-24 01:14:35,683 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 608 flow. Second operand 3 states and 659 transitions.
[2024-11-24 01:14:35,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 259 transitions, 730 flow
[2024-11-24 01:14:35,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:35,694 INFO L231 Difference]: Finished difference. Result has 242 places, 250 transitions, 674 flow
[2024-11-24 01:14:35,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=242, PETRI_TRANSITIONS=250}
[2024-11-24 01:14:35,697 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places.
[2024-11-24 01:14:35,698 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 250 transitions, 674 flow
[2024-11-24 01:14:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:35,699 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:35,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:35,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-24 01:14:35,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-11-24 01:14:35,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -444218418, now seen corresponding path program 1 times
[2024-11-24 01:14:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887208555]
[2024-11-24 01:14:35,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:36,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887208555]
[2024-11-24 01:14:36,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887208555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:36,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:36,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:14:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107895692]
[2024-11-24 01:14:36,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:36,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:14:36,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:36,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:14:36,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:14:36,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 232
[2024-11-24 01:14:36,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 250 transitions, 674 flow. Second operand has 5 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:36,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:36,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 232
[2024-11-24 01:14:36,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:36,355 INFO L124 PetriNetUnfolderBase]: 142/853 cut-off events.
[2024-11-24 01:14:36,355 INFO L125 PetriNetUnfolderBase]: For 276/280 co-relation queries the response was YES.
[2024-11-24 01:14:36,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 853 events. 142/853 cut-off events. For 276/280 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4477 event pairs, 39 based on Foata normal form. 2/811 useless extension candidates. Maximal degree in co-relation 1306. Up to 140 conditions per place.
[2024-11-24 01:14:36,361 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 29 selfloop transitions, 7 changer transitions 3/265 dead transitions.
[2024-11-24 01:14:36,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 265 transitions, 770 flow
[2024-11-24 01:14:36,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:14:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:14:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions.
[2024-11-24 01:14:36,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.930316091954023
[2024-11-24 01:14:36,366 INFO L175 Difference]: Start difference. First operand has 242 places, 250 transitions, 674 flow. Second operand 6 states and 1295 transitions.
[2024-11-24 01:14:36,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 265 transitions, 770 flow
[2024-11-24 01:14:36,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 265 transitions, 734 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-11-24 01:14:36,373 INFO L231 Difference]: Finished difference. Result has 242 places, 251 transitions, 660 flow
[2024-11-24 01:14:36,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=242, PETRI_TRANSITIONS=251}
[2024-11-24 01:14:36,376 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 11 predicate places.
[2024-11-24 01:14:36,377 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 251 transitions, 660 flow
[2024-11-24 01:14:36,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:36,378 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:36,378 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:36,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-24 01:14:36,378 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 8 more)] ===
[2024-11-24 01:14:36,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:36,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1102976817, now seen corresponding path program 1 times
[2024-11-24 01:14:36,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030266063]
[2024-11-24 01:14:36,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:14:36,444 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 01:14:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:14:36,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 01:14:36,582 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 01:14:36,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining)
[2024-11-24 01:14:36,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining)
[2024-11-24 01:14:36,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining)
[2024-11-24 01:14:36,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining)
[2024-11-24 01:14:36,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining)
[2024-11-24 01:14:36,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining)
[2024-11-24 01:14:36,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining)
[2024-11-24 01:14:36,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining)
[2024-11-24 01:14:36,587 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining)
[2024-11-24 01:14:36,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining)
[2024-11-24 01:14:36,588 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining)
[2024-11-24 01:14:36,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-24 01:14:36,588 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:36,595 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-11-24 01:14:36,595 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-11-24 01:14:36,647 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 01:14:36,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 534 flow
[2024-11-24 01:14:36,716 INFO L124 PetriNetUnfolderBase]: 10/354 cut-off events.
[2024-11-24 01:14:36,716 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES.
[2024-11-24 01:14:36,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 354 events. 10/354 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 408 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 275. Up to 6 conditions per place.
[2024-11-24 01:14:36,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 534 flow
[2024-11-24 01:14:36,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 262 transitions, 534 flow
[2024-11-24 01:14:36,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:14:36,723 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70ad9213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:14:36,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations.
[2024-11-24 01:14:36,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:14:36,742 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events.
[2024-11-24 01:14:36,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:14:36,742 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:36,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:36,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:36,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:36,743 INFO L85 PathProgramCache]: Analyzing trace with hash -544245902, now seen corresponding path program 1 times
[2024-11-24 01:14:36,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:36,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932902109]
[2024-11-24 01:14:36,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:36,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932902109]
[2024-11-24 01:14:36,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932902109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:36,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:36,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142735271]
[2024-11-24 01:14:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:36,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:36,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:36,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:36,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 262
[2024-11-24 01:14:36,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 262 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:36,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:36,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 262
[2024-11-24 01:14:36,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:38,353 INFO L124 PetriNetUnfolderBase]: 2216/6761 cut-off events.
[2024-11-24 01:14:38,353 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES.
[2024-11-24 01:14:38,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 6761 events. 2216/6761 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 63708 event pairs, 879 based on Foata normal form. 92/6148 useless extension candidates. Maximal degree in co-relation 8872. Up to 2089 conditions per place.
[2024-11-24 01:14:38,399 INFO L140 encePairwiseOnDemand]: 244/262 looper letters, 46 selfloop transitions, 11 changer transitions 1/285 dead transitions.
[2024-11-24 01:14:38,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 285 transitions, 699 flow
[2024-11-24 01:14:38,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions.
[2024-11-24 01:14:38,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541984732824428
[2024-11-24 01:14:38,402 INFO L175 Difference]: Start difference. First operand has 263 places, 262 transitions, 534 flow. Second operand 3 states and 750 transitions.
[2024-11-24 01:14:38,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 285 transitions, 699 flow
[2024-11-24 01:14:38,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 285 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-11-24 01:14:38,407 INFO L231 Difference]: Finished difference. Result has 267 places, 269 transitions, 622 flow
[2024-11-24 01:14:38,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=267, PETRI_TRANSITIONS=269}
[2024-11-24 01:14:38,408 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 4 predicate places.
[2024-11-24 01:14:38,408 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 269 transitions, 622 flow
[2024-11-24 01:14:38,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:38,409 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:38,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:38,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-24 01:14:38,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:38,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2088940406, now seen corresponding path program 1 times
[2024-11-24 01:14:38,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:38,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095149902]
[2024-11-24 01:14:38,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:38,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:38,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095149902]
[2024-11-24 01:14:38,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095149902] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:38,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:38,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:38,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298079164]
[2024-11-24 01:14:38,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:38,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:38,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:38,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:38,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 262
[2024-11-24 01:14:38,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 269 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:38,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:38,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 262
[2024-11-24 01:14:38,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:40,565 INFO L124 PetriNetUnfolderBase]: 2480/8562 cut-off events.
[2024-11-24 01:14:40,565 INFO L125 PetriNetUnfolderBase]: For 2807/3012 co-relation queries the response was YES.
[2024-11-24 01:14:40,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 8562 events. 2480/8562 cut-off events. For 2807/3012 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 87694 event pairs, 1597 based on Foata normal form. 70/7873 useless extension candidates. Maximal degree in co-relation 13171. Up to 3442 conditions per place.
[2024-11-24 01:14:40,636 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 42 selfloop transitions, 12 changer transitions 0/287 dead transitions.
[2024-11-24 01:14:40,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 287 transitions, 790 flow
[2024-11-24 01:14:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions.
[2024-11-24 01:14:40,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9338422391857506
[2024-11-24 01:14:40,641 INFO L175 Difference]: Start difference. First operand has 267 places, 269 transitions, 622 flow. Second operand 3 states and 734 transitions.
[2024-11-24 01:14:40,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 287 transitions, 790 flow
[2024-11-24 01:14:40,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 287 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:40,658 INFO L231 Difference]: Finished difference. Result has 268 places, 279 transitions, 706 flow
[2024-11-24 01:14:40,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=706, PETRI_PLACES=268, PETRI_TRANSITIONS=279}
[2024-11-24 01:14:40,660 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places.
[2024-11-24 01:14:40,661 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 279 transitions, 706 flow
[2024-11-24 01:14:40,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:40,662 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:40,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:40,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-24 01:14:40,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:40,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash 379250859, now seen corresponding path program 1 times
[2024-11-24 01:14:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:40,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446872789]
[2024-11-24 01:14:40,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:40,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:40,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446872789]
[2024-11-24 01:14:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446872789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:40,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:40,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625828579]
[2024-11-24 01:14:40,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:40,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:40,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:40,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:40,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:40,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 262
[2024-11-24 01:14:40,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 279 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:40,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:40,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 262
[2024-11-24 01:14:40,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:42,318 INFO L124 PetriNetUnfolderBase]: 1878/7688 cut-off events.
[2024-11-24 01:14:42,318 INFO L125 PetriNetUnfolderBase]: For 1101/1918 co-relation queries the response was YES.
[2024-11-24 01:14:42,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12618 conditions, 7688 events. 1878/7688 cut-off events. For 1101/1918 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 82669 event pairs, 1092 based on Foata normal form. 7/6759 useless extension candidates. Maximal degree in co-relation 10919. Up to 1725 conditions per place.
[2024-11-24 01:14:42,375 INFO L140 encePairwiseOnDemand]: 257/262 looper letters, 28 selfloop transitions, 4 changer transitions 0/290 dead transitions.
[2024-11-24 01:14:42,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 290 transitions, 792 flow
[2024-11-24 01:14:42,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions.
[2024-11-24 01:14:42,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950381679389313
[2024-11-24 01:14:42,377 INFO L175 Difference]: Start difference. First operand has 268 places, 279 transitions, 706 flow. Second operand 3 states and 747 transitions.
[2024-11-24 01:14:42,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 290 transitions, 792 flow
[2024-11-24 01:14:42,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 290 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:42,390 INFO L231 Difference]: Finished difference. Result has 270 places, 282 transitions, 712 flow
[2024-11-24 01:14:42,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=712, PETRI_PLACES=270, PETRI_TRANSITIONS=282}
[2024-11-24 01:14:42,394 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 7 predicate places.
[2024-11-24 01:14:42,394 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 282 transitions, 712 flow
[2024-11-24 01:14:42,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:42,395 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:42,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:42,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-24 01:14:42,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:42,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1650268142, now seen corresponding path program 1 times
[2024-11-24 01:14:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:42,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175663377]
[2024-11-24 01:14:42,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:42,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:42,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:42,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175663377]
[2024-11-24 01:14:42,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175663377] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:42,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:42,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:42,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126692424]
[2024-11-24 01:14:42,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:42,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:42,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:42,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:42,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:42,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262
[2024-11-24 01:14:42,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 282 transitions, 712 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:42,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:42,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262
[2024-11-24 01:14:42,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:44,657 INFO L124 PetriNetUnfolderBase]: 2430/9836 cut-off events.
[2024-11-24 01:14:44,657 INFO L125 PetriNetUnfolderBase]: For 1611/2578 co-relation queries the response was YES.
[2024-11-24 01:14:44,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16531 conditions, 9836 events. 2430/9836 cut-off events. For 1611/2578 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 112911 event pairs, 1418 based on Foata normal form. 11/8675 useless extension candidates. Maximal degree in co-relation 14739. Up to 2447 conditions per place.
[2024-11-24 01:14:44,731 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 7 changer transitions 0/298 dead transitions.
[2024-11-24 01:14:44,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 298 transitions, 841 flow
[2024-11-24 01:14:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:44,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 747 transitions.
[2024-11-24 01:14:44,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950381679389313
[2024-11-24 01:14:44,734 INFO L175 Difference]: Start difference. First operand has 270 places, 282 transitions, 712 flow. Second operand 3 states and 747 transitions.
[2024-11-24 01:14:44,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 298 transitions, 841 flow
[2024-11-24 01:14:44,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 298 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:44,748 INFO L231 Difference]: Finished difference. Result has 272 places, 287 transitions, 760 flow
[2024-11-24 01:14:44,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=760, PETRI_PLACES=272, PETRI_TRANSITIONS=287}
[2024-11-24 01:14:44,750 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 9 predicate places.
[2024-11-24 01:14:44,752 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 287 transitions, 760 flow
[2024-11-24 01:14:44,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:44,754 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:44,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:44,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-24 01:14:44,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:44,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:44,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1797753382, now seen corresponding path program 1 times
[2024-11-24 01:14:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:44,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183862545]
[2024-11-24 01:14:44,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:44,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:44,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183862545]
[2024-11-24 01:14:44,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183862545] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:44,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:44,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:44,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530791389]
[2024-11-24 01:14:44,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:44,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:44,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:44,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:44,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:44,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262
[2024-11-24 01:14:44,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 287 transitions, 760 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:44,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:44,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262
[2024-11-24 01:14:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:46,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][267], [281#true, 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true])
[2024-11-24 01:14:46,540 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event
[2024-11-24 01:14:46,540 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:46,540 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:46,540 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:46,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [281#true, 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 262#true, 39#L697true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 222#L695-2true, Black: 266#true])
[2024-11-24 01:14:46,648 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event
[2024-11-24 01:14:46,648 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event
[2024-11-24 01:14:46,648 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event
[2024-11-24 01:14:46,648 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event
[2024-11-24 01:14:46,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [281#true, 260#L697-3true, 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 222#L695-2true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true])
[2024-11-24 01:14:46,704 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event
[2024-11-24 01:14:46,704 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event
[2024-11-24 01:14:46,704 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event
[2024-11-24 01:14:46,704 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event
[2024-11-24 01:14:47,038 INFO L124 PetriNetUnfolderBase]: 4089/13244 cut-off events.
[2024-11-24 01:14:47,038 INFO L125 PetriNetUnfolderBase]: For 5569/5893 co-relation queries the response was YES.
[2024-11-24 01:14:47,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25628 conditions, 13244 events. 4089/13244 cut-off events. For 5569/5893 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 146368 event pairs, 2075 based on Foata normal form. 79/11927 useless extension candidates. Maximal degree in co-relation 21564. Up to 5204 conditions per place.
[2024-11-24 01:14:47,117 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 49 selfloop transitions, 19 changer transitions 0/313 dead transitions.
[2024-11-24 01:14:47,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 313 transitions, 997 flow
[2024-11-24 01:14:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:47,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions.
[2024-11-24 01:14:47,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9440203562340967
[2024-11-24 01:14:47,120 INFO L175 Difference]: Start difference. First operand has 272 places, 287 transitions, 760 flow. Second operand 3 states and 742 transitions.
[2024-11-24 01:14:47,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 313 transitions, 997 flow
[2024-11-24 01:14:47,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 313 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:47,131 INFO L231 Difference]: Finished difference. Result has 274 places, 302 transitions, 928 flow
[2024-11-24 01:14:47,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=928, PETRI_PLACES=274, PETRI_TRANSITIONS=302}
[2024-11-24 01:14:47,132 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places.
[2024-11-24 01:14:47,132 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 302 transitions, 928 flow
[2024-11-24 01:14:47,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:47,133 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:47,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:47,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-24 01:14:47,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:47,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1923959255, now seen corresponding path program 1 times
[2024-11-24 01:14:47,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:47,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490893425]
[2024-11-24 01:14:47,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:47,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:47,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490893425]
[2024-11-24 01:14:47,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490893425] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:47,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:47,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-24 01:14:47,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289637051]
[2024-11-24 01:14:47,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:47,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-24 01:14:47,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:47,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-24 01:14:47,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-24 01:14:47,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262
[2024-11-24 01:14:47,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 302 transitions, 928 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:47,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:47,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262
[2024-11-24 01:14:47,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:49,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true])
[2024-11-24 01:14:49,230 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,230 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,230 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:49,230 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:49,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([561] L705-5-->L705-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| |v_#race~threads_alive~0_4|) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|} AuxVars[] AssignedVars[#race~threads_alive~0][273], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 271#true, 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 62#L705-6true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 268#(= |#race~threads_alive~0| 0), 222#L695-2true, 264#true])
[2024-11-24 01:14:49,266 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event
[2024-11-24 01:14:49,266 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event
[2024-11-24 01:14:49,266 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event
[2024-11-24 01:14:49,266 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event
[2024-11-24 01:14:49,295 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true])
[2024-11-24 01:14:49,295 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,295 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,296 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,296 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:49,296 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:49,305 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 264#true, Black: 266#true])
[2024-11-24 01:14:49,306 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,306 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,306 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,306 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,306 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:49,306 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:49,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [201#L712-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, 39#L697true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true])
[2024-11-24 01:14:49,363 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,363 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event
[2024-11-24 01:14:49,364 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event
[2024-11-24 01:14:49,364 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,373 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][274], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 201#L712-1true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 161#L695-6true, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 198#L695-1true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true])
[2024-11-24 01:14:49,373 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event
[2024-11-24 01:14:49,374 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event
[2024-11-24 01:14:49,374 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event
[2024-11-24 01:14:49,374 INFO L297 olderBase$Statistics]: existing Event has 245 ancestors and is cut-off event
[2024-11-24 01:14:49,480 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [201#L712-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 39#L697true, 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 222#L695-2true, 264#true, Black: 266#true])
[2024-11-24 01:14:49,481 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,481 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event
[2024-11-24 01:14:49,481 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event
[2024-11-24 01:14:49,481 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,481 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [201#L712-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 147#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 222#L695-2true, 264#true, Black: 266#true])
[2024-11-24 01:14:49,497 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,498 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,498 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event
[2024-11-24 01:14:49,498 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event
[2024-11-24 01:14:49,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][216], [260#L697-3true, 201#L712-1true, Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, 222#L695-2true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), Black: 266#true])
[2024-11-24 01:14:49,549 INFO L294 olderBase$Statistics]: this new event has 253 ancestors and is cut-off event
[2024-11-24 01:14:49,549 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event
[2024-11-24 01:14:49,549 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event
[2024-11-24 01:14:49,549 INFO L297 olderBase$Statistics]: existing Event has 248 ancestors and is cut-off event
[2024-11-24 01:14:49,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([836] L695-2-->L695-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2)) InVars {~threads_alive~0=v_~threads_alive~0_7} OutVars{~threads_alive~0=v_~threads_alive~0_6} AuxVars[] AssignedVars[~threads_alive~0][290], [Black: 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 27#L695-3true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 291#true, 262#true, Black: 278#(= |#race~data~0| 0), 286#true, 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 219#L695-3true, 237#L706-3true, Black: 266#true])
[2024-11-24 01:14:49,562 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,562 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,562 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,562 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event
[2024-11-24 01:14:49,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([809] L695-4-->L695-5: Formula: (= |v_#race~threads_alive~0_13| |v_threadThread1of2ForFork0_#t~nondet5_3|) InVars {threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|} OutVars{threadThread1of2ForFork0_#t~nondet5=|v_threadThread1of2ForFork0_#t~nondet5_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|} AuxVars[] AssignedVars[#race~threads_alive~0][222], [Black: 286#true, Black: 273#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet10#1|), 288#(= |threadThread1of2ForFork0_#t~nondet5| |#race~threads_alive~0|), 291#true, 262#true, 29#L695-5true, 233#L706true, Black: 278#(= |#race~data~0| 0), 222#L695-2true, Black: 268#(= |#race~threads_alive~0| 0), 264#true, Black: 283#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|)])
[2024-11-24 01:14:49,614 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is not cut-off event
[2024-11-24 01:14:49,614 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event
[2024-11-24 01:14:49,614 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event
[2024-11-24 01:14:49,614 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is not cut-off event
[2024-11-24 01:14:50,004 INFO L124 PetriNetUnfolderBase]: 4737/15801 cut-off events.
[2024-11-24 01:14:50,004 INFO L125 PetriNetUnfolderBase]: For 6564/7144 co-relation queries the response was YES.
[2024-11-24 01:14:50,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31067 conditions, 15801 events. 4737/15801 cut-off events. For 6564/7144 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 184866 event pairs, 1712 based on Foata normal form. 71/14047 useless extension candidates. Maximal degree in co-relation 16596. Up to 4209 conditions per place.
[2024-11-24 01:14:50,082 INFO L140 encePairwiseOnDemand]: 254/262 looper letters, 45 selfloop transitions, 9 changer transitions 2/332 dead transitions.
[2024-11-24 01:14:50,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 332 transitions, 1100 flow
[2024-11-24 01:14:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-24 01:14:50,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-24 01:14:50,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions.
[2024-11-24 01:14:50,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.926208651399491
[2024-11-24 01:14:50,086 INFO L175 Difference]: Start difference. First operand has 274 places, 302 transitions, 928 flow. Second operand 6 states and 1456 transitions.
[2024-11-24 01:14:50,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 332 transitions, 1100 flow
[2024-11-24 01:14:50,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 332 transitions, 1062 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:50,124 INFO L231 Difference]: Finished difference. Result has 279 places, 309 transitions, 941 flow
[2024-11-24 01:14:50,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=279, PETRI_TRANSITIONS=309}
[2024-11-24 01:14:50,125 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 16 predicate places.
[2024-11-24 01:14:50,125 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 309 transitions, 941 flow
[2024-11-24 01:14:50,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:50,126 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:50,127 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:50,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-24 01:14:50,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:50,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1244387752, now seen corresponding path program 1 times
[2024-11-24 01:14:50,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:50,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353080378]
[2024-11-24 01:14:50,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:50,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353080378]
[2024-11-24 01:14:50,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353080378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:50,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:50,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:14:50,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599815750]
[2024-11-24 01:14:50,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:50,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:14:50,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:50,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:14:50,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:14:50,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262
[2024-11-24 01:14:50,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 309 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:50,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:50,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262
[2024-11-24 01:14:50,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:51,486 INFO L124 PetriNetUnfolderBase]: 321/2651 cut-off events.
[2024-11-24 01:14:51,486 INFO L125 PetriNetUnfolderBase]: For 665/701 co-relation queries the response was YES.
[2024-11-24 01:14:51,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4680 conditions, 2651 events. 321/2651 cut-off events. For 665/701 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 22676 event pairs, 119 based on Foata normal form. 86/2586 useless extension candidates. Maximal degree in co-relation 4104. Up to 283 conditions per place.
[2024-11-24 01:14:51,511 INFO L140 encePairwiseOnDemand]: 250/262 looper letters, 11 selfloop transitions, 12 changer transitions 0/275 dead transitions.
[2024-11-24 01:14:51,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 762 flow
[2024-11-24 01:14:51,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 01:14:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 01:14:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1233 transitions.
[2024-11-24 01:14:51,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9412213740458015
[2024-11-24 01:14:51,519 INFO L175 Difference]: Start difference. First operand has 279 places, 309 transitions, 941 flow. Second operand 5 states and 1233 transitions.
[2024-11-24 01:14:51,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 762 flow
[2024-11-24 01:14:51,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 275 transitions, 716 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-11-24 01:14:51,533 INFO L231 Difference]: Finished difference. Result has 273 places, 270 transitions, 679 flow
[2024-11-24 01:14:51,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=273, PETRI_TRANSITIONS=270}
[2024-11-24 01:14:51,535 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 10 predicate places.
[2024-11-24 01:14:51,536 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 270 transitions, 679 flow
[2024-11-24 01:14:51,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:51,537 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:51,537 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:51,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-24 01:14:51,538 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:51,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1163982306, now seen corresponding path program 1 times
[2024-11-24 01:14:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452785936]
[2024-11-24 01:14:51,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:51,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:51,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452785936]
[2024-11-24 01:14:51,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452785936] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:51,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:51,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628655012]
[2024-11-24 01:14:51,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:51,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:51,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:51,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:51,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 262
[2024-11-24 01:14:51,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 270 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:51,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:51,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 262
[2024-11-24 01:14:51,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:52,642 INFO L124 PetriNetUnfolderBase]: 1083/4561 cut-off events.
[2024-11-24 01:14:52,642 INFO L125 PetriNetUnfolderBase]: For 1581/1593 co-relation queries the response was YES.
[2024-11-24 01:14:52,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8766 conditions, 4561 events. 1083/4561 cut-off events. For 1581/1593 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 44096 event pairs, 573 based on Foata normal form. 0/4268 useless extension candidates. Maximal degree in co-relation 8187. Up to 1492 conditions per place.
[2024-11-24 01:14:52,663 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 34 selfloop transitions, 10 changer transitions 0/286 dead transitions.
[2024-11-24 01:14:52,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 286 transitions, 831 flow
[2024-11-24 01:14:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions.
[2024-11-24 01:14:52,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9491094147582697
[2024-11-24 01:14:52,667 INFO L175 Difference]: Start difference. First operand has 273 places, 270 transitions, 679 flow. Second operand 3 states and 746 transitions.
[2024-11-24 01:14:52,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 286 transitions, 831 flow
[2024-11-24 01:14:52,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 286 transitions, 810 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 01:14:52,676 INFO L231 Difference]: Finished difference. Result has 274 places, 276 transitions, 748 flow
[2024-11-24 01:14:52,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=274, PETRI_TRANSITIONS=276}
[2024-11-24 01:14:52,677 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 11 predicate places.
[2024-11-24 01:14:52,677 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 276 transitions, 748 flow
[2024-11-24 01:14:52,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:52,678 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:52,678 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:52,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-24 01:14:52,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:52,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash -52294139, now seen corresponding path program 1 times
[2024-11-24 01:14:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741286524]
[2024-11-24 01:14:52,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:52,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741286524]
[2024-11-24 01:14:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741286524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-24 01:14:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139201586]
[2024-11-24 01:14:52,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:52,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:52,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 262
[2024-11-24 01:14:52,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:52,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:52,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 262
[2024-11-24 01:14:52,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:53,758 INFO L124 PetriNetUnfolderBase]: 646/4598 cut-off events.
[2024-11-24 01:14:53,758 INFO L125 PetriNetUnfolderBase]: For 1821/1992 co-relation queries the response was YES.
[2024-11-24 01:14:53,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8372 conditions, 4598 events. 646/4598 cut-off events. For 1821/1992 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 48724 event pairs, 112 based on Foata normal form. 15/4399 useless extension candidates. Maximal degree in co-relation 7189. Up to 698 conditions per place.
[2024-11-24 01:14:53,794 INFO L140 encePairwiseOnDemand]: 253/262 looper letters, 21 selfloop transitions, 9 changer transitions 0/289 dead transitions.
[2024-11-24 01:14:53,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 289 transitions, 849 flow
[2024-11-24 01:14:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:53,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 758 transitions.
[2024-11-24 01:14:53,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9643765903307888
[2024-11-24 01:14:53,798 INFO L175 Difference]: Start difference. First operand has 274 places, 276 transitions, 748 flow. Second operand 3 states and 758 transitions.
[2024-11-24 01:14:53,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 289 transitions, 849 flow
[2024-11-24 01:14:53,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 289 transitions, 829 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:53,810 INFO L231 Difference]: Finished difference. Result has 275 places, 283 transitions, 788 flow
[2024-11-24 01:14:53,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=275, PETRI_TRANSITIONS=283}
[2024-11-24 01:14:53,811 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 12 predicate places.
[2024-11-24 01:14:53,811 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 283 transitions, 788 flow
[2024-11-24 01:14:53,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:53,812 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:53,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:53,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-24 01:14:53,813 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:53,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:53,814 INFO L85 PathProgramCache]: Analyzing trace with hash -507865659, now seen corresponding path program 2 times
[2024-11-24 01:14:53,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:53,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636501214]
[2024-11-24 01:14:53,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-24 01:14:53,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:53,859 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-24 01:14:53,860 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-24 01:14:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:54,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:54,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636501214]
[2024-11-24 01:14:54,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636501214] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:54,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:54,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-24 01:14:54,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038393536]
[2024-11-24 01:14:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-24 01:14:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:54,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-24 01:14:54,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-24 01:14:54,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 262
[2024-11-24 01:14:54,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 283 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:54,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:54,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 262
[2024-11-24 01:14:54,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:55,102 INFO L124 PetriNetUnfolderBase]: 306/2803 cut-off events.
[2024-11-24 01:14:55,102 INFO L125 PetriNetUnfolderBase]: For 1000/1210 co-relation queries the response was YES.
[2024-11-24 01:14:55,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5139 conditions, 2803 events. 306/2803 cut-off events. For 1000/1210 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 25146 event pairs, 75 based on Foata normal form. 65/2768 useless extension candidates. Maximal degree in co-relation 4473. Up to 328 conditions per place.
[2024-11-24 01:14:55,114 INFO L140 encePairwiseOnDemand]: 256/262 looper letters, 28 selfloop transitions, 8 changer transitions 0/289 dead transitions.
[2024-11-24 01:14:55,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 289 transitions, 867 flow
[2024-11-24 01:14:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-24 01:14:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-24 01:14:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1236 transitions.
[2024-11-24 01:14:55,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9435114503816794
[2024-11-24 01:14:55,118 INFO L175 Difference]: Start difference. First operand has 275 places, 283 transitions, 788 flow. Second operand 5 states and 1236 transitions.
[2024-11-24 01:14:55,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 289 transitions, 867 flow
[2024-11-24 01:14:55,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 289 transitions, 854 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-11-24 01:14:55,128 INFO L231 Difference]: Finished difference. Result has 278 places, 278 transitions, 751 flow
[2024-11-24 01:14:55,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=751, PETRI_PLACES=278, PETRI_TRANSITIONS=278}
[2024-11-24 01:14:55,129 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 15 predicate places.
[2024-11-24 01:14:55,129 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 278 transitions, 751 flow
[2024-11-24 01:14:55,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 242.5) internal successors, (1455), 6 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:55,130 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:55,130 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:55,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-24 01:14:55,130 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:55,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:55,131 INFO L85 PathProgramCache]: Analyzing trace with hash -676731994, now seen corresponding path program 1 times
[2024-11-24 01:14:55,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:55,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192424334]
[2024-11-24 01:14:55,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:55,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:55,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:55,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192424334]
[2024-11-24 01:14:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192424334] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:55,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255054367]
[2024-11-24 01:14:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:55,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:55,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:55,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:55,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 262
[2024-11-24 01:14:55,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 278 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:55,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:55,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 262
[2024-11-24 01:14:55,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:55,848 INFO L124 PetriNetUnfolderBase]: 503/3564 cut-off events.
[2024-11-24 01:14:55,849 INFO L125 PetriNetUnfolderBase]: For 2170/2436 co-relation queries the response was YES.
[2024-11-24 01:14:55,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 3564 events. 503/3564 cut-off events. For 2170/2436 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 34386 event pairs, 226 based on Foata normal form. 6/3415 useless extension candidates. Maximal degree in co-relation 6345. Up to 891 conditions per place.
[2024-11-24 01:14:55,862 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 37 selfloop transitions, 2 changer transitions 0/280 dead transitions.
[2024-11-24 01:14:55,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 280 transitions, 845 flow
[2024-11-24 01:14:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:14:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:14:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions.
[2024-11-24 01:14:55,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9223918575063613
[2024-11-24 01:14:55,865 INFO L175 Difference]: Start difference. First operand has 278 places, 278 transitions, 751 flow. Second operand 3 states and 725 transitions.
[2024-11-24 01:14:55,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 280 transitions, 845 flow
[2024-11-24 01:14:55,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 280 transitions, 833 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-24 01:14:55,872 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 744 flow
[2024-11-24 01:14:55,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=276, PETRI_TRANSITIONS=277}
[2024-11-24 01:14:55,873 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 13 predicate places.
[2024-11-24 01:14:55,874 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 744 flow
[2024-11-24 01:14:55,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:55,874 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:55,874 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:55,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-24 01:14:55,875 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:55,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1845436025, now seen corresponding path program 1 times
[2024-11-24 01:14:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:55,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063267762]
[2024-11-24 01:14:55,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:55,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:56,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:56,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:56,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063267762]
[2024-11-24 01:14:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063267762] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:56,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-24 01:14:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892177362]
[2024-11-24 01:14:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:56,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-24 01:14:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:56,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-24 01:14:56,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-24 01:14:56,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 262
[2024-11-24 01:14:56,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 744 flow. Second operand has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:56,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:56,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 262
[2024-11-24 01:14:56,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:14:56,744 INFO L124 PetriNetUnfolderBase]: 323/2280 cut-off events.
[2024-11-24 01:14:56,744 INFO L125 PetriNetUnfolderBase]: For 1006/1071 co-relation queries the response was YES.
[2024-11-24 01:14:56,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4455 conditions, 2280 events. 323/2280 cut-off events. For 1006/1071 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 17631 event pairs, 78 based on Foata normal form. 22/2223 useless extension candidates. Maximal degree in co-relation 3225. Up to 288 conditions per place.
[2024-11-24 01:14:56,757 INFO L140 encePairwiseOnDemand]: 255/262 looper letters, 70 selfloop transitions, 14 changer transitions 12/329 dead transitions.
[2024-11-24 01:14:56,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 329 transitions, 1153 flow
[2024-11-24 01:14:56,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-24 01:14:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-24 01:14:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2174 transitions.
[2024-11-24 01:14:56,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219677692960135
[2024-11-24 01:14:56,762 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 744 flow. Second operand 9 states and 2174 transitions.
[2024-11-24 01:14:56,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 329 transitions, 1153 flow
[2024-11-24 01:14:56,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 329 transitions, 1149 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-24 01:14:56,770 INFO L231 Difference]: Finished difference. Result has 284 places, 278 transitions, 787 flow
[2024-11-24 01:14:56,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=787, PETRI_PLACES=284, PETRI_TRANSITIONS=278}
[2024-11-24 01:14:56,771 INFO L279 CegarLoopForPetriNet]: 263 programPoint places, 21 predicate places.
[2024-11-24 01:14:56,771 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 278 transitions, 787 flow
[2024-11-24 01:14:56,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.57142857142858) internal successors, (1649), 7 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:56,772 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:56,772 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:56,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-24 01:14:56,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2024-11-24 01:14:56,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash 288342436, now seen corresponding path program 1 times
[2024-11-24 01:14:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:56,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625493084]
[2024-11-24 01:14:56,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:14:56,814 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-24 01:14:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-24 01:14:56,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-24 01:14:56,880 INFO L340 BasicCegarLoop]: Counterexample is feasible
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining)
[2024-11-24 01:14:56,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining)
[2024-11-24 01:14:56,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-24 01:14:56,882 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:56,884 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-11-24 01:14:56,885 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-11-24 01:14:56,921 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-24 01:14:56,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 295 places, 292 transitions, 602 flow
[2024-11-24 01:14:56,990 INFO L124 PetriNetUnfolderBase]: 13/434 cut-off events.
[2024-11-24 01:14:56,991 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2024-11-24 01:14:56,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 434 events. 13/434 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 581 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 358. Up to 8 conditions per place.
[2024-11-24 01:14:56,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 295 places, 292 transitions, 602 flow
[2024-11-24 01:14:56,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 295 places, 292 transitions, 602 flow
[2024-11-24 01:14:56,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-24 01:14:57,000 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70ad9213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-24 01:14:57,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations.
[2024-11-24 01:14:57,010 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-24 01:14:57,010 INFO L124 PetriNetUnfolderBase]: 2/162 cut-off events.
[2024-11-24 01:14:57,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-24 01:14:57,010 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:14:57,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:14:57,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-11-24 01:14:57,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:14:57,011 INFO L85 PathProgramCache]: Analyzing trace with hash 293253618, now seen corresponding path program 1 times
[2024-11-24 01:14:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:14:57,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806529786]
[2024-11-24 01:14:57,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:14:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:14:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:14:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:14:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:14:57,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806529786]
[2024-11-24 01:14:57,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806529786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:14:57,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:14:57,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:14:57,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284743556]
[2024-11-24 01:14:57,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:14:57,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:14:57,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:14:57,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:14:57,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:14:57,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 292
[2024-11-24 01:14:57,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 292 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:14:57,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:14:57,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 292
[2024-11-24 01:14:57,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:15:10,157 INFO L124 PetriNetUnfolderBase]: 35239/79075 cut-off events.
[2024-11-24 01:15:10,158 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES.
[2024-11-24 01:15:10,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129887 conditions, 79075 events. 35239/79075 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 2945. Compared 957466 event pairs, 14941 based on Foata normal form. 986/71986 useless extension candidates. Maximal degree in co-relation 109153. Up to 27933 conditions per place.
[2024-11-24 01:15:10,747 INFO L140 encePairwiseOnDemand]: 270/292 looper letters, 60 selfloop transitions, 14 changer transitions 1/323 dead transitions.
[2024-11-24 01:15:10,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 323 transitions, 824 flow
[2024-11-24 01:15:10,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-24 01:15:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-24 01:15:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 831 transitions.
[2024-11-24 01:15:10,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486301369863014
[2024-11-24 01:15:10,749 INFO L175 Difference]: Start difference. First operand has 295 places, 292 transitions, 602 flow. Second operand 3 states and 831 transitions.
[2024-11-24 01:15:10,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 323 transitions, 824 flow
[2024-11-24 01:15:10,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 323 transitions, 820 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-11-24 01:15:10,758 INFO L231 Difference]: Finished difference. Result has 299 places, 302 transitions, 714 flow
[2024-11-24 01:15:10,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=299, PETRI_TRANSITIONS=302}
[2024-11-24 01:15:10,759 INFO L279 CegarLoopForPetriNet]: 295 programPoint places, 4 predicate places.
[2024-11-24 01:15:10,759 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 302 transitions, 714 flow
[2024-11-24 01:15:10,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:15:10,759 INFO L198 CegarLoopForPetriNet]: Found error trace
[2024-11-24 01:15:10,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-24 01:15:10,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-24 01:15:10,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 14 more)] ===
[2024-11-24 01:15:10,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-24 01:15:10,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1449918182, now seen corresponding path program 1 times
[2024-11-24 01:15:10,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-24 01:15:10,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290857686]
[2024-11-24 01:15:10,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-24 01:15:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-24 01:15:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-24 01:15:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-24 01:15:10,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-24 01:15:10,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290857686]
[2024-11-24 01:15:10,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290857686] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-24 01:15:10,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-24 01:15:10,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-24 01:15:10,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403561424]
[2024-11-24 01:15:10,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-24 01:15:10,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-24 01:15:10,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-24 01:15:10,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-24 01:15:10,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-24 01:15:10,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 292
[2024-11-24 01:15:10,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 302 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-24 01:15:10,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-24 01:15:10,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 292
[2024-11-24 01:15:10,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-24 01:15:16,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 239#L695-2true, 222#L695-2true, Black: 298#true])
[2024-11-24 01:15:16,014 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event
[2024-11-24 01:15:16,014 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event
[2024-11-24 01:15:16,014 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event
[2024-11-24 01:15:16,014 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event
[2024-11-24 01:15:16,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [136#L695-1true, 34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 222#L695-2true, Black: 298#true])
[2024-11-24 01:15:16,015 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event
[2024-11-24 01:15:16,015 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,015 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,015 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 80#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 239#L695-2true, Black: 298#true])
[2024-11-24 01:15:16,015 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event
[2024-11-24 01:15:16,015 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,015 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,015 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,279 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 303#true, 292#true, 294#true, 80#L695-1true, 300#(= |#race~threads_alive~0| 0), 296#true, 239#L695-2true, Black: 298#true])
[2024-11-24 01:15:16,279 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event
[2024-11-24 01:15:16,279 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event
[2024-11-24 01:15:16,279 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,279 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,279 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,281 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [136#L695-1true, 34#L691-3true, 220#L712-1true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, Black: 298#true, 222#L695-2true])
[2024-11-24 01:15:16,282 INFO L294 olderBase$Statistics]: this new event has 275 ancestors and is cut-off event
[2024-11-24 01:15:16,282 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,282 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event
[2024-11-24 01:15:16,282 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,282 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event
[2024-11-24 01:15:16,871 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 292#true, 303#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 239#L695-2true, 222#L695-2true, Black: 298#true])
[2024-11-24 01:15:16,871 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event
[2024-11-24 01:15:16,871 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event
[2024-11-24 01:15:16,871 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event
[2024-11-24 01:15:16,871 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event
[2024-11-24 01:15:16,871 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event
[2024-11-24 01:15:16,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1065] L713-5-->L712-1: Formula: (= 0 |v_#race~threads_alive~0_7|) InVars {} OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|} AuxVars[] AssignedVars[#race~threads_alive~0][170], [34#L691-3true, 220#L712-1true, 303#true, 292#true, 294#true, 300#(= |#race~threads_alive~0| 0), 296#true, 218#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 239#L695-2true, Black: 298#true])
[2024-11-24 01:15:16,872 INFO L294 olderBase$Statistics]: this new event has 276 ancestors and is cut-off event
[2024-11-24 01:15:16,872 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event
[2024-11-24 01:15:16,872 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event
[2024-11-24 01:15:16,872 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event