./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU --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 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:07:52,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:07:52,216 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:07:52,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:07:52,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:07:52,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:07:52,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:07:52,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:07:52,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:07:52,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:07:52,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:07:52,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:07:52,277 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:07:52,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:07:52,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:07:52,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:07:52,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:07:52,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:07:52,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:07:52,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:07:52,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:07:52,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:07:52,289 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:07:52,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:07:52,290 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:07:52,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:07:52,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:07:52,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:07:52,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:07:52,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:07:52,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:07:52,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:52,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:07:52,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:07:52,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:07:52,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:07:52,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:07:52,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:07:52,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:07:52,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:07:52,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:07:52,300 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 801883caffd8b582a36607f9ec62109ac5c5dc10c811693a281fb396b4b60131 [2024-10-31 22:07:52,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:07:52,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:07:52,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:07:52,732 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:07:52,733 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:07:52,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i Unable to find full path for "g++" [2024-10-31 22:07:55,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:07:55,627 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:07:55,627 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/sv-benchmarks/c/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2024-10-31 22:07:55,645 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/data/750707b79/420d3b052fcf4076a11d11c6a0bac81c/FLAG897a1e200 [2024-10-31 22:07:55,913 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/data/750707b79/420d3b052fcf4076a11d11c6a0bac81c [2024-10-31 22:07:55,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:07:55,917 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:07:55,918 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:07:55,918 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:07:55,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:07:55,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:07:55" (1/1) ... [2024-10-31 22:07:55,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d98749b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:55, skipping insertion in model container [2024-10-31 22:07:55,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:07:55" (1/1) ... [2024-10-31 22:07:55,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:07:56,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:07:56,463 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:07:56,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:07:56,573 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:07:56,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56 WrapperNode [2024-10-31 22:07:56,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:07:56,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:07:56,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:07:56,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:07:56,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,635 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 87 [2024-10-31 22:07:56,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:07:56,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:07:56,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:07:56,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:07:56,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:07:56,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:07:56,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:07:56,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:07:56,695 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (1/1) ... [2024-10-31 22:07:56,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:56,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:07:56,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:07:56,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c4b5415-3240-4c5f-82f5-19c018f740f4/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:07:56,782 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-31 22:07:56,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-31 22:07:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-31 22:07:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:07:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:07:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-31 22:07:56,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:07:56,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:07:56,786 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:07:56,960 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:07:56,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:07:57,207 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:07:57,208 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:07:57,253 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:07:57,253 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:07:57,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:57 BoogieIcfgContainer [2024-10-31 22:07:57,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:07:57,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:07:57,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:07:57,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:07:57,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:07:55" (1/3) ... [2024-10-31 22:07:57,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4307cbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:07:57, skipping insertion in model container [2024-10-31 22:07:57,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:56" (2/3) ... [2024-10-31 22:07:57,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4307cbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:07:57, skipping insertion in model container [2024-10-31 22:07:57,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:57" (3/3) ... [2024-10-31 22:07:57,265 INFO L112 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2024-10-31 22:07:57,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:07:57,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-31 22:07:57,285 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:07:57,346 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:07:57,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 99 transitions, 202 flow [2024-10-31 22:07:57,441 INFO L124 PetriNetUnfolderBase]: 8/149 cut-off events. [2024-10-31 22:07:57,442 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:57,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 149 events. 8/149 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 352 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 80. Up to 4 conditions per place. [2024-10-31 22:07:57,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 99 transitions, 202 flow [2024-10-31 22:07:57,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 99 transitions, 202 flow [2024-10-31 22:07:57,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:07:57,485 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;@6a8f9ba6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:07:57,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-10-31 22:07:57,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:07:57,507 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2024-10-31 22:07:57,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:57,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:57,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:57,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:57,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:57,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1583107030, now seen corresponding path program 1 times [2024-10-31 22:07:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:57,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987340105] [2024-10-31 22:07:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:57,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:57,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987340105] [2024-10-31 22:07:57,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987340105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:57,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:57,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817407409] [2024-10-31 22:07:57,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:57,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:07:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:57,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:07:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:07:57,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2024-10-31 22:07:57,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 202 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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-10-31 22:07:57,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:57,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2024-10-31 22:07:57,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:57,901 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2024-10-31 22:07:57,901 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:07:57,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 189 events. 4/189 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 542 event pairs, 4 based on Foata normal form. 16/181 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2024-10-31 22:07:57,904 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2024-10-31 22:07:57,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2024-10-31 22:07:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:07:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-31 22:07:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-10-31 22:07:57,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2024-10-31 22:07:57,920 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 202 flow. Second operand 2 states and 184 transitions. [2024-10-31 22:07:57,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 194 flow [2024-10-31 22:07:57,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:07:57,928 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 184 flow [2024-10-31 22:07:57,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2024-10-31 22:07:57,934 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2024-10-31 22:07:57,935 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 184 flow [2024-10-31 22:07:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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-10-31 22:07:57,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:57,936 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:57,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:07:57,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:57,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:57,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1546415920, now seen corresponding path program 1 times [2024-10-31 22:07:57,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432783173] [2024-10-31 22:07:57,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:58,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432783173] [2024-10-31 22:07:58,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432783173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:58,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:58,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907954516] [2024-10-31 22:07:58,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:58,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:58,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:58,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:58,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 99 [2024-10-31 22:07:58,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-10-31 22:07:58,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:58,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 99 [2024-10-31 22:07:58,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:58,299 INFO L124 PetriNetUnfolderBase]: 59/448 cut-off events. [2024-10-31 22:07:58,300 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:07:58,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 448 events. 59/448 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2365 event pairs, 41 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 597. Up to 126 conditions per place. [2024-10-31 22:07:58,304 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2024-10-31 22:07:58,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 246 flow [2024-10-31 22:07:58,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2024-10-31 22:07:58,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8417508417508418 [2024-10-31 22:07:58,309 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 184 flow. Second operand 3 states and 250 transitions. [2024-10-31 22:07:58,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 246 flow [2024-10-31 22:07:58,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:07:58,317 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 230 flow [2024-10-31 22:07:58,317 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-10-31 22:07:58,318 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2024-10-31 22:07:58,318 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 230 flow [2024-10-31 22:07:58,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-10-31 22:07:58,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:58,322 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:58,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:07:58,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:58,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:58,324 INFO L85 PathProgramCache]: Analyzing trace with hash -2130394336, now seen corresponding path program 1 times [2024-10-31 22:07:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:58,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411981866] [2024-10-31 22:07:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:58,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411981866] [2024-10-31 22:07:58,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411981866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:58,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:58,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:58,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144879052] [2024-10-31 22:07:58,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:58,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:58,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:58,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:58,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 99 [2024-10-31 22:07:58,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:58,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:58,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 99 [2024-10-31 22:07:58,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:58,599 INFO L124 PetriNetUnfolderBase]: 64/427 cut-off events. [2024-10-31 22:07:58,600 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2024-10-31 22:07:58,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 427 events. 64/427 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2341 event pairs, 32 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 667. Up to 119 conditions per place. [2024-10-31 22:07:58,606 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 18 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2024-10-31 22:07:58,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 102 transitions, 298 flow [2024-10-31 22:07:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:58,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2024-10-31 22:07:58,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8552188552188552 [2024-10-31 22:07:58,611 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 230 flow. Second operand 3 states and 254 transitions. [2024-10-31 22:07:58,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 102 transitions, 298 flow [2024-10-31 22:07:58,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 102 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:58,618 INFO L231 Difference]: Finished difference. Result has 100 places, 100 transitions, 270 flow [2024-10-31 22:07:58,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=100, PETRI_TRANSITIONS=100} [2024-10-31 22:07:58,622 INFO L277 CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places. [2024-10-31 22:07:58,623 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 100 transitions, 270 flow [2024-10-31 22:07:58,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:07:58,623 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:58,623 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:58,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:07:58,624 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-10-31 22:07:58,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2129827008, now seen corresponding path program 1 times [2024-10-31 22:07:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:58,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662280238] [2024-10-31 22:07:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:58,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:07:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:58,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:07:58,747 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:07:58,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-10-31 22:07:58,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-10-31 22:07:58,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-10-31 22:07:58,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-10-31 22:07:58,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-10-31 22:07:58,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-10-31 22:07:58,756 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-10-31 22:07:58,757 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-10-31 22:07:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-10-31 22:07:58,759 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-10-31 22:07:58,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:07:58,760 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-31 22:07:58,766 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:07:58,766 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-31 22:07:58,828 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:07:58,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 130 transitions, 270 flow [2024-10-31 22:07:58,897 INFO L124 PetriNetUnfolderBase]: 13/230 cut-off events. [2024-10-31 22:07:58,897 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 22:07:58,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 230 events. 13/230 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 766 event pairs, 0 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2024-10-31 22:07:58,901 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 130 transitions, 270 flow [2024-10-31 22:07:58,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 130 transitions, 270 flow [2024-10-31 22:07:58,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:07:58,907 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;@6a8f9ba6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:07:58,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-31 22:07:58,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:07:58,913 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2024-10-31 22:07:58,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:58,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:58,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:58,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:07:58,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:58,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1723236182, now seen corresponding path program 1 times [2024-10-31 22:07:58,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:58,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274824099] [2024-10-31 22:07:58,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:58,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:58,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:58,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274824099] [2024-10-31 22:07:58,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274824099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:58,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:58,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258471067] [2024-10-31 22:07:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:07:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:58,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:07:58,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:07:58,943 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2024-10-31 22:07:58,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 270 flow. Second operand has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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-10-31 22:07:58,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:58,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2024-10-31 22:07:58,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:59,056 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2024-10-31 22:07:59,056 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-31 22:07:59,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 566 events. 34/566 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3265 event pairs, 34 based on Foata normal form. 67/546 useless extension candidates. Maximal degree in co-relation 429. Up to 73 conditions per place. [2024-10-31 22:07:59,061 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2024-10-31 22:07:59,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2024-10-31 22:07:59,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:07:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-31 22:07:59,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2024-10-31 22:07:59,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2024-10-31 22:07:59,063 INFO L175 Difference]: Start difference. First operand has 128 places, 130 transitions, 270 flow. Second operand 2 states and 239 transitions. [2024-10-31 22:07:59,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 260 flow [2024-10-31 22:07:59,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:07:59,067 INFO L231 Difference]: Finished difference. Result has 123 places, 117 transitions, 244 flow [2024-10-31 22:07:59,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=244, PETRI_PLACES=123, PETRI_TRANSITIONS=117} [2024-10-31 22:07:59,068 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2024-10-31 22:07:59,068 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 244 flow [2024-10-31 22:07:59,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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-10-31 22:07:59,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:59,069 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:59,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:07:59,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:07:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1666931310, now seen corresponding path program 1 times [2024-10-31 22:07:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:59,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152619764] [2024-10-31 22:07:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:59,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:59,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:59,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152619764] [2024-10-31 22:07:59,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152619764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:59,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:59,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:59,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628443396] [2024-10-31 22:07:59,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:59,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:59,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:59,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-10-31 22:07:59,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-10-31 22:07:59,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:59,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-10-31 22:07:59,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:59,805 INFO L124 PetriNetUnfolderBase]: 845/3283 cut-off events. [2024-10-31 22:07:59,805 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-31 22:07:59,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4733 conditions, 3283 events. 845/3283 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 29834 event pairs, 632 based on Foata normal form. 0/2783 useless extension candidates. Maximal degree in co-relation 4728. Up to 1252 conditions per place. [2024-10-31 22:07:59,830 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 26 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2024-10-31 22:07:59,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 338 flow [2024-10-31 22:07:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:59,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-10-31 22:07:59,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-10-31 22:07:59,832 INFO L175 Difference]: Start difference. First operand has 123 places, 117 transitions, 244 flow. Second operand 3 states and 327 transitions. [2024-10-31 22:07:59,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 338 flow [2024-10-31 22:07:59,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 129 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:07:59,839 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 314 flow [2024-10-31 22:07:59,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2024-10-31 22:07:59,840 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2024-10-31 22:07:59,840 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 314 flow [2024-10-31 22:07:59,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-10-31 22:07:59,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:59,841 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:59,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:07:59,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:07:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 916108832, now seen corresponding path program 1 times [2024-10-31 22:07:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:59,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355144188] [2024-10-31 22:07:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:07:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:59,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355144188] [2024-10-31 22:07:59,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355144188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:59,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:59,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:59,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131863601] [2024-10-31 22:07:59,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:59,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:59,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:59,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:59,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:59,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-10-31 22:07:59,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-10-31 22:07:59,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:59,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-10-31 22:07:59,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:00,546 INFO L124 PetriNetUnfolderBase]: 1088/3830 cut-off events. [2024-10-31 22:08:00,546 INFO L125 PetriNetUnfolderBase]: For 861/1014 co-relation queries the response was YES. [2024-10-31 22:08:00,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6732 conditions, 3830 events. 1088/3830 cut-off events. For 861/1014 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 36040 event pairs, 560 based on Foata normal form. 3/3223 useless extension candidates. Maximal degree in co-relation 6725. Up to 1421 conditions per place. [2024-10-31 22:08:00,576 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 30 selfloop transitions, 13 changer transitions 0/141 dead transitions. [2024-10-31 22:08:00,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 141 transitions, 459 flow [2024-10-31 22:08:00,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-10-31 22:08:00,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-10-31 22:08:00,578 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 314 flow. Second operand 3 states and 332 transitions. [2024-10-31 22:08:00,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 141 transitions, 459 flow [2024-10-31 22:08:00,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 433 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:00,587 INFO L231 Difference]: Finished difference. Result has 129 places, 136 transitions, 408 flow [2024-10-31 22:08:00,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=129, PETRI_TRANSITIONS=136} [2024-10-31 22:08:00,588 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2024-10-31 22:08:00,588 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 136 transitions, 408 flow [2024-10-31 22:08:00,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-10-31 22:08:00,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:00,589 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:00,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:08:00,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:08:00,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1138438696, now seen corresponding path program 1 times [2024-10-31 22:08:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:00,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794044050] [2024-10-31 22:08:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:00,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:00,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794044050] [2024-10-31 22:08:00,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794044050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:00,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:00,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294540459] [2024-10-31 22:08:00,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:00,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:00,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:00,692 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-10-31 22:08:00,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 136 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-10-31 22:08:00,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:00,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-10-31 22:08:00,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:01,774 INFO L124 PetriNetUnfolderBase]: 2061/6890 cut-off events. [2024-10-31 22:08:01,774 INFO L125 PetriNetUnfolderBase]: For 3809/3989 co-relation queries the response was YES. [2024-10-31 22:08:01,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13659 conditions, 6890 events. 2061/6890 cut-off events. For 3809/3989 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 72127 event pairs, 630 based on Foata normal form. 7/5761 useless extension candidates. Maximal degree in co-relation 13651. Up to 1788 conditions per place. [2024-10-31 22:08:01,840 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 44 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2024-10-31 22:08:01,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 168 transitions, 707 flow [2024-10-31 22:08:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2024-10-31 22:08:01,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8615384615384616 [2024-10-31 22:08:01,841 INFO L175 Difference]: Start difference. First operand has 129 places, 136 transitions, 408 flow. Second operand 3 states and 336 transitions. [2024-10-31 22:08:01,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 168 transitions, 707 flow [2024-10-31 22:08:01,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 168 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:01,855 INFO L231 Difference]: Finished difference. Result has 131 places, 161 transitions, 664 flow [2024-10-31 22:08:01,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=131, PETRI_TRANSITIONS=161} [2024-10-31 22:08:01,857 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2024-10-31 22:08:01,858 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 664 flow [2024-10-31 22:08:01,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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-10-31 22:08:01,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:01,859 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:01,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:08:01,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:08:01,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:01,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1868486520, now seen corresponding path program 1 times [2024-10-31 22:08:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:01,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902193361] [2024-10-31 22:08:01,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:01,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:01,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:01,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902193361] [2024-10-31 22:08:01,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902193361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:01,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:01,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:01,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970856499] [2024-10-31 22:08:01,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:01,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:01,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:01,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:01,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:02,041 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 130 [2024-10-31 22:08:02,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 161 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-10-31 22:08:02,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:02,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 130 [2024-10-31 22:08:02,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:03,445 INFO L124 PetriNetUnfolderBase]: 2966/9755 cut-off events. [2024-10-31 22:08:03,445 INFO L125 PetriNetUnfolderBase]: For 15047/15536 co-relation queries the response was YES. [2024-10-31 22:08:03,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23389 conditions, 9755 events. 2966/9755 cut-off events. For 15047/15536 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 106016 event pairs, 1072 based on Foata normal form. 41/8329 useless extension candidates. Maximal degree in co-relation 23380. Up to 3627 conditions per place. [2024-10-31 22:08:03,619 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 60 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2024-10-31 22:08:03,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 183 transitions, 976 flow [2024-10-31 22:08:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2024-10-31 22:08:03,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2024-10-31 22:08:03,621 INFO L175 Difference]: Start difference. First operand has 131 places, 161 transitions, 664 flow. Second operand 3 states and 327 transitions. [2024-10-31 22:08:03,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 183 transitions, 976 flow [2024-10-31 22:08:03,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 183 transitions, 908 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:03,635 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 862 flow [2024-10-31 22:08:03,636 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2024-10-31 22:08:03,636 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2024-10-31 22:08:03,637 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 179 transitions, 862 flow [2024-10-31 22:08:03,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-10-31 22:08:03,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:03,637 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:03,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:08:03,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:08:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1763227351, now seen corresponding path program 1 times [2024-10-31 22:08:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709716019] [2024-10-31 22:08:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-31 22:08:03,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:03,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709716019] [2024-10-31 22:08:03,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709716019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:03,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554087141] [2024-10-31 22:08:03,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:03,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:03,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:03,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-10-31 22:08:03,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 179 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-10-31 22:08:03,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:03,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-10-31 22:08:03,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:05,260 INFO L124 PetriNetUnfolderBase]: 3533/10646 cut-off events. [2024-10-31 22:08:05,260 INFO L125 PetriNetUnfolderBase]: For 19402/19852 co-relation queries the response was YES. [2024-10-31 22:08:05,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27773 conditions, 10646 events. 3533/10646 cut-off events. For 19402/19852 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 115646 event pairs, 994 based on Foata normal form. 26/8880 useless extension candidates. Maximal degree in co-relation 27763. Up to 3995 conditions per place. [2024-10-31 22:08:05,380 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 68 selfloop transitions, 36 changer transitions 0/209 dead transitions. [2024-10-31 22:08:05,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 209 transitions, 1284 flow [2024-10-31 22:08:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2024-10-31 22:08:05,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8487179487179487 [2024-10-31 22:08:05,385 INFO L175 Difference]: Start difference. First operand has 133 places, 179 transitions, 862 flow. Second operand 3 states and 331 transitions. [2024-10-31 22:08:05,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 209 transitions, 1284 flow [2024-10-31 22:08:05,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 209 transitions, 1184 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:05,452 INFO L231 Difference]: Finished difference. Result has 135 places, 205 transitions, 1166 flow [2024-10-31 22:08:05,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=135, PETRI_TRANSITIONS=205} [2024-10-31 22:08:05,454 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2024-10-31 22:08:05,454 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 205 transitions, 1166 flow [2024-10-31 22:08:05,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-10-31 22:08:05,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:05,455 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:05,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:08:05,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:08:05,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -453541239, now seen corresponding path program 1 times [2024-10-31 22:08:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:05,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187722176] [2024-10-31 22:08:05,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:05,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:05,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:05,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187722176] [2024-10-31 22:08:05,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187722176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:05,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:05,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:05,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524959732] [2024-10-31 22:08:05,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:05,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:05,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:05,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 130 [2024-10-31 22:08:05,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 205 transitions, 1166 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-10-31 22:08:05,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:05,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 130 [2024-10-31 22:08:05,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:07,345 INFO L124 PetriNetUnfolderBase]: 4494/13130 cut-off events. [2024-10-31 22:08:07,346 INFO L125 PetriNetUnfolderBase]: For 33502/34099 co-relation queries the response was YES. [2024-10-31 22:08:07,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37401 conditions, 13130 events. 4494/13130 cut-off events. For 33502/34099 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 144792 event pairs, 1133 based on Foata normal form. 23/11003 useless extension candidates. Maximal degree in co-relation 37390. Up to 4861 conditions per place. [2024-10-31 22:08:07,458 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 91 selfloop transitions, 38 changer transitions 0/236 dead transitions. [2024-10-31 22:08:07,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 236 transitions, 1685 flow [2024-10-31 22:08:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2024-10-31 22:08:07,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8512820512820513 [2024-10-31 22:08:07,460 INFO L175 Difference]: Start difference. First operand has 135 places, 205 transitions, 1166 flow. Second operand 3 states and 332 transitions. [2024-10-31 22:08:07,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 236 transitions, 1685 flow [2024-10-31 22:08:07,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 236 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:07,496 INFO L231 Difference]: Finished difference. Result has 137 places, 231 transitions, 1530 flow [2024-10-31 22:08:07,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1530, PETRI_PLACES=137, PETRI_TRANSITIONS=231} [2024-10-31 22:08:07,497 INFO L277 CegarLoopForPetriNet]: 128 programPoint places, 9 predicate places. [2024-10-31 22:08:07,498 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 231 transitions, 1530 flow [2024-10-31 22:08:07,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-10-31 22:08:07,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:07,499 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:07,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:08:07,499 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-31 22:08:07,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1721952119, now seen corresponding path program 1 times [2024-10-31 22:08:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161283004] [2024-10-31 22:08:07,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:07,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:08:07,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:08:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:08:07,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:08:07,552 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:08:07,552 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2024-10-31 22:08:07,552 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-10-31 22:08:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-10-31 22:08:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-10-31 22:08:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-10-31 22:08:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-10-31 22:08:07,553 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-10-31 22:08:07,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2024-10-31 22:08:07,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-10-31 22:08:07,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-10-31 22:08:07,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-10-31 22:08:07,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-10-31 22:08:07,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-10-31 22:08:07,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:08:07,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:07,556 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-31 22:08:07,556 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-31 22:08:07,599 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:08:07,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 161 transitions, 340 flow [2024-10-31 22:08:07,652 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-10-31 22:08:07,652 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-31 22:08:07,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 311 events. 18/311 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1199 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 234. Up to 8 conditions per place. [2024-10-31 22:08:07,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 161 transitions, 340 flow [2024-10-31 22:08:07,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 161 transitions, 340 flow [2024-10-31 22:08:07,663 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:08:07,664 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;@6a8f9ba6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:08:07,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-31 22:08:07,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:08:07,671 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2024-10-31 22:08:07,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:08:07,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:07,671 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:07,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:08:07,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1142734570, now seen corresponding path program 1 times [2024-10-31 22:08:07,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352716443] [2024-10-31 22:08:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:07,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352716443] [2024-10-31 22:08:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352716443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874485246] [2024-10-31 22:08:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:07,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:08:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:07,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:08:07,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:08:07,701 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2024-10-31 22:08:07,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 161 transitions, 340 flow. Second operand has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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-10-31 22:08:07,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:07,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2024-10-31 22:08:07,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:08,245 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2024-10-31 22:08:08,246 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-10-31 22:08:08,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 1732 events. 178/1732 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 14445 event pairs, 178 based on Foata normal form. 260/1709 useless extension candidates. Maximal degree in co-relation 1375. Up to 298 conditions per place. [2024-10-31 22:08:08,262 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2024-10-31 22:08:08,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2024-10-31 22:08:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:08:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-31 22:08:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2024-10-31 22:08:08,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2024-10-31 22:08:08,264 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 340 flow. Second operand 2 states and 294 transitions. [2024-10-31 22:08:08,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 144 transitions, 328 flow [2024-10-31 22:08:08,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 144 transitions, 326 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-31 22:08:08,267 INFO L231 Difference]: Finished difference. Result has 152 places, 144 transitions, 304 flow [2024-10-31 22:08:08,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=304, PETRI_PLACES=152, PETRI_TRANSITIONS=144} [2024-10-31 22:08:08,269 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2024-10-31 22:08:08,269 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 304 flow [2024-10-31 22:08:08,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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-10-31 22:08:08,269 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:08,269 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:08,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:08:08,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:08:08,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:08,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2146567085, now seen corresponding path program 1 times [2024-10-31 22:08:08,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:08,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012619378] [2024-10-31 22:08:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:08,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:08,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:08,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:08,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012619378] [2024-10-31 22:08:08,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012619378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735040894] [2024-10-31 22:08:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:08,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:08,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:08,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:08,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:08,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 161 [2024-10-31 22:08:08,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-10-31 22:08:08,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:08,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 161 [2024-10-31 22:08:08,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:11,333 INFO L124 PetriNetUnfolderBase]: 8153/23044 cut-off events. [2024-10-31 22:08:11,333 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2024-10-31 22:08:11,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34911 conditions, 23044 events. 8153/23044 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 266221 event pairs, 6332 based on Foata normal form. 0/19799 useless extension candidates. Maximal degree in co-relation 34905. Up to 10488 conditions per place. [2024-10-31 22:08:11,637 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 34 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2024-10-31 22:08:11,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 161 transitions, 430 flow [2024-10-31 22:08:11,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:11,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2024-10-31 22:08:11,643 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8364389233954451 [2024-10-31 22:08:11,643 INFO L175 Difference]: Start difference. First operand has 152 places, 144 transitions, 304 flow. Second operand 3 states and 404 transitions. [2024-10-31 22:08:11,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 161 transitions, 430 flow [2024-10-31 22:08:11,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 161 transitions, 430 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:08:11,647 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 398 flow [2024-10-31 22:08:11,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=398, PETRI_PLACES=156, PETRI_TRANSITIONS=155} [2024-10-31 22:08:11,650 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2024-10-31 22:08:11,650 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 398 flow [2024-10-31 22:08:11,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-10-31 22:08:11,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:11,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:11,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:08:11,651 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:08:11,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash -322995646, now seen corresponding path program 1 times [2024-10-31 22:08:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:11,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914839226] [2024-10-31 22:08:11,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914839226] [2024-10-31 22:08:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914839226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:11,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305744334] [2024-10-31 22:08:11,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:11,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:11,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:11,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:11,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:11,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 161 [2024-10-31 22:08:11,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 155 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-10-31 22:08:11,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:11,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 161 [2024-10-31 22:08:11,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:15,567 INFO L124 PetriNetUnfolderBase]: 11247/29861 cut-off events. [2024-10-31 22:08:15,568 INFO L125 PetriNetUnfolderBase]: For 7866/9081 co-relation queries the response was YES. [2024-10-31 22:08:15,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56111 conditions, 29861 events. 11247/29861 cut-off events. For 7866/9081 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 351640 event pairs, 6419 based on Foata normal form. 28/25419 useless extension candidates. Maximal degree in co-relation 56103. Up to 13140 conditions per place. [2024-10-31 22:08:15,934 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 42 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2024-10-31 22:08:15,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 180 transitions, 620 flow [2024-10-31 22:08:15,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:08:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:08:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2024-10-31 22:08:15,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8488612836438924 [2024-10-31 22:08:15,937 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 398 flow. Second operand 3 states and 410 transitions. [2024-10-31 22:08:15,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 180 transitions, 620 flow [2024-10-31 22:08:16,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 180 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:16,047 INFO L231 Difference]: Finished difference. Result has 158 places, 172 transitions, 546 flow [2024-10-31 22:08:16,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=158, PETRI_TRANSITIONS=172} [2024-10-31 22:08:16,050 INFO L277 CegarLoopForPetriNet]: 159 programPoint places, -1 predicate places. [2024-10-31 22:08:16,050 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 546 flow [2024-10-31 22:08:16,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 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-10-31 22:08:16,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:16,051 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:08:16,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:08:16,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2024-10-31 22:08:16,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:16,052 INFO L85 PathProgramCache]: Analyzing trace with hash -611458056, now seen corresponding path program 1 times [2024-10-31 22:08:16,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:16,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083341679] [2024-10-31 22:08:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:08:16,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:16,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083341679] [2024-10-31 22:08:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083341679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:16,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:16,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617100137] [2024-10-31 22:08:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:16,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:08:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:16,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:08:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:08:16,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 161 [2024-10-31 22:08:16,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 172 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-10-31 22:08:16,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:16,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 161 [2024-10-31 22:08:16,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:21,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([524] L693-5-->L693-6: Formula: (= |v_#race~c~0_13| 0) InVars {} OutVars{#race~c~0=|v_#race~c~0_13|} AuxVars[] AssignedVars[#race~c~0][148], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, 16#L693-6true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 70#L693-7true, 169#true, 108#L693-7true, 176#(= |#race~c~0| 0), Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 158#true]) [2024-10-31 22:08:21,892 INFO L294 olderBase$Statistics]: this new event has 84 ancestors and is cut-off event [2024-10-31 22:08:21,892 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:21,893 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:21,893 INFO L297 olderBase$Statistics]: existing Event has 84 ancestors and is cut-off event [2024-10-31 22:08:22,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][214], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 106#L693-4true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 160#true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 54#L693-14true, 158#true]) [2024-10-31 22:08:22,265 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-31 22:08:22,266 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 22:08:22,266 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 22:08:22,266 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 22:08:22,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][196], [106#L693-4true, 25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-10-31 22:08:22,289 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2024-10-31 22:08:22,290 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 22:08:22,290 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 22:08:22,290 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2024-10-31 22:08:23,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L693-13-->L693-14: Formula: (= |v_#race~c~0_7| |v_thr1Thread2of3ForFork0_#t~nondet3#1_3|) InVars {thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread2of3ForFork0_#t~nondet3#1=|v_thr1Thread2of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][125], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 160#true, 169#true, 91#L693-14true, 108#L693-7true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 174#true, 158#true]) [2024-10-31 22:08:23,027 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-31 22:08:23,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-31 22:08:23,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-31 22:08:23,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-31 22:08:23,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([554] L693-13-->L693-14: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet3#1_3| |v_#race~c~0_7|) InVars {thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} OutVars{#race~c~0=|v_#race~c~0_7|, thr1Thread3of3ForFork0_#t~nondet3#1=|v_thr1Thread3of3ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[#race~c~0][174], [25#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 147#L693-5true, 156#true, 162#true, Black: 166#(= |ULTIMATE.start_thr1_#t~nondet2#1| |#race~c~0|), 70#L693-7true, 160#true, 169#true, Black: 171#(= |#race~c~0| |thr1Thread1of3ForFork0_#t~nondet2#1|), 54#L693-14true, 174#true, 158#true]) [2024-10-31 22:08:23,030 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2024-10-31 22:08:23,030 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-31 22:08:23,030 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2024-10-31 22:08:23,030 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event