./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme --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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:42:43,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:42:43,779 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:42:43,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:42:43,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:42:43,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:42:43,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:42:43,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:42:43,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:42:43,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:42:43,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:42:43,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:42:43,839 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:42:43,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:42:43,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:42:43,842 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:42:43,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:42:43,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:42:43,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:42:43,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:42:43,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:42:43,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:42:43,846 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:42:43,846 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:42:43,847 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:42:43,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:42:43,848 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:42:43,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:42:43,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:42:43,850 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:42:43,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:42:43,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:42:43,852 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:42:43,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:42:43,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:42:43,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:42:43,853 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:42:43,853 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:42:43,854 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:42:43,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:42:43,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:42:43,855 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_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/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_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2023-11-26 10:42:44,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:42:44,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:42:44,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:42:44,305 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:42:44,306 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:42:44,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2023-11-26 10:42:47,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:42:47,772 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:42:47,773 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2023-11-26 10:42:47,791 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/data/5c6598e24/1cf2f0a88d0c4088a12e80627e603216/FLAGf79703d04 [2023-11-26 10:42:47,808 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/data/5c6598e24/1cf2f0a88d0c4088a12e80627e603216 [2023-11-26 10:42:47,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:42:47,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:42:47,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:42:47,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:42:47,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:42:47,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:42:47" (1/1) ... [2023-11-26 10:42:47,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b38bb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:47, skipping insertion in model container [2023-11-26 10:42:47,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:42:47" (1/1) ... [2023-11-26 10:42:47,854 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:42:48,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:42:48,100 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:42:48,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:42:48,168 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:42:48,168 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:42:48,176 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:42:48,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48 WrapperNode [2023-11-26 10:42:48,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:42:48,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:42:48,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:42:48,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:42:48,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,253 INFO L138 Inliner]: procedures = 25, calls = 47, calls flagged for inlining = 14, calls inlined = 20, statements flattened = 387 [2023-11-26 10:42:48,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:42:48,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:42:48,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:42:48,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:42:48,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:42:48,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:42:48,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:42:48,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:42:48,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (1/1) ... [2023-11-26 10:42:48,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:42:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:42:48,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:42:48,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:42:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:42:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:42:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:42:48,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 10:42:48,411 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 10:42:48,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 10:42:48,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 10:42:48,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 10:42:48,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 10:42:48,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 10:42:48,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:42:48,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:42:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:42:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-26 10:42:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:42:48,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:42:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:42:48,419 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:42:48,616 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:42:48,619 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:42:49,486 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:42:49,964 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:42:49,965 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-26 10:42:49,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:42:49 BoogieIcfgContainer [2023-11-26 10:42:49,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:42:49,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:42:49,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:42:49,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:42:49,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:42:47" (1/3) ... [2023-11-26 10:42:49,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d26dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:42:49, skipping insertion in model container [2023-11-26 10:42:49,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:42:48" (2/3) ... [2023-11-26 10:42:49,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d26dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:42:49, skipping insertion in model container [2023-11-26 10:42:49,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:42:49" (3/3) ... [2023-11-26 10:42:49,983 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2023-11-26 10:42:49,994 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:42:50,007 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:42:50,007 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-11-26 10:42:50,007 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:42:50,175 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 10:42:50,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 390 places, 400 transitions, 821 flow [2023-11-26 10:42:50,422 INFO L124 PetriNetUnfolderBase]: 20/397 cut-off events. [2023-11-26 10:42:50,423 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 10:42:50,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 397 events. 20/397 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 832 event pairs, 0 based on Foata normal form. 0/330 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2023-11-26 10:42:50,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 390 places, 400 transitions, 821 flow [2023-11-26 10:42:50,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 370 transitions, 758 flow [2023-11-26 10:42:50,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:42:50,476 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@715403b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:42:50,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2023-11-26 10:42:50,483 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:42:50,483 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-26 10:42:50,484 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:42:50,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:50,485 INFO L208 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] [2023-11-26 10:42:50,485 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:50,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1231075251, now seen corresponding path program 1 times [2023-11-26 10:42:50,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:50,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607622445] [2023-11-26 10:42:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607622445] [2023-11-26 10:42:50,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607622445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:50,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:50,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:50,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433902404] [2023-11-26 10:42:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:50,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:50,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:50,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:50,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 400 [2023-11-26 10:42:50,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 370 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:50,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:50,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 400 [2023-11-26 10:42:50,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:51,329 INFO L124 PetriNetUnfolderBase]: 32/713 cut-off events. [2023-11-26 10:42:51,330 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-11-26 10:42:51,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 713 events. 32/713 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3223 event pairs, 12 based on Foata normal form. 30/630 useless extension candidates. Maximal degree in co-relation 582. Up to 43 conditions per place. [2023-11-26 10:42:51,350 INFO L140 encePairwiseOnDemand]: 375/400 looper letters, 14 selfloop transitions, 2 changer transitions 3/347 dead transitions. [2023-11-26 10:42:51,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 347 transitions, 744 flow [2023-11-26 10:42:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1113 transitions. [2023-11-26 10:42:51,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9275 [2023-11-26 10:42:51,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1113 transitions. [2023-11-26 10:42:51,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1113 transitions. [2023-11-26 10:42:51,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:51,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1113 transitions. [2023-11-26 10:42:51,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,415 INFO L175 Difference]: Start difference. First operand has 362 places, 370 transitions, 758 flow. Second operand 3 states and 1113 transitions. [2023-11-26 10:42:51,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 347 transitions, 744 flow [2023-11-26 10:42:51,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 347 transitions, 732 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 10:42:51,435 INFO L231 Difference]: Finished difference. Result has 346 places, 344 transitions, 698 flow [2023-11-26 10:42:51,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=698, PETRI_PLACES=346, PETRI_TRANSITIONS=344} [2023-11-26 10:42:51,441 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -16 predicate places. [2023-11-26 10:42:51,442 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 344 transitions, 698 flow [2023-11-26 10:42:51,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:51,444 INFO L208 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] [2023-11-26 10:42:51,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:42:51,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:51,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:51,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1425325933, now seen corresponding path program 1 times [2023-11-26 10:42:51,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:51,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640439444] [2023-11-26 10:42:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:51,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:51,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640439444] [2023-11-26 10:42:51,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640439444] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:51,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:51,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:51,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509533398] [2023-11-26 10:42:51,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:51,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:51,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:51,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 400 [2023-11-26 10:42:51,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 344 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:51,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 400 [2023-11-26 10:42:51,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:51,852 INFO L124 PetriNetUnfolderBase]: 23/691 cut-off events. [2023-11-26 10:42:51,852 INFO L125 PetriNetUnfolderBase]: For 7/10 co-relation queries the response was YES. [2023-11-26 10:42:51,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 691 events. 23/691 cut-off events. For 7/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3148 event pairs, 8 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 705. Up to 35 conditions per place. [2023-11-26 10:42:51,866 INFO L140 encePairwiseOnDemand]: 397/400 looper letters, 14 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2023-11-26 10:42:51,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 343 transitions, 728 flow [2023-11-26 10:42:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:51,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2023-11-26 10:42:51,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9091666666666667 [2023-11-26 10:42:51,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2023-11-26 10:42:51,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2023-11-26 10:42:51,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:51,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2023-11-26 10:42:51,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,912 INFO L175 Difference]: Start difference. First operand has 346 places, 344 transitions, 698 flow. Second operand 3 states and 1091 transitions. [2023-11-26 10:42:51,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 343 transitions, 728 flow [2023-11-26 10:42:51,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 343 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:51,922 INFO L231 Difference]: Finished difference. Result has 342 places, 343 transitions, 696 flow [2023-11-26 10:42:51,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=696, PETRI_PLACES=342, PETRI_TRANSITIONS=343} [2023-11-26 10:42:51,924 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -20 predicate places. [2023-11-26 10:42:51,924 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 343 transitions, 696 flow [2023-11-26 10:42:51,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:51,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:51,926 INFO L208 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] [2023-11-26 10:42:51,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:42:51,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:51,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1180099474, now seen corresponding path program 1 times [2023-11-26 10:42:51,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879456521] [2023-11-26 10:42:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:51,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:51,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879456521] [2023-11-26 10:42:51,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879456521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:51,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:51,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:51,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925233904] [2023-11-26 10:42:51,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:51,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:51,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:51,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:51,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:52,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 400 [2023-11-26 10:42:52,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 343 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:52,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:52,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 400 [2023-11-26 10:42:52,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:52,169 INFO L124 PetriNetUnfolderBase]: 35/644 cut-off events. [2023-11-26 10:42:52,169 INFO L125 PetriNetUnfolderBase]: For 10/17 co-relation queries the response was YES. [2023-11-26 10:42:52,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 644 events. 35/644 cut-off events. For 10/17 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2830 event pairs, 16 based on Foata normal form. 0/553 useless extension candidates. Maximal degree in co-relation 673. Up to 56 conditions per place. [2023-11-26 10:42:52,183 INFO L140 encePairwiseOnDemand]: 395/400 looper letters, 15 selfloop transitions, 1 changer transitions 0/339 dead transitions. [2023-11-26 10:42:52,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 339 transitions, 720 flow [2023-11-26 10:42:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2023-11-26 10:42:52,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2023-11-26 10:42:52,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1088 transitions. [2023-11-26 10:42:52,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1088 transitions. [2023-11-26 10:42:52,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:52,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1088 transitions. [2023-11-26 10:42:52,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:52,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:52,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:52,199 INFO L175 Difference]: Start difference. First operand has 342 places, 343 transitions, 696 flow. Second operand 3 states and 1088 transitions. [2023-11-26 10:42:52,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 339 transitions, 720 flow [2023-11-26 10:42:52,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 339 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:52,208 INFO L231 Difference]: Finished difference. Result has 338 places, 339 transitions, 686 flow [2023-11-26 10:42:52,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=338, PETRI_TRANSITIONS=339} [2023-11-26 10:42:52,210 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -24 predicate places. [2023-11-26 10:42:52,210 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 339 transitions, 686 flow [2023-11-26 10:42:52,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:52,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:52,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:52,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:42:52,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:52,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:52,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1703228900, now seen corresponding path program 1 times [2023-11-26 10:42:52,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:52,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498020886] [2023-11-26 10:42:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:52,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:52,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498020886] [2023-11-26 10:42:52,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498020886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:52,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:42:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295219892] [2023-11-26 10:42:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:52,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:42:52,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:52,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:42:52,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:42:53,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 400 [2023-11-26 10:42:53,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 339 transitions, 686 flow. Second operand has 6 states, 6 states have (on average 328.5) internal successors, (1971), 6 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:53,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:53,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 400 [2023-11-26 10:42:53,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:56,331 INFO L124 PetriNetUnfolderBase]: 2430/11913 cut-off events. [2023-11-26 10:42:56,332 INFO L125 PetriNetUnfolderBase]: For 61/201 co-relation queries the response was YES. [2023-11-26 10:42:56,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15364 conditions, 11913 events. 2430/11913 cut-off events. For 61/201 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 130026 event pairs, 1966 based on Foata normal form. 0/10015 useless extension candidates. Maximal degree in co-relation 15325. Up to 3352 conditions per place. [2023-11-26 10:42:56,506 INFO L140 encePairwiseOnDemand]: 394/400 looper letters, 43 selfloop transitions, 5 changer transitions 0/338 dead transitions. [2023-11-26 10:42:56,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 338 transitions, 780 flow [2023-11-26 10:42:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:42:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:42:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2011 transitions. [2023-11-26 10:42:56,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8379166666666666 [2023-11-26 10:42:56,514 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2011 transitions. [2023-11-26 10:42:56,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2011 transitions. [2023-11-26 10:42:56,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:56,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2011 transitions. [2023-11-26 10:42:56,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 335.1666666666667) internal successors, (2011), 6 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,532 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,532 INFO L175 Difference]: Start difference. First operand has 338 places, 339 transitions, 686 flow. Second operand 6 states and 2011 transitions. [2023-11-26 10:42:56,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 338 transitions, 780 flow [2023-11-26 10:42:56,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 338 transitions, 779 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:42:56,541 INFO L231 Difference]: Finished difference. Result has 341 places, 338 transitions, 693 flow [2023-11-26 10:42:56,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=693, PETRI_PLACES=341, PETRI_TRANSITIONS=338} [2023-11-26 10:42:56,543 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -21 predicate places. [2023-11-26 10:42:56,543 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 338 transitions, 693 flow [2023-11-26 10:42:56,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 328.5) internal successors, (1971), 6 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:56,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:56,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:42:56,546 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:56,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:56,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1578714446, now seen corresponding path program 1 times [2023-11-26 10:42:56,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:56,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917978001] [2023-11-26 10:42:56,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:56,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917978001] [2023-11-26 10:42:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917978001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:56,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:56,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:56,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045536599] [2023-11-26 10:42:56,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:56,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:56,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:56,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 400 [2023-11-26 10:42:56,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 338 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:56,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 400 [2023-11-26 10:42:56,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:56,874 INFO L124 PetriNetUnfolderBase]: 62/816 cut-off events. [2023-11-26 10:42:56,875 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-26 10:42:56,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 816 events. 62/816 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4263 event pairs, 38 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 907. Up to 86 conditions per place. [2023-11-26 10:42:56,891 INFO L140 encePairwiseOnDemand]: 397/400 looper letters, 14 selfloop transitions, 2 changer transitions 0/337 dead transitions. [2023-11-26 10:42:56,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 337 transitions, 723 flow [2023-11-26 10:42:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2023-11-26 10:42:56,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9091666666666667 [2023-11-26 10:42:56,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2023-11-26 10:42:56,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2023-11-26 10:42:56,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:56,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2023-11-26 10:42:56,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,907 INFO L175 Difference]: Start difference. First operand has 341 places, 338 transitions, 693 flow. Second operand 3 states and 1091 transitions. [2023-11-26 10:42:56,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 337 transitions, 723 flow [2023-11-26 10:42:56,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 337 transitions, 713 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 10:42:56,915 INFO L231 Difference]: Finished difference. Result has 337 places, 337 transitions, 685 flow [2023-11-26 10:42:56,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=685, PETRI_PLACES=337, PETRI_TRANSITIONS=337} [2023-11-26 10:42:56,919 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -25 predicate places. [2023-11-26 10:42:56,919 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 337 transitions, 685 flow [2023-11-26 10:42:56,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.3333333333333) internal successors, (1078), 3 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:56,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:56,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:56,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:42:56,922 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:56,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2083673395, now seen corresponding path program 1 times [2023-11-26 10:42:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:56,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270254305] [2023-11-26 10:42:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:56,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:56,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270254305] [2023-11-26 10:42:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270254305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:56,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:56,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:56,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820164406] [2023-11-26 10:42:56,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:56,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:56,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:56,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:57,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 400 [2023-11-26 10:42:57,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 337 transitions, 685 flow. Second operand has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:57,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 400 [2023-11-26 10:42:57,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:57,147 INFO L124 PetriNetUnfolderBase]: 52/673 cut-off events. [2023-11-26 10:42:57,147 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-26 10:42:57,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 673 events. 52/673 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3095 event pairs, 28 based on Foata normal form. 0/583 useless extension candidates. Maximal degree in co-relation 718. Up to 73 conditions per place. [2023-11-26 10:42:57,157 INFO L140 encePairwiseOnDemand]: 395/400 looper letters, 15 selfloop transitions, 1 changer transitions 0/333 dead transitions. [2023-11-26 10:42:57,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 333 transitions, 709 flow [2023-11-26 10:42:57,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1088 transitions. [2023-11-26 10:42:57,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2023-11-26 10:42:57,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1088 transitions. [2023-11-26 10:42:57,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1088 transitions. [2023-11-26 10:42:57,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:57,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1088 transitions. [2023-11-26 10:42:57,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,170 INFO L175 Difference]: Start difference. First operand has 337 places, 337 transitions, 685 flow. Second operand 3 states and 1088 transitions. [2023-11-26 10:42:57,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 333 transitions, 709 flow [2023-11-26 10:42:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 333 transitions, 705 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:57,178 INFO L231 Difference]: Finished difference. Result has 333 places, 333 transitions, 675 flow [2023-11-26 10:42:57,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=333, PETRI_TRANSITIONS=333} [2023-11-26 10:42:57,180 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -29 predicate places. [2023-11-26 10:42:57,180 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 333 transitions, 675 flow [2023-11-26 10:42:57,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:57,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:57,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:42:57,182 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:57,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:57,182 INFO L85 PathProgramCache]: Analyzing trace with hash 208486899, now seen corresponding path program 1 times [2023-11-26 10:42:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469896166] [2023-11-26 10:42:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:57,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:57,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:57,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469896166] [2023-11-26 10:42:57,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469896166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:57,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:57,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881996273] [2023-11-26 10:42:57,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:57,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:57,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:57,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:57,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:57,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 400 [2023-11-26 10:42:57,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 333 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:57,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 400 [2023-11-26 10:42:57,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:57,408 INFO L124 PetriNetUnfolderBase]: 35/593 cut-off events. [2023-11-26 10:42:57,409 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2023-11-26 10:42:57,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 593 events. 35/593 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2469 event pairs, 5 based on Foata normal form. 1/533 useless extension candidates. Maximal degree in co-relation 628. Up to 33 conditions per place. [2023-11-26 10:42:57,419 INFO L140 encePairwiseOnDemand]: 394/400 looper letters, 14 selfloop transitions, 3 changer transitions 0/333 dead transitions. [2023-11-26 10:42:57,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 333 transitions, 711 flow [2023-11-26 10:42:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:57,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1097 transitions. [2023-11-26 10:42:57,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9141666666666667 [2023-11-26 10:42:57,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1097 transitions. [2023-11-26 10:42:57,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1097 transitions. [2023-11-26 10:42:57,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:57,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1097 transitions. [2023-11-26 10:42:57,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 365.6666666666667) internal successors, (1097), 3 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,435 INFO L175 Difference]: Start difference. First operand has 333 places, 333 transitions, 675 flow. Second operand 3 states and 1097 transitions. [2023-11-26 10:42:57,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 333 transitions, 711 flow [2023-11-26 10:42:57,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 333 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:42:57,445 INFO L231 Difference]: Finished difference. Result has 331 places, 330 transitions, 674 flow [2023-11-26 10:42:57,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=331, PETRI_TRANSITIONS=330} [2023-11-26 10:42:57,447 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -31 predicate places. [2023-11-26 10:42:57,447 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 330 transitions, 674 flow [2023-11-26 10:42:57,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:57,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:57,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:42:57,453 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:57,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1507514059, now seen corresponding path program 1 times [2023-11-26 10:42:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:57,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761697182] [2023-11-26 10:42:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:57,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:57,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:57,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761697182] [2023-11-26 10:42:57,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761697182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:57,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:57,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699035286] [2023-11-26 10:42:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:57,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:57,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:57,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:57,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:57,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 400 [2023-11-26 10:42:57,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 330 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 357.3333333333333) internal successors, (1072), 3 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:57,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:57,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 400 [2023-11-26 10:42:57,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:58,107 INFO L124 PetriNetUnfolderBase]: 237/2201 cut-off events. [2023-11-26 10:42:58,107 INFO L125 PetriNetUnfolderBase]: For 37/38 co-relation queries the response was YES. [2023-11-26 10:42:58,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 2201 events. 237/2201 cut-off events. For 37/38 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 15886 event pairs, 61 based on Foata normal form. 0/1937 useless extension candidates. Maximal degree in co-relation 2541. Up to 307 conditions per place. [2023-11-26 10:42:58,141 INFO L140 encePairwiseOnDemand]: 393/400 looper letters, 21 selfloop transitions, 3 changer transitions 0/334 dead transitions. [2023-11-26 10:42:58,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 334 transitions, 735 flow [2023-11-26 10:42:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1096 transitions. [2023-11-26 10:42:58,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9133333333333333 [2023-11-26 10:42:58,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1096 transitions. [2023-11-26 10:42:58,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1096 transitions. [2023-11-26 10:42:58,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:58,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1096 transitions. [2023-11-26 10:42:58,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,158 INFO L175 Difference]: Start difference. First operand has 331 places, 330 transitions, 674 flow. Second operand 3 states and 1096 transitions. [2023-11-26 10:42:58,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 334 transitions, 735 flow [2023-11-26 10:42:58,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 334 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:58,168 INFO L231 Difference]: Finished difference. Result has 328 places, 329 transitions, 681 flow [2023-11-26 10:42:58,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=681, PETRI_PLACES=328, PETRI_TRANSITIONS=329} [2023-11-26 10:42:58,170 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -34 predicate places. [2023-11-26 10:42:58,170 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 329 transitions, 681 flow [2023-11-26 10:42:58,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.3333333333333) internal successors, (1072), 3 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:58,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:58,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:42:58,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:58,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:58,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1298475331, now seen corresponding path program 1 times [2023-11-26 10:42:58,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:58,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718099430] [2023-11-26 10:42:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:58,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:58,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718099430] [2023-11-26 10:42:58,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718099430] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:58,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:58,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:42:58,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298322978] [2023-11-26 10:42:58,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:58,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:42:58,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:58,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:42:58,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:42:58,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 400 [2023-11-26 10:42:58,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 329 transitions, 681 flow. Second operand has 3 states, 3 states have (on average 357.3333333333333) internal successors, (1072), 3 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:58,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 400 [2023-11-26 10:42:58,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:58,576 INFO L124 PetriNetUnfolderBase]: 121/1078 cut-off events. [2023-11-26 10:42:58,577 INFO L125 PetriNetUnfolderBase]: For 88/97 co-relation queries the response was YES. [2023-11-26 10:42:58,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 1078 events. 121/1078 cut-off events. For 88/97 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6301 event pairs, 18 based on Foata normal form. 0/971 useless extension candidates. Maximal degree in co-relation 1308. Up to 116 conditions per place. [2023-11-26 10:42:58,594 INFO L140 encePairwiseOnDemand]: 393/400 looper letters, 18 selfloop transitions, 3 changer transitions 0/329 dead transitions. [2023-11-26 10:42:58,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 329 transitions, 730 flow [2023-11-26 10:42:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:42:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:42:58,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2023-11-26 10:42:58,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9091666666666667 [2023-11-26 10:42:58,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1091 transitions. [2023-11-26 10:42:58,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1091 transitions. [2023-11-26 10:42:58,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:58,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1091 transitions. [2023-11-26 10:42:58,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 363.6666666666667) internal successors, (1091), 3 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,610 INFO L175 Difference]: Start difference. First operand has 328 places, 329 transitions, 681 flow. Second operand 3 states and 1091 transitions. [2023-11-26 10:42:58,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 329 transitions, 730 flow [2023-11-26 10:42:58,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 329 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:42:58,620 INFO L231 Difference]: Finished difference. Result has 326 places, 325 transitions, 679 flow [2023-11-26 10:42:58,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=326, PETRI_TRANSITIONS=325} [2023-11-26 10:42:58,622 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -36 predicate places. [2023-11-26 10:42:58,622 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 325 transitions, 679 flow [2023-11-26 10:42:58,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.3333333333333) internal successors, (1072), 3 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:58,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:58,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:58,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:42:58,632 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:58,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash -283788647, now seen corresponding path program 1 times [2023-11-26 10:42:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:58,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685289051] [2023-11-26 10:42:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:42:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:42:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:42:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685289051] [2023-11-26 10:42:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685289051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:42:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:42:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:42:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877449254] [2023-11-26 10:42:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:42:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:42:58,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:42:58,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:42:58,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:42:59,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 400 [2023-11-26 10:42:59,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 325 transitions, 679 flow. Second operand has 7 states, 7 states have (on average 355.85714285714283) internal successors, (2491), 7 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:59,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:42:59,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 400 [2023-11-26 10:42:59,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:42:59,681 INFO L124 PetriNetUnfolderBase]: 109/1244 cut-off events. [2023-11-26 10:42:59,681 INFO L125 PetriNetUnfolderBase]: For 80/133 co-relation queries the response was YES. [2023-11-26 10:42:59,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 1244 events. 109/1244 cut-off events. For 80/133 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7233 event pairs, 34 based on Foata normal form. 7/1134 useless extension candidates. Maximal degree in co-relation 1508. Up to 106 conditions per place. [2023-11-26 10:42:59,707 INFO L140 encePairwiseOnDemand]: 387/400 looper letters, 28 selfloop transitions, 14 changer transitions 0/344 dead transitions. [2023-11-26 10:42:59,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 344 transitions, 819 flow [2023-11-26 10:42:59,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:42:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 10:42:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3580 transitions. [2023-11-26 10:42:59,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.895 [2023-11-26 10:42:59,723 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3580 transitions. [2023-11-26 10:42:59,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3580 transitions. [2023-11-26 10:42:59,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:42:59,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3580 transitions. [2023-11-26 10:42:59,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 358.0) internal successors, (3580), 10 states have internal predecessors, (3580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:59,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 400.0) internal successors, (4400), 11 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:59,756 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 400.0) internal successors, (4400), 11 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:59,757 INFO L175 Difference]: Start difference. First operand has 326 places, 325 transitions, 679 flow. Second operand 10 states and 3580 transitions. [2023-11-26 10:42:59,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 344 transitions, 819 flow [2023-11-26 10:42:59,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 344 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:42:59,768 INFO L231 Difference]: Finished difference. Result has 337 places, 332 transitions, 739 flow [2023-11-26 10:42:59,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=739, PETRI_PLACES=337, PETRI_TRANSITIONS=332} [2023-11-26 10:42:59,771 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -25 predicate places. [2023-11-26 10:42:59,771 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 332 transitions, 739 flow [2023-11-26 10:42:59,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 355.85714285714283) internal successors, (2491), 7 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:42:59,772 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:42:59,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:42:59,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:42:59,773 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:42:59,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:42:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash 937916812, now seen corresponding path program 1 times [2023-11-26 10:42:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:42:59,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517434885] [2023-11-26 10:42:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:42:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:42:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:00,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:00,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:00,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517434885] [2023-11-26 10:43:00,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517434885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:00,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:00,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:00,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178166245] [2023-11-26 10:43:00,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:00,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:00,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:00,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:00,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 400 [2023-11-26 10:43:00,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 332 transitions, 739 flow. Second operand has 6 states, 6 states have (on average 356.6666666666667) internal successors, (2140), 6 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:00,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:00,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 400 [2023-11-26 10:43:00,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:01,399 INFO L124 PetriNetUnfolderBase]: 133/1118 cut-off events. [2023-11-26 10:43:01,399 INFO L125 PetriNetUnfolderBase]: For 124/247 co-relation queries the response was YES. [2023-11-26 10:43:01,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1118 events. 133/1118 cut-off events. For 124/247 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6050 event pairs, 1 based on Foata normal form. 24/1039 useless extension candidates. Maximal degree in co-relation 1445. Up to 126 conditions per place. [2023-11-26 10:43:01,422 INFO L140 encePairwiseOnDemand]: 395/400 looper letters, 23 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2023-11-26 10:43:01,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 339 transitions, 827 flow [2023-11-26 10:43:01,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:43:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2023-11-26 10:43:01,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8970833333333333 [2023-11-26 10:43:01,431 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2153 transitions. [2023-11-26 10:43:01,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2153 transitions. [2023-11-26 10:43:01,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:01,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2153 transitions. [2023-11-26 10:43:01,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 358.8333333333333) internal successors, (2153), 6 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:01,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:01,445 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:01,446 INFO L175 Difference]: Start difference. First operand has 337 places, 332 transitions, 739 flow. Second operand 6 states and 2153 transitions. [2023-11-26 10:43:01,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 339 transitions, 827 flow [2023-11-26 10:43:01,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 339 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:43:01,454 INFO L231 Difference]: Finished difference. Result has 340 places, 331 transitions, 741 flow [2023-11-26 10:43:01,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=340, PETRI_TRANSITIONS=331} [2023-11-26 10:43:01,456 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -22 predicate places. [2023-11-26 10:43:01,456 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 331 transitions, 741 flow [2023-11-26 10:43:01,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 356.6666666666667) internal successors, (2140), 6 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:01,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:01,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:01,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:43:01,457 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:01,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:01,458 INFO L85 PathProgramCache]: Analyzing trace with hash -369460759, now seen corresponding path program 1 times [2023-11-26 10:43:01,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:01,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506376825] [2023-11-26 10:43:01,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:01,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:01,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:01,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506376825] [2023-11-26 10:43:01,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506376825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:01,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:01,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:01,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128924769] [2023-11-26 10:43:01,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:01,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:43:01,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:01,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:43:01,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:43:01,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 400 [2023-11-26 10:43:01,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 331 transitions, 741 flow. Second operand has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:01,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:01,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 400 [2023-11-26 10:43:01,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:02,281 INFO L124 PetriNetUnfolderBase]: 223/2462 cut-off events. [2023-11-26 10:43:02,281 INFO L125 PetriNetUnfolderBase]: For 201/217 co-relation queries the response was YES. [2023-11-26 10:43:02,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3094 conditions, 2462 events. 223/2462 cut-off events. For 201/217 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 18949 event pairs, 68 based on Foata normal form. 11/2244 useless extension candidates. Maximal degree in co-relation 3045. Up to 218 conditions per place. [2023-11-26 10:43:02,317 INFO L140 encePairwiseOnDemand]: 394/400 looper letters, 30 selfloop transitions, 5 changer transitions 0/346 dead transitions. [2023-11-26 10:43:02,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 346 transitions, 859 flow [2023-11-26 10:43:02,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:43:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:43:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1813 transitions. [2023-11-26 10:43:02,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9065 [2023-11-26 10:43:02,324 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1813 transitions. [2023-11-26 10:43:02,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1813 transitions. [2023-11-26 10:43:02,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:02,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1813 transitions. [2023-11-26 10:43:02,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 362.6) internal successors, (1813), 5 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:02,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:02,337 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 400.0) internal successors, (2400), 6 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:02,337 INFO L175 Difference]: Start difference. First operand has 340 places, 331 transitions, 741 flow. Second operand 5 states and 1813 transitions. [2023-11-26 10:43:02,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 346 transitions, 859 flow [2023-11-26 10:43:02,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 346 transitions, 852 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:43:02,349 INFO L231 Difference]: Finished difference. Result has 342 places, 333 transitions, 759 flow [2023-11-26 10:43:02,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=342, PETRI_TRANSITIONS=333} [2023-11-26 10:43:02,352 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -20 predicate places. [2023-11-26 10:43:02,352 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 333 transitions, 759 flow [2023-11-26 10:43:02,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 358.0) internal successors, (1790), 5 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:02,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:02,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:02,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:43:02,355 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:02,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:02,355 INFO L85 PathProgramCache]: Analyzing trace with hash -427117438, now seen corresponding path program 1 times [2023-11-26 10:43:02,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:02,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353954123] [2023-11-26 10:43:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:02,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:02,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:02,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353954123] [2023-11-26 10:43:02,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353954123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:02,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:02,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:02,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326256963] [2023-11-26 10:43:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:02,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:02,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:02,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:02,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:03,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 400 [2023-11-26 10:43:03,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 333 transitions, 759 flow. Second operand has 6 states, 6 states have (on average 349.6666666666667) internal successors, (2098), 6 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:03,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:03,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 400 [2023-11-26 10:43:03,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:04,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L64-->L67: Formula: (let ((.cse15 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse3 (+ .cse15 v_~A~0.offset_222))) (let ((.cse7 (select (select |v_#memory_int_133| v_~A~0.base_222) .cse3))) (let ((.cse8 (+ v_~mts3~0_159 .cse7))) (let ((.cse0 (<= .cse8 2147483647)) (.cse1 (<= .cse7 0)) (.cse2 (select |v_#race_483| v_~A~0.base_222)) (.cse5 (+ .cse15 v_~A~0.offset_222 1)) (.cse9 (+ .cse15 v_~A~0.offset_222 3)) (.cse12 (select |v_#race_471| v_~A~0.base_222)) (.cse6 (+ .cse15 v_~A~0.offset_222 2)) (.cse14 (<= 0 .cse7)) (.cse13 (<= 0 (+ v_~mts3~0_159 2147483648 .cse7)))) (and (not (= (ite (or .cse0 .cse1) 1 0) 0)) .cse0 (<= 0 (+ v_~sum~0_93 2147483648)) (let ((.cse4 (= |v_#race~A~0_277| 0)) (.cse10 (= |v_#race~mts3~0_254| 0)) (.cse11 (= |v_#race_483| (store |v_#race_472| v_~A~0.base_222 (store (store (store (store (select |v_#race_472| v_~A~0.base_222) .cse3 0) .cse5 0) .cse6 0) .cse9 0))))) (or (and (= (select .cse2 .cse3) 0) .cse4 (= (select .cse2 .cse5) 0) (= (select .cse2 .cse6) 0) (= |v_thread3_#t~mem16#1_180| .cse7) (<= 0 .cse8) (= (select .cse2 .cse9) 0) .cse10 (= (+ |v_thread3_#t~mem16#1_180| v_~mts3~0_159) v_~mts3~0_158) .cse11) (and .cse4 (= v_~mts3~0_158 0) (< .cse8 0) (= |v_thread3Thread1of1ForFork1_#t~mem16#1_13| |v_thread3_#t~mem16#1_180|) .cse10 .cse11))) (= 0 (select .cse12 .cse3)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647) .cse1) 1 0) 0)) .cse13 (= |v_#race_471| (store |v_#race_483| v_~A~0.base_222 (store (store (store (store .cse2 .cse3 0) .cse5 0) .cse6 0) .cse9 0))) (= (select .cse12 .cse5) 0) (<= v_~sum~0_93 2147483647) (= (select .cse12 .cse9) 0) (= v_~sum~0_93 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or .cse14 (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648))) 1 0) 0)) (= (select .cse12 .cse6) 0) (= |v_thread3Thread1of1ForFork1_plus_#res#1_17| (+ v_~sum~0_94 .cse7)) (not (= (ite (or .cse14 .cse13) 1 0) 0)) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_472|, thread3Thread1of1ForFork1_#t~mem16#1=|v_thread3Thread1of1ForFork1_#t~mem16#1_13|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_133|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|} OutVars{~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_11|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~mem19#1=|v_thread3Thread1of1ForFork1_#t~mem19#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~nondet21#1=|v_thread3Thread1of1ForFork1_#t~nondet21#1_3|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #race~sum~0=|v_#race~sum~0_123|, thread3Thread1of1ForFork1_#t~ite17#1=|v_thread3Thread1of1ForFork1_#t~ite17#1_11|, #race=|v_#race_471|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork1_#t~ret20#1=|v_thread3Thread1of1ForFork1_#t~ret20#1_3|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_17|, #memory_int=|v_#memory_int_133|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~mem14#1=|v_thread3Thread1of1ForFork1_#t~mem14#1_19|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_#race_483|, |v_#race~mts3~0_254|, |v_thread3_#t~mem16#1_180|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~nondet18#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~mem19#1, thread3Thread1of1ForFork1_#t~nondet21#1, ~sum~0, #race~mts3~0, thread3Thread1of1ForFork1_#t~mem16#1, ~mts3~0, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret20#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~ite17#1, thread3Thread1of1ForFork1_#t~mem14#1, #race~A~0][185], [418#(= |#race~M~0| 0), Black: 445#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 462#true, Black: 443#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 438#(<= ~N~0 0), Black: 439#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 470#true, 403#(= |#race~N~0| 0), 91#L59true, 426#(= |#race~A~0| 0), Black: 424#true, Black: 466#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 465#(<= (+ ~M~0 1) 0), 221#L86-4true, 207#L67true, 223#L48-3true]) [2023-11-26 10:43:04,153 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2023-11-26 10:43:04,153 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 10:43:04,153 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 10:43:04,154 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 10:43:04,368 INFO L124 PetriNetUnfolderBase]: 408/2731 cut-off events. [2023-11-26 10:43:04,368 INFO L125 PetriNetUnfolderBase]: For 465/479 co-relation queries the response was YES. [2023-11-26 10:43:04,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 2731 events. 408/2731 cut-off events. For 465/479 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 21744 event pairs, 71 based on Foata normal form. 0/2469 useless extension candidates. Maximal degree in co-relation 3772. Up to 281 conditions per place. [2023-11-26 10:43:04,400 INFO L140 encePairwiseOnDemand]: 393/400 looper letters, 36 selfloop transitions, 5 changer transitions 0/343 dead transitions. [2023-11-26 10:43:04,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 343 transitions, 877 flow [2023-11-26 10:43:04,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:43:04,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2128 transitions. [2023-11-26 10:43:04,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2023-11-26 10:43:04,407 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2128 transitions. [2023-11-26 10:43:04,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2128 transitions. [2023-11-26 10:43:04,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:04,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2128 transitions. [2023-11-26 10:43:04,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 354.6666666666667) internal successors, (2128), 6 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:04,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:04,420 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:04,420 INFO L175 Difference]: Start difference. First operand has 342 places, 333 transitions, 759 flow. Second operand 6 states and 2128 transitions. [2023-11-26 10:43:04,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 343 transitions, 877 flow [2023-11-26 10:43:04,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 343 transitions, 872 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:04,430 INFO L231 Difference]: Finished difference. Result has 343 places, 331 transitions, 760 flow [2023-11-26 10:43:04,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=760, PETRI_PLACES=343, PETRI_TRANSITIONS=331} [2023-11-26 10:43:04,431 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -19 predicate places. [2023-11-26 10:43:04,432 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 331 transitions, 760 flow [2023-11-26 10:43:04,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.6666666666667) internal successors, (2098), 6 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:04,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:04,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:04,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:43:04,433 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:04,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1702417987, now seen corresponding path program 1 times [2023-11-26 10:43:04,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:04,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220141289] [2023-11-26 10:43:04,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:04,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:43:04,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:04,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220141289] [2023-11-26 10:43:04,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220141289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:04,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:04,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:04,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312562555] [2023-11-26 10:43:04,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:04,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:05,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 400 [2023-11-26 10:43:05,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 331 transitions, 760 flow. Second operand has 6 states, 6 states have (on average 350.1666666666667) internal successors, (2101), 6 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:05,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:05,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 400 [2023-11-26 10:43:05,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:06,221 INFO L124 PetriNetUnfolderBase]: 251/2025 cut-off events. [2023-11-26 10:43:06,222 INFO L125 PetriNetUnfolderBase]: For 261/353 co-relation queries the response was YES. [2023-11-26 10:43:06,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 2025 events. 251/2025 cut-off events. For 261/353 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14855 event pairs, 50 based on Foata normal form. 4/1880 useless extension candidates. Maximal degree in co-relation 2845. Up to 221 conditions per place. [2023-11-26 10:43:06,256 INFO L140 encePairwiseOnDemand]: 393/400 looper letters, 36 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2023-11-26 10:43:06,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 341 transitions, 878 flow [2023-11-26 10:43:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:43:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2128 transitions. [2023-11-26 10:43:06,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2023-11-26 10:43:06,264 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2128 transitions. [2023-11-26 10:43:06,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2128 transitions. [2023-11-26 10:43:06,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:06,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2128 transitions. [2023-11-26 10:43:06,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 354.6666666666667) internal successors, (2128), 6 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:06,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:06,279 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:06,279 INFO L175 Difference]: Start difference. First operand has 343 places, 331 transitions, 760 flow. Second operand 6 states and 2128 transitions. [2023-11-26 10:43:06,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 341 transitions, 878 flow [2023-11-26 10:43:06,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 341 transitions, 868 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 10:43:06,291 INFO L231 Difference]: Finished difference. Result has 341 places, 329 transitions, 756 flow [2023-11-26 10:43:06,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=756, PETRI_PLACES=341, PETRI_TRANSITIONS=329} [2023-11-26 10:43:06,293 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -21 predicate places. [2023-11-26 10:43:06,293 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 329 transitions, 756 flow [2023-11-26 10:43:06,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 350.1666666666667) internal successors, (2101), 6 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:06,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:06,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:06,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:43:06,295 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:06,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 344327597, now seen corresponding path program 1 times [2023-11-26 10:43:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:06,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113063706] [2023-11-26 10:43:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:06,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113063706] [2023-11-26 10:43:06,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113063706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:06,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:06,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183674622] [2023-11-26 10:43:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:07,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 400 [2023-11-26 10:43:07,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 329 transitions, 756 flow. Second operand has 6 states, 6 states have (on average 356.8333333333333) internal successors, (2141), 6 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:07,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:07,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 400 [2023-11-26 10:43:07,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:07,681 INFO L124 PetriNetUnfolderBase]: 152/1537 cut-off events. [2023-11-26 10:43:07,682 INFO L125 PetriNetUnfolderBase]: For 159/221 co-relation queries the response was YES. [2023-11-26 10:43:07,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2090 conditions, 1537 events. 152/1537 cut-off events. For 159/221 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9778 event pairs, 7 based on Foata normal form. 8/1449 useless extension candidates. Maximal degree in co-relation 2040. Up to 147 conditions per place. [2023-11-26 10:43:07,706 INFO L140 encePairwiseOnDemand]: 395/400 looper letters, 23 selfloop transitions, 4 changer transitions 0/336 dead transitions. [2023-11-26 10:43:07,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 336 transitions, 844 flow [2023-11-26 10:43:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:43:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2023-11-26 10:43:07,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8970833333333333 [2023-11-26 10:43:07,714 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2153 transitions. [2023-11-26 10:43:07,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2153 transitions. [2023-11-26 10:43:07,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:07,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2153 transitions. [2023-11-26 10:43:07,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 358.8333333333333) internal successors, (2153), 6 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:07,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:07,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:07,730 INFO L175 Difference]: Start difference. First operand has 341 places, 329 transitions, 756 flow. Second operand 6 states and 2153 transitions. [2023-11-26 10:43:07,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 336 transitions, 844 flow [2023-11-26 10:43:07,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 336 transitions, 834 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 10:43:07,739 INFO L231 Difference]: Finished difference. Result has 340 places, 328 transitions, 752 flow [2023-11-26 10:43:07,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=752, PETRI_PLACES=340, PETRI_TRANSITIONS=328} [2023-11-26 10:43:07,740 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -22 predicate places. [2023-11-26 10:43:07,740 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 328 transitions, 752 flow [2023-11-26 10:43:07,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 356.8333333333333) internal successors, (2141), 6 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:07,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:07,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:07,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:43:07,742 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:07,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -586084070, now seen corresponding path program 1 times [2023-11-26 10:43:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379399385] [2023-11-26 10:43:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:07,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:08,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:08,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379399385] [2023-11-26 10:43:08,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379399385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:08,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:43:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36471344] [2023-11-26 10:43:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:08,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:43:08,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:08,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:43:08,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:43:08,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 400 [2023-11-26 10:43:08,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 328 transitions, 752 flow. Second operand has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:08,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:08,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 400 [2023-11-26 10:43:08,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:09,123 INFO L124 PetriNetUnfolderBase]: 132/1508 cut-off events. [2023-11-26 10:43:09,123 INFO L125 PetriNetUnfolderBase]: For 143/175 co-relation queries the response was YES. [2023-11-26 10:43:09,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2009 conditions, 1508 events. 132/1508 cut-off events. For 143/175 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9474 event pairs, 11 based on Foata normal form. 16/1435 useless extension candidates. Maximal degree in co-relation 1959. Up to 127 conditions per place. [2023-11-26 10:43:09,136 INFO L140 encePairwiseOnDemand]: 395/400 looper letters, 23 selfloop transitions, 4 changer transitions 0/335 dead transitions. [2023-11-26 10:43:09,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 335 transitions, 840 flow [2023-11-26 10:43:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:43:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:43:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2023-11-26 10:43:09,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8970833333333333 [2023-11-26 10:43:09,143 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2153 transitions. [2023-11-26 10:43:09,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2153 transitions. [2023-11-26 10:43:09,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:09,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2153 transitions. [2023-11-26 10:43:09,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 358.8333333333333) internal successors, (2153), 6 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,157 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 400.0) internal successors, (2800), 7 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,157 INFO L175 Difference]: Start difference. First operand has 340 places, 328 transitions, 752 flow. Second operand 6 states and 2153 transitions. [2023-11-26 10:43:09,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 335 transitions, 840 flow [2023-11-26 10:43:09,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 335 transitions, 833 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:43:09,165 INFO L231 Difference]: Finished difference. Result has 340 places, 327 transitions, 751 flow [2023-11-26 10:43:09,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=751, PETRI_PLACES=340, PETRI_TRANSITIONS=327} [2023-11-26 10:43:09,167 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -22 predicate places. [2023-11-26 10:43:09,167 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 327 transitions, 751 flow [2023-11-26 10:43:09,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 357.0) internal successors, (2142), 6 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:09,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:09,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:43:09,168 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:09,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:09,169 INFO L85 PathProgramCache]: Analyzing trace with hash -575964360, now seen corresponding path program 1 times [2023-11-26 10:43:09,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:09,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600550082] [2023-11-26 10:43:09,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:09,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:09,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:09,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600550082] [2023-11-26 10:43:09,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600550082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:09,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:09,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:09,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540233123] [2023-11-26 10:43:09,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:09,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:09,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:09,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:09,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:09,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 360 out of 400 [2023-11-26 10:43:09,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 327 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:09,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 360 of 400 [2023-11-26 10:43:09,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:09,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L64-->L67: Formula: (let ((.cse15 (* |v_thread3Thread1of1ForFork1_~i~2#1_15| 4))) (let ((.cse3 (+ .cse15 v_~A~0.offset_222))) (let ((.cse7 (select (select |v_#memory_int_133| v_~A~0.base_222) .cse3))) (let ((.cse8 (+ v_~mts3~0_159 .cse7))) (let ((.cse0 (<= .cse8 2147483647)) (.cse1 (<= .cse7 0)) (.cse2 (select |v_#race_483| v_~A~0.base_222)) (.cse5 (+ .cse15 v_~A~0.offset_222 1)) (.cse9 (+ .cse15 v_~A~0.offset_222 3)) (.cse12 (select |v_#race_471| v_~A~0.base_222)) (.cse6 (+ .cse15 v_~A~0.offset_222 2)) (.cse14 (<= 0 .cse7)) (.cse13 (<= 0 (+ v_~mts3~0_159 2147483648 .cse7)))) (and (not (= (ite (or .cse0 .cse1) 1 0) 0)) .cse0 (<= 0 (+ v_~sum~0_93 2147483648)) (let ((.cse4 (= |v_#race~A~0_277| 0)) (.cse10 (= |v_#race~mts3~0_254| 0)) (.cse11 (= |v_#race_483| (store |v_#race_472| v_~A~0.base_222 (store (store (store (store (select |v_#race_472| v_~A~0.base_222) .cse3 0) .cse5 0) .cse6 0) .cse9 0))))) (or (and (= (select .cse2 .cse3) 0) .cse4 (= (select .cse2 .cse5) 0) (= (select .cse2 .cse6) 0) (= |v_thread3_#t~mem16#1_180| .cse7) (<= 0 .cse8) (= (select .cse2 .cse9) 0) .cse10 (= (+ |v_thread3_#t~mem16#1_180| v_~mts3~0_159) v_~mts3~0_158) .cse11) (and .cse4 (= v_~mts3~0_158 0) (< .cse8 0) (= |v_thread3Thread1of1ForFork1_#t~mem16#1_13| |v_thread3_#t~mem16#1_180|) .cse10 .cse11))) (= 0 (select .cse12 .cse3)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483647) .cse1) 1 0) 0)) .cse13 (= |v_#race_471| (store |v_#race_483| v_~A~0.base_222 (store (store (store (store .cse2 .cse3 0) .cse5 0) .cse6 0) .cse9 0))) (= (select .cse12 .cse5) 0) (<= v_~sum~0_93 2147483647) (= (select .cse12 .cse9) 0) (= v_~sum~0_93 |v_thread3Thread1of1ForFork1_plus_#res#1_17|) (not (= (ite (or .cse14 (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_17| 2147483648))) 1 0) 0)) (= (select .cse12 .cse6) 0) (= |v_thread3Thread1of1ForFork1_plus_#res#1_17| (+ v_~sum~0_94 .cse7)) (not (= (ite (or .cse14 .cse13) 1 0) 0)) (= |v_#race~A~0_267| 0))))))) InVars {~sum~0=v_~sum~0_94, #race=|v_#race_472|, thread3Thread1of1ForFork1_#t~mem16#1=|v_thread3Thread1of1ForFork1_#t~mem16#1_13|, ~A~0.base=v_~A~0.base_222, ~mts3~0=v_~mts3~0_159, ~A~0.offset=v_~A~0.offset_222, #memory_int=|v_#memory_int_133|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|} OutVars{~A~0.base=v_~A~0.base_222, thread3Thread1of1ForFork1_#t~nondet18#1=|v_thread3Thread1of1ForFork1_#t~nondet18#1_11|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_17|, thread3Thread1of1ForFork1_#t~mem19#1=|v_thread3Thread1of1ForFork1_#t~mem19#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_15|, thread3Thread1of1ForFork1_#t~nondet21#1=|v_thread3Thread1of1ForFork1_#t~nondet21#1_3|, ~sum~0=v_~sum~0_93, #race~mts3~0=|v_#race~mts3~0_243|, ~mts3~0=v_~mts3~0_158, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_17|, #race~sum~0=|v_#race~sum~0_123|, thread3Thread1of1ForFork1_#t~ite17#1=|v_thread3Thread1of1ForFork1_#t~ite17#1_11|, #race=|v_#race_471|, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_17|, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_17|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_17|, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_17|, ~A~0.offset=v_~A~0.offset_222, thread3Thread1of1ForFork1_#t~ret20#1=|v_thread3Thread1of1ForFork1_#t~ret20#1_3|, thread3Thread1of1ForFork1_#t~ret15#1=|v_thread3Thread1of1ForFork1_#t~ret15#1_17|, #memory_int=|v_#memory_int_133|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_17|, thread3Thread1of1ForFork1_#t~mem14#1=|v_thread3Thread1of1ForFork1_#t~mem14#1_19|, #race~A~0=|v_#race~A~0_267|} AuxVars[|v_#race_483|, |v_#race~mts3~0_254|, |v_thread3_#t~mem16#1_180|, |v_#race~A~0_277|] AssignedVars[#race, thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~nondet18#1, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~mem19#1, thread3Thread1of1ForFork1_#t~nondet21#1, ~sum~0, #race~mts3~0, thread3Thread1of1ForFork1_#t~mem16#1, ~mts3~0, thread3Thread1of1ForFork1_plus_~a#1, thread3Thread1of1ForFork1_#t~ret20#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~ret15#1, #race~sum~0, thread3Thread1of1ForFork1_plus_~b#1, thread3Thread1of1ForFork1_#t~ite17#1, thread3Thread1of1ForFork1_#t~mem14#1, #race~A~0][182], [418#(= |#race~M~0| 0), Black: 445#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 443#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 438#(<= ~N~0 0), Black: 439#(and (= |thread1Thread1of1ForFork2_~i~0#1| 0) (<= ~N~0 0)), 403#(= |#race~N~0| 0), 491#true, 426#(= |#race~A~0| 0), Black: 424#true, 498#true, Black: 466#(and (<= (+ ~M~0 1) 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 465#(<= (+ ~M~0 1) 0), 221#L86-4true, 207#L67true, 223#L48-3true, 293#L56-1true]) [2023-11-26 10:43:09,614 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2023-11-26 10:43:09,614 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-26 10:43:09,614 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 10:43:09,614 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-26 10:43:09,743 INFO L124 PetriNetUnfolderBase]: 222/2267 cut-off events. [2023-11-26 10:43:09,743 INFO L125 PetriNetUnfolderBase]: For 205/213 co-relation queries the response was YES. [2023-11-26 10:43:09,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2921 conditions, 2267 events. 222/2267 cut-off events. For 205/213 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 16875 event pairs, 58 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 2873. Up to 252 conditions per place. [2023-11-26 10:43:09,773 INFO L140 encePairwiseOnDemand]: 397/400 looper letters, 17 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2023-11-26 10:43:09,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 329 transitions, 797 flow [2023-11-26 10:43:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:09,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1099 transitions. [2023-11-26 10:43:09,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9158333333333334 [2023-11-26 10:43:09,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1099 transitions. [2023-11-26 10:43:09,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1099 transitions. [2023-11-26 10:43:09,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:09,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1099 transitions. [2023-11-26 10:43:09,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,785 INFO L175 Difference]: Start difference. First operand has 340 places, 327 transitions, 751 flow. Second operand 3 states and 1099 transitions. [2023-11-26 10:43:09,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 329 transitions, 797 flow [2023-11-26 10:43:09,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 329 transitions, 790 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:43:09,794 INFO L231 Difference]: Finished difference. Result has 337 places, 326 transitions, 746 flow [2023-11-26 10:43:09,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=337, PETRI_TRANSITIONS=326} [2023-11-26 10:43:09,795 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -25 predicate places. [2023-11-26 10:43:09,796 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 326 transitions, 746 flow [2023-11-26 10:43:09,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:09,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:09,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:43:09,797 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:09,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash 611603833, now seen corresponding path program 1 times [2023-11-26 10:43:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266479906] [2023-11-26 10:43:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-26 10:43:09,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266479906] [2023-11-26 10:43:09,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266479906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:09,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:09,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946702566] [2023-11-26 10:43:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:09,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:09,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:09,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:09,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:09,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 400 [2023-11-26 10:43:09,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 326 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:09,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:09,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 400 [2023-11-26 10:43:09,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:10,411 INFO L124 PetriNetUnfolderBase]: 162/1848 cut-off events. [2023-11-26 10:43:10,412 INFO L125 PetriNetUnfolderBase]: For 134/154 co-relation queries the response was YES. [2023-11-26 10:43:10,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 1848 events. 162/1848 cut-off events. For 134/154 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 13142 event pairs, 41 based on Foata normal form. 1/1747 useless extension candidates. Maximal degree in co-relation 2350. Up to 211 conditions per place. [2023-11-26 10:43:10,436 INFO L140 encePairwiseOnDemand]: 397/400 looper letters, 16 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2023-11-26 10:43:10,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 328 transitions, 790 flow [2023-11-26 10:43:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2023-11-26 10:43:10,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9175 [2023-11-26 10:43:10,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2023-11-26 10:43:10,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2023-11-26 10:43:10,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:10,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2023-11-26 10:43:10,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,448 INFO L175 Difference]: Start difference. First operand has 337 places, 326 transitions, 746 flow. Second operand 3 states and 1101 transitions. [2023-11-26 10:43:10,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 328 transitions, 790 flow [2023-11-26 10:43:10,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 328 transitions, 786 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:10,457 INFO L231 Difference]: Finished difference. Result has 336 places, 325 transitions, 744 flow [2023-11-26 10:43:10,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=336, PETRI_TRANSITIONS=325} [2023-11-26 10:43:10,458 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -26 predicate places. [2023-11-26 10:43:10,458 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 325 transitions, 744 flow [2023-11-26 10:43:10,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.6666666666667) internal successors, (1088), 3 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:10,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:10,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:43:10,460 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:10,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2076119488, now seen corresponding path program 1 times [2023-11-26 10:43:10,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:10,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832289504] [2023-11-26 10:43:10,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:10,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:10,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832289504] [2023-11-26 10:43:10,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832289504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:10,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:10,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:10,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756335149] [2023-11-26 10:43:10,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:10,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:10,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:10,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:10,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:10,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 400 [2023-11-26 10:43:10,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 325 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 365.6666666666667) internal successors, (1097), 3 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:10,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 400 [2023-11-26 10:43:10,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:10,865 INFO L124 PetriNetUnfolderBase]: 77/1409 cut-off events. [2023-11-26 10:43:10,865 INFO L125 PetriNetUnfolderBase]: For 95/107 co-relation queries the response was YES. [2023-11-26 10:43:10,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1737 conditions, 1409 events. 77/1409 cut-off events. For 95/107 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8702 event pairs, 11 based on Foata normal form. 8/1344 useless extension candidates. Maximal degree in co-relation 1689. Up to 99 conditions per place. [2023-11-26 10:43:10,884 INFO L140 encePairwiseOnDemand]: 397/400 looper letters, 9 selfloop transitions, 1 changer transitions 2/323 dead transitions. [2023-11-26 10:43:10,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 323 transitions, 762 flow [2023-11-26 10:43:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2023-11-26 10:43:10,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9175 [2023-11-26 10:43:10,888 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2023-11-26 10:43:10,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2023-11-26 10:43:10,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:10,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2023-11-26 10:43:10,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,897 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,897 INFO L175 Difference]: Start difference. First operand has 336 places, 325 transitions, 744 flow. Second operand 3 states and 1101 transitions. [2023-11-26 10:43:10,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 323 transitions, 762 flow [2023-11-26 10:43:10,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 323 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:43:10,906 INFO L231 Difference]: Finished difference. Result has 334 places, 321 transitions, 734 flow [2023-11-26 10:43:10,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=334, PETRI_TRANSITIONS=321} [2023-11-26 10:43:10,907 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -28 predicate places. [2023-11-26 10:43:10,907 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 321 transitions, 734 flow [2023-11-26 10:43:10,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.6666666666667) internal successors, (1097), 3 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:10,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:43:10,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:10,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:43:10,909 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-11-26 10:43:10,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:43:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash -237471189, now seen corresponding path program 1 times [2023-11-26 10:43:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:43:10,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497970733] [2023-11-26 10:43:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:43:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:43:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:43:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:43:11,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:43:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497970733] [2023-11-26 10:43:11,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497970733] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:43:11,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:43:11,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:43:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758715736] [2023-11-26 10:43:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:43:11,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:43:11,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:43:11,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:43:11,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:43:11,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 400 [2023-11-26 10:43:11,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 321 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 365.6666666666667) internal successors, (1097), 3 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:11,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:43:11,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 400 [2023-11-26 10:43:11,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:43:11,372 INFO L124 PetriNetUnfolderBase]: 77/1377 cut-off events. [2023-11-26 10:43:11,373 INFO L125 PetriNetUnfolderBase]: For 95/107 co-relation queries the response was YES. [2023-11-26 10:43:11,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 1377 events. 77/1377 cut-off events. For 95/107 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8427 event pairs, 11 based on Foata normal form. 8/1328 useless extension candidates. Maximal degree in co-relation 1653. Up to 99 conditions per place. [2023-11-26 10:43:11,390 INFO L140 encePairwiseOnDemand]: 397/400 looper letters, 0 selfloop transitions, 0 changer transitions 319/319 dead transitions. [2023-11-26 10:43:11,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 319 transitions, 752 flow [2023-11-26 10:43:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:43:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:43:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2023-11-26 10:43:11,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9175 [2023-11-26 10:43:11,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1101 transitions. [2023-11-26 10:43:11,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1101 transitions. [2023-11-26 10:43:11,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:43:11,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1101 transitions. [2023-11-26 10:43:11,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 367.0) internal successors, (1101), 3 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:11,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:11,410 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 400.0) internal successors, (1600), 4 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:11,410 INFO L175 Difference]: Start difference. First operand has 334 places, 321 transitions, 734 flow. Second operand 3 states and 1101 transitions. [2023-11-26 10:43:11,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 319 transitions, 752 flow [2023-11-26 10:43:11,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 319 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:43:11,417 INFO L231 Difference]: Finished difference. Result has 331 places, 0 transitions, 0 flow [2023-11-26 10:43:11,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=400, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=331, PETRI_TRANSITIONS=0} [2023-11-26 10:43:11,419 INFO L281 CegarLoopForPetriNet]: 362 programPoint places, -31 predicate places. [2023-11-26 10:43:11,419 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 0 transitions, 0 flow [2023-11-26 10:43:11,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.6666666666667) internal successors, (1097), 3 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:43:11,423 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 79 remaining) [2023-11-26 10:43:11,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2023-11-26 10:43:11,424 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2023-11-26 10:43:11,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2023-11-26 10:43:11,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2023-11-26 10:43:11,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2023-11-26 10:43:11,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2023-11-26 10:43:11,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2023-11-26 10:43:11,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2023-11-26 10:43:11,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2023-11-26 10:43:11,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2023-11-26 10:43:11,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2023-11-26 10:43:11,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2023-11-26 10:43:11,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2023-11-26 10:43:11,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2023-11-26 10:43:11,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2023-11-26 10:43:11,428 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2023-11-26 10:43:11,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2023-11-26 10:43:11,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2023-11-26 10:43:11,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2023-11-26 10:43:11,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2023-11-26 10:43:11,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2023-11-26 10:43:11,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2023-11-26 10:43:11,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2023-11-26 10:43:11,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2023-11-26 10:43:11,430 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2023-11-26 10:43:11,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2023-11-26 10:43:11,431 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2023-11-26 10:43:11,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2023-11-26 10:43:11,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2023-11-26 10:43:11,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2023-11-26 10:43:11,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2023-11-26 10:43:11,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2023-11-26 10:43:11,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2023-11-26 10:43:11,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2023-11-26 10:43:11,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2023-11-26 10:43:11,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2023-11-26 10:43:11,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2023-11-26 10:43:11,434 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2023-11-26 10:43:11,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2023-11-26 10:43:11,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2023-11-26 10:43:11,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2023-11-26 10:43:11,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2023-11-26 10:43:11,435 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2023-11-26 10:43:11,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2023-11-26 10:43:11,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (33 of 79 remaining) [2023-11-26 10:43:11,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (32 of 79 remaining) [2023-11-26 10:43:11,436 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 79 remaining) [2023-11-26 10:43:11,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 79 remaining) [2023-11-26 10:43:11,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 79 remaining) [2023-11-26 10:43:11,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2023-11-26 10:43:11,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2023-11-26 10:43:11,437 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2023-11-26 10:43:11,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2023-11-26 10:43:11,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2023-11-26 10:43:11,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2023-11-26 10:43:11,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2023-11-26 10:43:11,438 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2023-11-26 10:43:11,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2023-11-26 10:43:11,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2023-11-26 10:43:11,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2023-11-26 10:43:11,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2023-11-26 10:43:11,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2023-11-26 10:43:11,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2023-11-26 10:43:11,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2023-11-26 10:43:11,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2023-11-26 10:43:11,440 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2023-11-26 10:43:11,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2023-11-26 10:43:11,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2023-11-26 10:43:11,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2023-11-26 10:43:11,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2023-11-26 10:43:11,441 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2023-11-26 10:43:11,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2023-11-26 10:43:11,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2023-11-26 10:43:11,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2023-11-26 10:43:11,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2023-11-26 10:43:11,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2023-11-26 10:43:11,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2023-11-26 10:43:11,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2023-11-26 10:43:11,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:43:11,444 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:43:11,454 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:43:11,454 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:43:11,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:43:11 BasicIcfg [2023-11-26 10:43:11,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:43:11,466 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:43:11,466 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:43:11,466 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:43:11,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:42:49" (3/4) ... [2023-11-26 10:43:11,469 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 10:43:11,473 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-26 10:43:11,473 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-26 10:43:11,474 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-26 10:43:11,485 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-26 10:43:11,485 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-26 10:43:11,486 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 10:43:11,487 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 10:43:11,651 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:43:11,652 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 10:43:11,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:43:11,653 INFO L158 Benchmark]: Toolchain (without parser) took 23841.07ms. Allocated memory was 138.4MB in the beginning and 952.1MB in the end (delta: 813.7MB). Free memory was 75.5MB in the beginning and 740.6MB in the end (delta: -665.1MB). Peak memory consumption was 151.5MB. Max. memory is 16.1GB. [2023-11-26 10:43:11,654 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 138.4MB. Free memory was 104.3MB in the beginning and 104.3MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:43:11,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.36ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 75.5MB in the beginning and 158.3MB in the end (delta: -82.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2023-11-26 10:43:11,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.71ms. Allocated memory is still 190.8MB. Free memory was 158.3MB in the beginning and 155.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:43:11,655 INFO L158 Benchmark]: Boogie Preprocessor took 65.41ms. Allocated memory is still 190.8MB. Free memory was 155.2MB in the beginning and 152.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:43:11,656 INFO L158 Benchmark]: RCFGBuilder took 1648.16ms. Allocated memory is still 190.8MB. Free memory was 152.0MB in the beginning and 149.8MB in the end (delta: 2.2MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2023-11-26 10:43:11,656 INFO L158 Benchmark]: TraceAbstraction took 21491.78ms. Allocated memory was 190.8MB in the beginning and 952.1MB in the end (delta: 761.3MB). Free memory was 149.8MB in the beginning and 746.9MB in the end (delta: -597.1MB). Peak memory consumption was 694.8MB. Max. memory is 16.1GB. [2023-11-26 10:43:11,657 INFO L158 Benchmark]: Witness Printer took 187.04ms. Allocated memory is still 952.1MB. Free memory was 746.9MB in the beginning and 740.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 10:43:11,661 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 138.4MB. Free memory was 104.3MB in the beginning and 104.3MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.36ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 75.5MB in the beginning and 158.3MB in the end (delta: -82.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.71ms. Allocated memory is still 190.8MB. Free memory was 158.3MB in the beginning and 155.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.41ms. Allocated memory is still 190.8MB. Free memory was 155.2MB in the beginning and 152.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1648.16ms. Allocated memory is still 190.8MB. Free memory was 152.0MB in the beginning and 149.8MB in the end (delta: 2.2MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * TraceAbstraction took 21491.78ms. Allocated memory was 190.8MB in the beginning and 952.1MB in the end (delta: 761.3MB). Free memory was 149.8MB in the beginning and 746.9MB in the end (delta: -597.1MB). Peak memory consumption was 694.8MB. Max. memory is 16.1GB. * Witness Printer took 187.04ms. Allocated memory is still 952.1MB. Free memory was 746.9MB in the beginning and 740.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 564 locations, 79 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1635 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 857 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 300 mSDsCounter, 608 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2919 IncrementalHoareTripleChecker+Invalid, 3527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 608 mSolverCounterUnsat, 93 mSDtfsCounter, 2919 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=760occurred in iteration=13, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1937 NumberOfCodeBlocks, 1937 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1917 ConstructedInterpolants, 0 QuantifiedInterpolants, 2751 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-26 10:43:11,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9bb1f57d-7367-4ba4-9bc1-d900f9aee3ba/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE