./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a 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_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:06:22,808 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:06:22,912 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 22:06:22,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:06:22,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:06:22,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:06:22,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:06:22,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:06:22,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:06:22,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:06:22,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:06:22,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:06:22,998 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:06:22,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:06:22,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:06:22,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:06:23,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:06:23,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:06:23,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:06:23,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:06:23,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:06:23,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:06:23,012 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 22:06:23,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:06:23,013 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:06:23,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:06:23,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:06:23,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:06:23,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:06:23,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:06:23,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:06:23,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:23,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:06:23,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:06:23,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:06:23,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:06:23,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:06:23,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:06:23,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:06:23,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:06:23,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:06:23,024 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_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 [2024-10-31 22:06:23,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:06:23,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:06:23,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:06:23,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:06:23,488 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:06:23,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c Unable to find full path for "g++" [2024-10-31 22:06:25,740 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:06:25,923 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:06:25,923 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2024-10-31 22:06:25,930 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/data/bfef02191/40cd9a6139d74b8498e81d6576f69671/FLAGe32415368 [2024-10-31 22:06:26,309 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/data/bfef02191/40cd9a6139d74b8498e81d6576f69671 [2024-10-31 22:06:26,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:06:26,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:06:26,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:26,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:06:26,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:06:26,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7c29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26, skipping insertion in model container [2024-10-31 22:06:26,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,350 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:06:26,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:26,607 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:06:26,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:06:26,661 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:06:26,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26 WrapperNode [2024-10-31 22:06:26,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:06:26,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:26,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:06:26,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:06:26,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,708 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 231 [2024-10-31 22:06:26,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:06:26,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:06:26,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:06:26,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:06:26,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:06:26,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:06:26,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:06:26,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:06:26,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (1/1) ... [2024-10-31 22:06:26,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:06:26,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:06:26,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:06:26,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:06:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:06:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 22:06:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 22:06:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 22:06:26,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 22:06:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 22:06:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:06:26,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:06:26,830 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:06:26,951 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:06:26,953 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:06:27,443 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:06:27,443 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:06:27,482 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:06:27,483 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:06:27,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:27 BoogieIcfgContainer [2024-10-31 22:06:27,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:06:27,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:06:27,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:06:27,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:06:27,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:06:26" (1/3) ... [2024-10-31 22:06:27,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e08ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:27, skipping insertion in model container [2024-10-31 22:06:27,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:06:26" (2/3) ... [2024-10-31 22:06:27,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66e08ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:06:27, skipping insertion in model container [2024-10-31 22:06:27,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:27" (3/3) ... [2024-10-31 22:06:27,494 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2024-10-31 22:06:27,513 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:06:27,513 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-31 22:06:27,514 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:06:27,690 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 22:06:27,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 313 transitions, 640 flow [2024-10-31 22:06:27,956 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-10-31 22:06:27,957 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 22:06:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 311 events. 18/311 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 593 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 170. Up to 2 conditions per place. [2024-10-31 22:06:27,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 313 transitions, 640 flow [2024-10-31 22:06:27,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 291 transitions, 594 flow [2024-10-31 22:06:27,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:06:28,005 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@232075c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:06:28,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-31 22:06:28,013 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:06:28,013 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-31 22:06:28,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:06:28,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:28,015 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:28,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:28,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:28,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1426550473, now seen corresponding path program 1 times [2024-10-31 22:06:28,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:28,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109035828] [2024-10-31 22:06:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:28,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:28,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109035828] [2024-10-31 22:06:28,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109035828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:28,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:28,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:28,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056571309] [2024-10-31 22:06:28,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:28,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:28,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:28,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:28,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2024-10-31 22:06:28,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:28,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:28,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2024-10-31 22:06:28,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:28,579 INFO L124 PetriNetUnfolderBase]: 17/369 cut-off events. [2024-10-31 22:06:28,579 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-10-31 22:06:28,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 369 events. 17/369 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1069 event pairs, 3 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 258. Up to 16 conditions per place. [2024-10-31 22:06:28,585 INFO L140 encePairwiseOnDemand]: 304/313 looper letters, 9 selfloop transitions, 2 changer transitions 2/284 dead transitions. [2024-10-31 22:06:28,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 602 flow [2024-10-31 22:06:28,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2024-10-31 22:06:28,603 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952076677316294 [2024-10-31 22:06:28,605 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 594 flow. Second operand 3 states and 894 transitions. [2024-10-31 22:06:28,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 602 flow [2024-10-31 22:06:28,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-31 22:06:28,624 INFO L231 Difference]: Finished difference. Result has 279 places, 282 transitions, 572 flow [2024-10-31 22:06:28,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=279, PETRI_TRANSITIONS=282} [2024-10-31 22:06:28,632 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -3 predicate places. [2024-10-31 22:06:28,634 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 282 transitions, 572 flow [2024-10-31 22:06:28,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:28,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:28,636 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:28,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:06:28,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:28,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1258392661, now seen corresponding path program 1 times [2024-10-31 22:06:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:28,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764440528] [2024-10-31 22:06:28,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:28,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:28,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764440528] [2024-10-31 22:06:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764440528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:28,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135579881] [2024-10-31 22:06:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:28,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:28,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2024-10-31 22:06:28,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 282 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:28,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:28,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2024-10-31 22:06:28,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:28,903 INFO L124 PetriNetUnfolderBase]: 18/413 cut-off events. [2024-10-31 22:06:28,903 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-31 22:06:28,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 413 events. 18/413 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1226 event pairs, 3 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 407. Up to 17 conditions per place. [2024-10-31 22:06:28,908 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-10-31 22:06:28,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 281 transitions, 592 flow [2024-10-31 22:06:28,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2024-10-31 22:06:28,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2024-10-31 22:06:28,914 INFO L175 Difference]: Start difference. First operand has 279 places, 282 transitions, 572 flow. Second operand 3 states and 888 transitions. [2024-10-31 22:06:28,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 281 transitions, 592 flow [2024-10-31 22:06:28,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:28,936 INFO L231 Difference]: Finished difference. Result has 276 places, 281 transitions, 570 flow [2024-10-31 22:06:28,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=276, PETRI_TRANSITIONS=281} [2024-10-31 22:06:28,938 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -6 predicate places. [2024-10-31 22:06:28,938 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 281 transitions, 570 flow [2024-10-31 22:06:28,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:28,939 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:28,939 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:28,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:06:28,940 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:28,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash -258362343, now seen corresponding path program 1 times [2024-10-31 22:06:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:28,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791873771] [2024-10-31 22:06:28,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:29,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:29,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791873771] [2024-10-31 22:06:29,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791873771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:29,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:29,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932630343] [2024-10-31 22:06:29,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:29,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:29,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:29,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:29,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:29,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:29,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 281 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:29,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:29,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:29,178 INFO L124 PetriNetUnfolderBase]: 27/518 cut-off events. [2024-10-31 22:06:29,178 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:06:29,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 518 events. 27/518 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2186 event pairs, 5 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 508. Up to 21 conditions per place. [2024-10-31 22:06:29,182 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-10-31 22:06:29,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 280 transitions, 592 flow [2024-10-31 22:06:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-10-31 22:06:29,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-10-31 22:06:29,187 INFO L175 Difference]: Start difference. First operand has 276 places, 281 transitions, 570 flow. Second operand 3 states and 886 transitions. [2024-10-31 22:06:29,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 280 transitions, 592 flow [2024-10-31 22:06:29,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 280 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:29,193 INFO L231 Difference]: Finished difference. Result has 275 places, 280 transitions, 568 flow [2024-10-31 22:06:29,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=275, PETRI_TRANSITIONS=280} [2024-10-31 22:06:29,196 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -7 predicate places. [2024-10-31 22:06:29,196 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 280 transitions, 568 flow [2024-10-31 22:06:29,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:29,197 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:29,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:06:29,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:29,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash 928634739, now seen corresponding path program 1 times [2024-10-31 22:06:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:29,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273069609] [2024-10-31 22:06:29,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273069609] [2024-10-31 22:06:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273069609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:29,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:29,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:29,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52055188] [2024-10-31 22:06:29,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:29,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:29,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:29,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:29,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:29,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 280 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:29,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:29,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:29,418 INFO L124 PetriNetUnfolderBase]: 23/429 cut-off events. [2024-10-31 22:06:29,418 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 22:06:29,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 429 events. 23/429 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1561 event pairs, 5 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 412. Up to 21 conditions per place. [2024-10-31 22:06:29,422 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-31 22:06:29,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 279 transitions, 590 flow [2024-10-31 22:06:29,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:29,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-10-31 22:06:29,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-10-31 22:06:29,425 INFO L175 Difference]: Start difference. First operand has 275 places, 280 transitions, 568 flow. Second operand 3 states and 886 transitions. [2024-10-31 22:06:29,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 279 transitions, 590 flow [2024-10-31 22:06:29,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 279 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:29,432 INFO L231 Difference]: Finished difference. Result has 274 places, 279 transitions, 566 flow [2024-10-31 22:06:29,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=274, PETRI_TRANSITIONS=279} [2024-10-31 22:06:29,434 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -8 predicate places. [2024-10-31 22:06:29,434 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 279 transitions, 566 flow [2024-10-31 22:06:29,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,435 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:29,435 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:29,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:06:29,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:29,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash -775813011, now seen corresponding path program 1 times [2024-10-31 22:06:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:29,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913188424] [2024-10-31 22:06:29,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:29,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:29,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:29,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913188424] [2024-10-31 22:06:29,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913188424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:29,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:29,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:29,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816855564] [2024-10-31 22:06:29,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:29,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:29,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:29,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:29,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:29,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:29,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 279 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:29,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:29,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:29,642 INFO L124 PetriNetUnfolderBase]: 22/422 cut-off events. [2024-10-31 22:06:29,642 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-10-31 22:06:29,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 422 events. 22/422 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1409 event pairs, 5 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 397. Up to 22 conditions per place. [2024-10-31 22:06:29,646 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-10-31 22:06:29,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 278 transitions, 588 flow [2024-10-31 22:06:29,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-10-31 22:06:29,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-10-31 22:06:29,649 INFO L175 Difference]: Start difference. First operand has 274 places, 279 transitions, 566 flow. Second operand 3 states and 886 transitions. [2024-10-31 22:06:29,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 278 transitions, 588 flow [2024-10-31 22:06:29,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 278 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:29,655 INFO L231 Difference]: Finished difference. Result has 273 places, 278 transitions, 564 flow [2024-10-31 22:06:29,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=273, PETRI_TRANSITIONS=278} [2024-10-31 22:06:29,656 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -9 predicate places. [2024-10-31 22:06:29,657 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 278 transitions, 564 flow [2024-10-31 22:06:29,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:29,658 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:29,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:06:29,658 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:29,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1604001172, now seen corresponding path program 1 times [2024-10-31 22:06:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565994826] [2024-10-31 22:06:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:29,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:29,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565994826] [2024-10-31 22:06:29,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565994826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:29,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:29,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:29,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856935682] [2024-10-31 22:06:29,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:29,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:29,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:29,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:29,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:29,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:29,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 278 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:29,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:29,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:29,857 INFO L124 PetriNetUnfolderBase]: 26/507 cut-off events. [2024-10-31 22:06:29,858 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-31 22:06:29,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 507 events. 26/507 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2012 event pairs, 5 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 475. Up to 22 conditions per place. [2024-10-31 22:06:29,863 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-10-31 22:06:29,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 586 flow [2024-10-31 22:06:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-10-31 22:06:29,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-10-31 22:06:29,867 INFO L175 Difference]: Start difference. First operand has 273 places, 278 transitions, 564 flow. Second operand 3 states and 886 transitions. [2024-10-31 22:06:29,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 586 flow [2024-10-31 22:06:29,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:29,873 INFO L231 Difference]: Finished difference. Result has 272 places, 277 transitions, 562 flow [2024-10-31 22:06:29,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=272, PETRI_TRANSITIONS=277} [2024-10-31 22:06:29,875 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -10 predicate places. [2024-10-31 22:06:29,875 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 277 transitions, 562 flow [2024-10-31 22:06:29,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:29,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:29,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:06:29,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:29,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash -633730726, now seen corresponding path program 1 times [2024-10-31 22:06:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:29,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508679286] [2024-10-31 22:06:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:29,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508679286] [2024-10-31 22:06:29,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508679286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:29,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:29,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:29,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699953490] [2024-10-31 22:06:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:29,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:29,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:29,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:29,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:29,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:29,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 277 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:29,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:29,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:29,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:30,133 INFO L124 PetriNetUnfolderBase]: 48/722 cut-off events. [2024-10-31 22:06:30,133 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-31 22:06:30,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 722 events. 48/722 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3773 event pairs, 8 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 698. Up to 36 conditions per place. [2024-10-31 22:06:30,143 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2024-10-31 22:06:30,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 278 transitions, 595 flow [2024-10-31 22:06:30,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2024-10-31 22:06:30,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2024-10-31 22:06:30,146 INFO L175 Difference]: Start difference. First operand has 272 places, 277 transitions, 562 flow. Second operand 3 states and 891 transitions. [2024-10-31 22:06:30,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 278 transitions, 595 flow [2024-10-31 22:06:30,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:30,152 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 573 flow [2024-10-31 22:06:30,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-10-31 22:06:30,154 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-10-31 22:06:30,154 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 573 flow [2024-10-31 22:06:30,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:30,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:30,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:30,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:06:30,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:30,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1204903880, now seen corresponding path program 1 times [2024-10-31 22:06:30,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:30,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406485971] [2024-10-31 22:06:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:30,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406485971] [2024-10-31 22:06:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406485971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:30,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650232517] [2024-10-31 22:06:30,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:30,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:30,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:30,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:30,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:30,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:30,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:30,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:30,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:30,401 INFO L124 PetriNetUnfolderBase]: 50/743 cut-off events. [2024-10-31 22:06:30,402 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-10-31 22:06:30,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 743 events. 50/743 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4003 event pairs, 8 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 653. Up to 36 conditions per place. [2024-10-31 22:06:30,407 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2024-10-31 22:06:30,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 278 transitions, 606 flow [2024-10-31 22:06:30,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:30,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2024-10-31 22:06:30,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2024-10-31 22:06:30,410 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 573 flow. Second operand 3 states and 891 transitions. [2024-10-31 22:06:30,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 278 transitions, 606 flow [2024-10-31 22:06:30,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:06:30,416 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 588 flow [2024-10-31 22:06:30,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-10-31 22:06:30,418 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-10-31 22:06:30,419 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 588 flow [2024-10-31 22:06:30,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:30,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:30,421 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:30,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:06:30,421 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:30,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2044432989, now seen corresponding path program 1 times [2024-10-31 22:06:30,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:30,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802038404] [2024-10-31 22:06:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802038404] [2024-10-31 22:06:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802038404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:30,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:30,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:30,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25131795] [2024-10-31 22:06:30,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:30,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:30,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:30,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:30,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:30,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:30,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:30,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:30,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:30,689 INFO L124 PetriNetUnfolderBase]: 56/962 cut-off events. [2024-10-31 22:06:30,690 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2024-10-31 22:06:30,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 962 events. 56/962 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5988 event pairs, 4 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 879. Up to 55 conditions per place. [2024-10-31 22:06:30,696 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/280 dead transitions. [2024-10-31 22:06:30,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 280 transitions, 631 flow [2024-10-31 22:06:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2024-10-31 22:06:30,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2024-10-31 22:06:30,703 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 588 flow. Second operand 3 states and 893 transitions. [2024-10-31 22:06:30,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 280 transitions, 631 flow [2024-10-31 22:06:30,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 280 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:06:30,709 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 603 flow [2024-10-31 22:06:30,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-10-31 22:06:30,711 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-10-31 22:06:30,711 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 603 flow [2024-10-31 22:06:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:30,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:30,712 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:30,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:06:30,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash -294538650, now seen corresponding path program 1 times [2024-10-31 22:06:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579341568] [2024-10-31 22:06:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:30,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579341568] [2024-10-31 22:06:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579341568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:30,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:30,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:30,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135294487] [2024-10-31 22:06:30,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:30,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:30,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:30,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:30,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2024-10-31 22:06:30,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:30,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:30,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2024-10-31 22:06:30,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:30,965 INFO L124 PetriNetUnfolderBase]: 42/793 cut-off events. [2024-10-31 22:06:30,966 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2024-10-31 22:06:30,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 793 events. 42/793 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4526 event pairs, 4 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 727. Up to 25 conditions per place. [2024-10-31 22:06:30,971 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-10-31 22:06:30,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 277 transitions, 628 flow [2024-10-31 22:06:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-10-31 22:06:30,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2024-10-31 22:06:30,974 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 603 flow. Second operand 3 states and 892 transitions. [2024-10-31 22:06:30,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 277 transitions, 628 flow [2024-10-31 22:06:30,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 277 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:06:30,981 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 605 flow [2024-10-31 22:06:30,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2024-10-31 22:06:30,982 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2024-10-31 22:06:30,982 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 605 flow [2024-10-31 22:06:30,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:30,983 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:30,983 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:06:30,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1228796145, now seen corresponding path program 1 times [2024-10-31 22:06:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178770551] [2024-10-31 22:06:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:31,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:31,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178770551] [2024-10-31 22:06:31,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178770551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:31,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:31,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887389585] [2024-10-31 22:06:31,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:31,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:31,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:31,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:31,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:31,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:31,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:31,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:31,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:31,233 INFO L124 PetriNetUnfolderBase]: 60/1068 cut-off events. [2024-10-31 22:06:31,233 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-10-31 22:06:31,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1068 events. 60/1068 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7055 event pairs, 6 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1022. Up to 47 conditions per place. [2024-10-31 22:06:31,240 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/279 dead transitions. [2024-10-31 22:06:31,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 279 transitions, 648 flow [2024-10-31 22:06:31,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2024-10-31 22:06:31,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2024-10-31 22:06:31,243 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 605 flow. Second operand 3 states and 893 transitions. [2024-10-31 22:06:31,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 279 transitions, 648 flow [2024-10-31 22:06:31,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 279 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:31,249 INFO L231 Difference]: Finished difference. Result has 269 places, 276 transitions, 616 flow [2024-10-31 22:06:31,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=269, PETRI_TRANSITIONS=276} [2024-10-31 22:06:31,250 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2024-10-31 22:06:31,250 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 276 transitions, 616 flow [2024-10-31 22:06:31,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:31,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:31,251 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:31,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:06:31,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:31,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:31,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1090064911, now seen corresponding path program 1 times [2024-10-31 22:06:31,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968465071] [2024-10-31 22:06:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:31,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968465071] [2024-10-31 22:06:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968465071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:31,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984258877] [2024-10-31 22:06:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:31,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:31,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:31,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2024-10-31 22:06:31,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 276 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:31,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:31,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2024-10-31 22:06:31,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:31,514 INFO L124 PetriNetUnfolderBase]: 45/1163 cut-off events. [2024-10-31 22:06:31,514 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2024-10-31 22:06:31,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1163 events. 45/1163 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7236 event pairs, 2 based on Foata normal form. 0/1055 useless extension candidates. Maximal degree in co-relation 1095. Up to 42 conditions per place. [2024-10-31 22:06:31,523 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-31 22:06:31,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 279 transitions, 653 flow [2024-10-31 22:06:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-10-31 22:06:31,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2024-10-31 22:06:31,526 INFO L175 Difference]: Start difference. First operand has 269 places, 276 transitions, 616 flow. Second operand 3 states and 898 transitions. [2024-10-31 22:06:31,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 279 transitions, 653 flow [2024-10-31 22:06:31,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 279 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:06:31,532 INFO L231 Difference]: Finished difference. Result has 270 places, 276 transitions, 626 flow [2024-10-31 22:06:31,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=270, PETRI_TRANSITIONS=276} [2024-10-31 22:06:31,534 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-10-31 22:06:31,534 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 276 transitions, 626 flow [2024-10-31 22:06:31,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:31,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:31,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:31,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:06:31,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:31,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash -419615918, now seen corresponding path program 1 times [2024-10-31 22:06:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623118601] [2024-10-31 22:06:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:31,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:31,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623118601] [2024-10-31 22:06:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623118601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:31,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096467681] [2024-10-31 22:06:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:31,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:31,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:31,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:31,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2024-10-31 22:06:31,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 276 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:31,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:31,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2024-10-31 22:06:31,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:31,877 INFO L124 PetriNetUnfolderBase]: 46/1201 cut-off events. [2024-10-31 22:06:31,878 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2024-10-31 22:06:31,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1201 events. 46/1201 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7646 event pairs, 4 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1156. Up to 43 conditions per place. [2024-10-31 22:06:31,886 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-10-31 22:06:31,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 279 transitions, 663 flow [2024-10-31 22:06:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-10-31 22:06:31,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2024-10-31 22:06:31,890 INFO L175 Difference]: Start difference. First operand has 270 places, 276 transitions, 626 flow. Second operand 3 states and 898 transitions. [2024-10-31 22:06:31,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 279 transitions, 663 flow [2024-10-31 22:06:31,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 279 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:06:31,896 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 636 flow [2024-10-31 22:06:31,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2024-10-31 22:06:31,898 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2024-10-31 22:06:31,898 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 636 flow [2024-10-31 22:06:31,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:31,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:31,899 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:31,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:06:31,899 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:31,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:31,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1794766840, now seen corresponding path program 1 times [2024-10-31 22:06:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:31,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093242456] [2024-10-31 22:06:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:31,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:31,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093242456] [2024-10-31 22:06:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093242456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:31,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:31,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:31,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859605082] [2024-10-31 22:06:31,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:31,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:31,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:31,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2024-10-31 22:06:31,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:31,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:31,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2024-10-31 22:06:31,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:32,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,146 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-31 22:06:32,146 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,147 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:06:32,147 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([797] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][139], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,152 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-31 22:06:32,152 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:06:32,152 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,152 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,154 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 109#L50-40true, 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,155 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-10-31 22:06:32,155 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,155 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:06:32,155 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-31 22:06:32,155 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 164#L50-41true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,158 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-31 22:06:32,158 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:06:32,158 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,158 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 53#L50-42true, Black: 327#true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,160 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2024-10-31 22:06:32,160 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:06:32,161 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:06:32,161 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-31 22:06:32,166 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([797] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][139], [350#true, Black: 323#true, 110#L68-1true, Black: 327#true, 109#L50-40true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,167 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-10-31 22:06:32,167 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2024-10-31 22:06:32,167 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-31 22:06:32,167 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-10-31 22:06:32,167 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-31 22:06:32,167 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,168 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-31 22:06:32,168 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:06:32,168 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,168 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,168 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-10-31 22:06:32,170 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 323#true, 110#L68-1true, 53#L50-42true, 352#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,170 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-31 22:06:32,170 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:06:32,170 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-31 22:06:32,170 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-31 22:06:32,170 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-31 22:06:32,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, 99#L52true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,173 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-10-31 22:06:32,173 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-31 22:06:32,173 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-31 22:06:32,173 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,176 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [350#true, 99#L52true, Black: 323#true, 110#L68-1true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,176 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,176 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-31 22:06:32,176 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-31 22:06:32,177 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-10-31 22:06:32,177 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-31 22:06:32,184 INFO L124 PetriNetUnfolderBase]: 71/1065 cut-off events. [2024-10-31 22:06:32,184 INFO L125 PetriNetUnfolderBase]: For 42/45 co-relation queries the response was YES. [2024-10-31 22:06:32,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1065 events. 71/1065 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6389 event pairs, 6 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1123. Up to 88 conditions per place. [2024-10-31 22:06:32,192 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-10-31 22:06:32,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 276 transitions, 661 flow [2024-10-31 22:06:32,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:32,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:32,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-10-31 22:06:32,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2024-10-31 22:06:32,195 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 636 flow. Second operand 3 states and 892 transitions. [2024-10-31 22:06:32,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 276 transitions, 661 flow [2024-10-31 22:06:32,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 276 transitions, 661 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 22:06:32,202 INFO L231 Difference]: Finished difference. Result has 272 places, 275 transitions, 638 flow [2024-10-31 22:06:32,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=272, PETRI_TRANSITIONS=275} [2024-10-31 22:06:32,204 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -10 predicate places. [2024-10-31 22:06:32,204 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 275 transitions, 638 flow [2024-10-31 22:06:32,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:32,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:32,205 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:32,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:06:32,206 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:32,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1865615290, now seen corresponding path program 1 times [2024-10-31 22:06:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:32,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603827647] [2024-10-31 22:06:32,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:32,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:32,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:32,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603827647] [2024-10-31 22:06:32,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603827647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:32,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:32,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:32,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868906200] [2024-10-31 22:06:32,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:32,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:32,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:32,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:32,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:32,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 275 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:32,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:32,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:32,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:32,535 INFO L124 PetriNetUnfolderBase]: 43/1137 cut-off events. [2024-10-31 22:06:32,535 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2024-10-31 22:06:32,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 1137 events. 43/1137 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7051 event pairs, 3 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1161. Up to 30 conditions per place. [2024-10-31 22:06:32,544 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 10 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2024-10-31 22:06:32,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 272 transitions, 654 flow [2024-10-31 22:06:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2024-10-31 22:06:32,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446219382321619 [2024-10-31 22:06:32,548 INFO L175 Difference]: Start difference. First operand has 272 places, 275 transitions, 638 flow. Second operand 3 states and 887 transitions. [2024-10-31 22:06:32,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 272 transitions, 654 flow [2024-10-31 22:06:32,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 272 transitions, 650 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:06:32,556 INFO L231 Difference]: Finished difference. Result has 269 places, 272 transitions, 630 flow [2024-10-31 22:06:32,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=269, PETRI_TRANSITIONS=272} [2024-10-31 22:06:32,557 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2024-10-31 22:06:32,558 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 272 transitions, 630 flow [2024-10-31 22:06:32,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:32,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:06:32,559 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:32,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:06:32,559 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-31 22:06:32,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:06:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1871924535, now seen corresponding path program 1 times [2024-10-31 22:06:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:06:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308195442] [2024-10-31 22:06:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:06:32,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:06:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:06:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:06:32,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:06:32,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308195442] [2024-10-31 22:06:32,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308195442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:06:32,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:06:32,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:06:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384742009] [2024-10-31 22:06:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:06:32,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:06:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:06:32,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:06:32,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:06:32,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-10-31 22:06:32,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 272 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:32,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:06:32,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-10-31 22:06:32,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:06:32,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,819 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-31 22:06:32,819 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,820 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,820 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:06:32,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([801] L50-40-->L50-41: Formula: (= |v_#race~result_7~0_1| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][144], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,829 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-31 22:06:32,829 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:06:32,829 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,830 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,832 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([863] thread1EXIT-->L68-1: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][165], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,832 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-10-31 22:06:32,832 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,833 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:06:32,833 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-31 22:06:32,833 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-31 22:06:32,843 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([801] L50-40-->L50-41: Formula: (= |v_#race~result_7~0_1| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][144], [Black: 323#true, 110#L68-1true, 164#L50-41true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |#race~filename_4~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), Black: 346#true, 333#(= |#race~filename_2~0| 0)]) [2024-10-31 22:06:32,844 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event [2024-10-31 22:06:32,844 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-31 22:06:32,844 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-10-31 22:06:32,844 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-10-31 22:06:32,844 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2024-10-31 22:06:32,861 INFO L124 PetriNetUnfolderBase]: 47/1092 cut-off events. [2024-10-31 22:06:32,861 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2024-10-31 22:06:32,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1092 events. 47/1092 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6278 event pairs, 3 based on Foata normal form. 3/1031 useless extension candidates. Maximal degree in co-relation 1078. Up to 47 conditions per place. [2024-10-31 22:06:32,867 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 0 selfloop transitions, 0 changer transitions 271/271 dead transitions. [2024-10-31 22:06:32,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 271 transitions, 652 flow [2024-10-31 22:06:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:06:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:06:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2024-10-31 22:06:32,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2024-10-31 22:06:32,870 INFO L175 Difference]: Start difference. First operand has 269 places, 272 transitions, 630 flow. Second operand 3 states and 888 transitions. [2024-10-31 22:06:32,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 271 transitions, 652 flow [2024-10-31 22:06:32,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 271 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:06:32,876 INFO L231 Difference]: Finished difference. Result has 267 places, 0 transitions, 0 flow [2024-10-31 22:06:32,876 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=267, PETRI_TRANSITIONS=0} [2024-10-31 22:06:32,878 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -15 predicate places. [2024-10-31 22:06:32,878 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 0 transitions, 0 flow [2024-10-31 22:06:32,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:06:32,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-10-31 22:06:32,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-10-31 22:06:32,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-10-31 22:06:32,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-10-31 22:06:32,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-10-31 22:06:32,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-10-31 22:06:32,888 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-10-31 22:06:32,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-10-31 22:06:32,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-10-31 22:06:32,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-10-31 22:06:32,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-10-31 22:06:32,889 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-10-31 22:06:32,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-10-31 22:06:32,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-10-31 22:06:32,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-10-31 22:06:32,890 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-10-31 22:06:32,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-10-31 22:06:32,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-10-31 22:06:32,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-10-31 22:06:32,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-10-31 22:06:32,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-10-31 22:06:32,892 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-10-31 22:06:32,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-10-31 22:06:32,896 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-10-31 22:06:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-10-31 22:06:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-10-31 22:06:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-10-31 22:06:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-10-31 22:06:32,897 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-10-31 22:06:32,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-10-31 22:06:32,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-10-31 22:06:32,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-10-31 22:06:32,898 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-10-31 22:06:32,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-10-31 22:06:32,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-10-31 22:06:32,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-10-31 22:06:32,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-10-31 22:06:32,899 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-10-31 22:06:32,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-10-31 22:06:32,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-10-31 22:06:32,900 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-10-31 22:06:32,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-10-31 22:06:32,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-10-31 22:06:32,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-10-31 22:06:32,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-10-31 22:06:32,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-10-31 22:06:32,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-10-31 22:06:32,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-10-31 22:06:32,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-10-31 22:06:32,902 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-10-31 22:06:32,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:06:32,903 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:06:32,914 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:06:32,914 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:06:32,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:06:32 BasicIcfg [2024-10-31 22:06:32,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:06:32,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:06:32,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:06:32,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:06:32,926 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:06:27" (3/4) ... [2024-10-31 22:06:32,929 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-10-31 22:06:32,934 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-31 22:06:32,935 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-31 22:06:32,943 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-31 22:06:32,943 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-31 22:06:32,944 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-31 22:06:32,944 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-31 22:06:33,085 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:06:33,085 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/witness.yml [2024-10-31 22:06:33,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:06:33,087 INFO L158 Benchmark]: Toolchain (without parser) took 6773.13ms. Allocated memory was 140.5MB in the beginning and 249.6MB in the end (delta: 109.1MB). Free memory was 102.2MB in the beginning and 216.7MB in the end (delta: -114.5MB). Peak memory consumption was 142.5MB. Max. memory is 16.1GB. [2024-10-31 22:06:33,087 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 140.5MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:06:33,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.80ms. Allocated memory is still 140.5MB. Free memory was 102.2MB in the beginning and 88.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 22:06:33,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.82ms. Allocated memory is still 140.5MB. Free memory was 88.3MB in the beginning and 86.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:06:33,088 INFO L158 Benchmark]: Boogie Preprocessor took 37.04ms. Allocated memory is still 140.5MB. Free memory was 86.2MB in the beginning and 84.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:06:33,089 INFO L158 Benchmark]: RCFGBuilder took 736.10ms. Allocated memory is still 140.5MB. Free memory was 84.4MB in the beginning and 60.8MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-31 22:06:33,089 INFO L158 Benchmark]: TraceAbstraction took 5437.55ms. Allocated memory was 140.5MB in the beginning and 249.6MB in the end (delta: 109.1MB). Free memory was 60.3MB in the beginning and 76.8MB in the end (delta: -16.6MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. [2024-10-31 22:06:33,090 INFO L158 Benchmark]: Witness Printer took 161.82ms. Allocated memory is still 249.6MB. Free memory was 76.8MB in the beginning and 216.7MB in the end (delta: -139.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-31 22:06:33,093 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.35ms. Allocated memory is still 140.5MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.80ms. Allocated memory is still 140.5MB. Free memory was 102.2MB in the beginning and 88.6MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.82ms. Allocated memory is still 140.5MB. Free memory was 88.3MB in the beginning and 86.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.04ms. Allocated memory is still 140.5MB. Free memory was 86.2MB in the beginning and 84.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 736.10ms. Allocated memory is still 140.5MB. Free memory was 84.4MB in the beginning and 60.8MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5437.55ms. Allocated memory was 140.5MB in the beginning and 249.6MB in the end (delta: 109.1MB). Free memory was 60.3MB in the beginning and 76.8MB in the end (delta: -16.6MB). Peak memory consumption was 93.5MB. Max. memory is 16.1GB. * Witness Printer took 161.82ms. Allocated memory is still 249.6MB. Free memory was 76.8MB in the beginning and 216.7MB in the end (delta: -139.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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 5 procedures, 448 locations, 50 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: 5.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 402 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 106 mSDtfsCounter, 402 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=638occurred in iteration=14, InterpolantAutomatonStates: 48, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-31 22:06:33,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68cc11c0-a1ed-4bfe-a10b-a5d40bc9e987/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE