./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 38b53e6a 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_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --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 cb0da49952f084f4179c44b957c91689c392bf769782a6b0853667237fdff1db --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:50:52,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:50:52,930 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:50:52,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:50:52,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:50:52,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:50:52,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:50:52,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:50:52,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:50:52,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:50:52,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:50:52,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:50:52,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:50:52,987 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:50:52,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:50:52,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:50:52,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:50:52,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:50:52,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:50:52,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:50:52,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:50:52,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:50:52,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:50:53,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:50:53,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:50:53,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:50:53,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:50:53,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:50:53,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:50:53,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:50:53,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:50:53,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:50:53,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:50:53,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:50:53,010 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:50:53,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:50:53,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:50:53,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:50:53,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:50:53,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:50:53,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:50:53,019 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-25 15:50:53,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:50:53,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:50:53,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:50:53,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:50:53,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:50:53,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:50:53,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:50:53,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:50:53,042 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:50:53,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:50:53,043 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:50:53,043 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:50:53,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:50:53,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:50:53,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:50:53,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:50:53,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:50:53,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:50:53,044 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-25 15:50:53,044 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:50:53,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:50:53,045 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:50:53,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:50:53,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:50:53,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:50:53,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:50:53,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:50:53,046 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:50:53,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:50:53,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:50:53,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:50:53,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:50:53,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:50:53,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:50:53,048 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:50:53,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:50:53,048 INFO L138 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_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/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_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> cb0da49952f084f4179c44b957c91689c392bf769782a6b0853667237fdff1db [2022-11-25 15:50:53,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:50:53,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:50:53,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:50:53,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:50:53,471 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:50:53,473 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i [2022-11-25 15:50:56,752 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:50:57,059 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:50:57,060 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i [2022-11-25 15:50:57,072 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/data/08a5fdbc2/f1394f21cecc4606a4887a5174ba8ee2/FLAG52f3438d4 [2022-11-25 15:50:57,087 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/data/08a5fdbc2/f1394f21cecc4606a4887a5174ba8ee2 [2022-11-25 15:50:57,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:50:57,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:50:57,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:50:57,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:50:57,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:50:57,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53091e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57, skipping insertion in model container [2022-11-25 15:50:57,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:50:57,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:50:57,498 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i[29939,29952] [2022-11-25 15:50:57,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:50:57,518 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:50:57,559 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i[29939,29952] [2022-11-25 15:50:57,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:50:57,609 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:50:57,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57 WrapperNode [2022-11-25 15:50:57,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:50:57,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:50:57,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:50:57,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:50:57,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,683 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-11-25 15:50:57,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:50:57,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:50:57,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:50:57,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:50:57,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,732 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,756 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:50:57,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:50:57,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:50:57,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:50:57,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (1/1) ... [2022-11-25 15:50:57,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:50:57,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:57,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:50:57,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_142bca49-0ebe-49dc-b860-213130a11dee/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:50:57,897 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-25 15:50:57,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-25 15:50:57,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:50:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:50:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:50:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:50:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:50:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:50:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:50:57,902 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:50:58,053 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:50:58,056 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:50:58,262 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:50:58,269 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:50:58,270 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:50:58,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:50:58 BoogieIcfgContainer [2022-11-25 15:50:58,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:50:58,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:50:58,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:50:58,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:50:58,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:50:57" (1/3) ... [2022-11-25 15:50:58,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be1371c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:50:58, skipping insertion in model container [2022-11-25 15:50:58,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:57" (2/3) ... [2022-11-25 15:50:58,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be1371c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:50:58, skipping insertion in model container [2022-11-25 15:50:58,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:50:58" (3/3) ... [2022-11-25 15:50:58,298 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs-b.i [2022-11-25 15:50:58,308 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:50:58,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:50:58,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-11-25 15:50:58,320 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:50:58,423 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:50:58,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 133 flow [2022-11-25 15:50:58,523 INFO L130 PetriNetUnfolder]: 4/75 cut-off events. [2022-11-25 15:50:58,523 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:50:58,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 75 events. 4/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2022-11-25 15:50:58,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 64 transitions, 133 flow [2022-11-25 15:50:58,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 64 transitions, 133 flow [2022-11-25 15:50:58,539 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:50:58,557 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 64 transitions, 133 flow [2022-11-25 15:50:58,560 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 64 transitions, 133 flow [2022-11-25 15:50:58,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 133 flow [2022-11-25 15:50:58,583 INFO L130 PetriNetUnfolder]: 4/75 cut-off events. [2022-11-25 15:50:58,583 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:50:58,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 75 events. 4/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2022-11-25 15:50:58,586 INFO L119 LiptonReduction]: Number of co-enabled transitions 952 [2022-11-25 15:51:00,948 INFO L134 LiptonReduction]: Checked pairs total: 763 [2022-11-25 15:51:00,949 INFO L136 LiptonReduction]: Total number of compositions: 69 [2022-11-25 15:51:00,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:51:00,985 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@ecb0a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:51:00,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-25 15:51:00,991 INFO L130 PetriNetUnfolder]: 0/5 cut-off events. [2022-11-25 15:51:00,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:51:00,993 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:00,994 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-11-25 15:51:00,995 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2022-11-25 15:51:01,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash 8410728, now seen corresponding path program 1 times [2022-11-25 15:51:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:01,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620838657] [2022-11-25 15:51:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:01,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:01,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:01,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620838657] [2022-11-25 15:51:01,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620838657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:01,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:01,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:51:01,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147370836] [2022-11-25 15:51:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:01,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 15:51:01,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:01,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 15:51:01,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 15:51:01,275 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 133 [2022-11-25 15:51:01,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 15 places, 12 transitions, 29 flow. Second operand has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 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) [2022-11-25 15:51:01,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:01,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 133 [2022-11-25 15:51:01,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:01,312 INFO L130 PetriNetUnfolder]: 2/11 cut-off events. [2022-11-25 15:51:01,313 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:51:01,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2022-11-25 15:51:01,314 INFO L137 encePairwiseOnDemand]: 127/133 looper letters, 5 selfloop transitions, 0 changer transitions 0/6 dead transitions. [2022-11-25 15:51:01,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 27 flow [2022-11-25 15:51:01,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 15:51:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 15:51:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 129 transitions. [2022-11-25 15:51:01,333 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4849624060150376 [2022-11-25 15:51:01,334 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 129 transitions. [2022-11-25 15:51:01,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 129 transitions. [2022-11-25 15:51:01,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:01,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 129 transitions. [2022-11-25 15:51:01,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 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) [2022-11-25 15:51:01,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2022-11-25 15:51:01,358 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2022-11-25 15:51:01,361 INFO L175 Difference]: Start difference. First operand has 15 places, 12 transitions, 29 flow. Second operand 2 states and 129 transitions. [2022-11-25 15:51:01,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 27 flow [2022-11-25 15:51:01,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 27 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:51:01,368 INFO L231 Difference]: Finished difference. Result has 10 places, 6 transitions, 17 flow [2022-11-25 15:51:01,370 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=17, PETRI_PLACES=10, PETRI_TRANSITIONS=6} [2022-11-25 15:51:01,389 INFO L288 CegarLoopForPetriNet]: 15 programPoint places, -5 predicate places. [2022-11-25 15:51:01,390 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 6 transitions, 17 flow [2022-11-25 15:51:01,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 61.0) internal successors, (122), 2 states have internal predecessors, (122), 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) [2022-11-25 15:51:01,390 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:01,391 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2022-11-25 15:51:01,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:51:01,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2022-11-25 15:51:01,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash -507223719, now seen corresponding path program 1 times [2022-11-25 15:51:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:01,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100661997] [2022-11-25 15:51:01,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:01,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:01,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:51:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:01,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:51:01,490 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:51:01,492 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2022-11-25 15:51:01,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2022-11-25 15:51:01,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2022-11-25 15:51:01,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2022-11-25 15:51:01,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2022-11-25 15:51:01,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2022-11-25 15:51:01,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2022-11-25 15:51:01,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2022-11-25 15:51:01,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2022-11-25 15:51:01,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2022-11-25 15:51:01,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2022-11-25 15:51:01,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:51:01,509 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-25 15:51:01,513 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 15:51:01,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-25 15:51:01,541 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:51:01,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 210 flow [2022-11-25 15:51:01,604 INFO L130 PetriNetUnfolder]: 7/123 cut-off events. [2022-11-25 15:51:01,605 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 15:51:01,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 7/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 270 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 81. Up to 6 conditions per place. [2022-11-25 15:51:01,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 210 flow [2022-11-25 15:51:01,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 99 transitions, 210 flow [2022-11-25 15:51:01,611 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:51:01,612 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 99 transitions, 210 flow [2022-11-25 15:51:01,612 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 99 transitions, 210 flow [2022-11-25 15:51:01,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 210 flow [2022-11-25 15:51:01,661 INFO L130 PetriNetUnfolder]: 7/123 cut-off events. [2022-11-25 15:51:01,665 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 15:51:01,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 7/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 270 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 81. Up to 6 conditions per place. [2022-11-25 15:51:01,671 INFO L119 LiptonReduction]: Number of co-enabled transitions 4284 [2022-11-25 15:51:03,163 INFO L134 LiptonReduction]: Checked pairs total: 12876 [2022-11-25 15:51:03,163 INFO L136 LiptonReduction]: Total number of compositions: 59 [2022-11-25 15:51:03,166 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:51:03,167 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@ecb0a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:51:03,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-25 15:51:03,169 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 15:51:03,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:51:03,169 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:03,170 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:51:03,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-25 15:51:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash 450939649, now seen corresponding path program 1 times [2022-11-25 15:51:03,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418607763] [2022-11-25 15:51:03,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:03,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418607763] [2022-11-25 15:51:03,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418607763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616414314] [2022-11-25 15:51:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:03,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:03,251 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 158 [2022-11-25 15:51:03,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2022-11-25 15:51:03,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:03,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 158 [2022-11-25 15:51:03,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:03,442 INFO L130 PetriNetUnfolder]: 403/941 cut-off events. [2022-11-25 15:51:03,443 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-25 15:51:03,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 941 events. 403/941 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6194 event pairs, 156 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 1330. Up to 493 conditions per place. [2022-11-25 15:51:03,452 INFO L137 encePairwiseOnDemand]: 147/158 looper letters, 38 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2022-11-25 15:51:03,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 243 flow [2022-11-25 15:51:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:03,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2022-11-25 15:51:03,455 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.630801687763713 [2022-11-25 15:51:03,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2022-11-25 15:51:03,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2022-11-25 15:51:03,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:03,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2022-11-25 15:51:03,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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) [2022-11-25 15:51:03,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:03,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:03,460 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 106 flow. Second operand 3 states and 299 transitions. [2022-11-25 15:51:03,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 243 flow [2022-11-25 15:51:03,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 241 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-25 15:51:03,463 INFO L231 Difference]: Finished difference. Result has 53 places, 54 transitions, 170 flow [2022-11-25 15:51:03,463 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=54} [2022-11-25 15:51:03,464 INFO L288 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2022-11-25 15:51:03,464 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 54 transitions, 170 flow [2022-11-25 15:51:03,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2022-11-25 15:51:03,464 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:03,465 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:03,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:51:03,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-25 15:51:03,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,466 INFO L85 PathProgramCache]: Analyzing trace with hash -438611939, now seen corresponding path program 1 times [2022-11-25 15:51:03,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221705772] [2022-11-25 15:51:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221705772] [2022-11-25 15:51:03,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221705772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210476879] [2022-11-25 15:51:03,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:03,567 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 158 [2022-11-25 15:51:03,568 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 54 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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) [2022-11-25 15:51:03,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:03,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 158 [2022-11-25 15:51:03,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:03,789 INFO L130 PetriNetUnfolder]: 640/1358 cut-off events. [2022-11-25 15:51:03,790 INFO L131 PetriNetUnfolder]: For 245/261 co-relation queries the response was YES. [2022-11-25 15:51:03,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1358 events. 640/1358 cut-off events. For 245/261 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9375 event pairs, 262 based on Foata normal form. 0/1289 useless extension candidates. Maximal degree in co-relation 1442. Up to 556 conditions per place. [2022-11-25 15:51:03,800 INFO L137 encePairwiseOnDemand]: 144/158 looper letters, 47 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2022-11-25 15:51:03,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 347 flow [2022-11-25 15:51:03,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2022-11-25 15:51:03,802 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6054852320675106 [2022-11-25 15:51:03,802 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 287 transitions. [2022-11-25 15:51:03,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 287 transitions. [2022-11-25 15:51:03,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:03,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 287 transitions. [2022-11-25 15:51:03,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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) [2022-11-25 15:51:03,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:03,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:03,806 INFO L175 Difference]: Start difference. First operand has 53 places, 54 transitions, 170 flow. Second operand 3 states and 287 transitions. [2022-11-25 15:51:03,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 347 flow [2022-11-25 15:51:03,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:51:03,812 INFO L231 Difference]: Finished difference. Result has 55 places, 64 transitions, 242 flow [2022-11-25 15:51:03,812 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=64} [2022-11-25 15:51:03,813 INFO L288 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2022-11-25 15:51:03,813 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 64 transitions, 242 flow [2022-11-25 15:51:03,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 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) [2022-11-25 15:51:03,814 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:03,814 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:03,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:51:03,814 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-25 15:51:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1397364541, now seen corresponding path program 1 times [2022-11-25 15:51:03,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846325325] [2022-11-25 15:51:03,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846325325] [2022-11-25 15:51:03,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846325325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:03,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341950962] [2022-11-25 15:51:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:03,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:03,911 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 158 [2022-11-25 15:51:03,912 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 64 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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) [2022-11-25 15:51:03,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:03,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 158 [2022-11-25 15:51:03,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:04,113 INFO L130 PetriNetUnfolder]: 522/1202 cut-off events. [2022-11-25 15:51:04,113 INFO L131 PetriNetUnfolder]: For 523/549 co-relation queries the response was YES. [2022-11-25 15:51:04,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2818 conditions, 1202 events. 522/1202 cut-off events. For 523/549 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8333 event pairs, 321 based on Foata normal form. 2/1110 useless extension candidates. Maximal degree in co-relation 767. Up to 798 conditions per place. [2022-11-25 15:51:04,123 INFO L137 encePairwiseOnDemand]: 152/158 looper letters, 39 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2022-11-25 15:51:04,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 78 transitions, 391 flow [2022-11-25 15:51:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:04,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2022-11-25 15:51:04,125 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5864978902953587 [2022-11-25 15:51:04,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2022-11-25 15:51:04,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2022-11-25 15:51:04,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:04,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2022-11-25 15:51:04,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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) [2022-11-25 15:51:04,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:04,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:51:04,132 INFO L175 Difference]: Start difference. First operand has 55 places, 64 transitions, 242 flow. Second operand 3 states and 278 transitions. [2022-11-25 15:51:04,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 78 transitions, 391 flow [2022-11-25 15:51:04,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 78 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:51:04,141 INFO L231 Difference]: Finished difference. Result has 56 places, 70 transitions, 282 flow [2022-11-25 15:51:04,141 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=70} [2022-11-25 15:51:04,143 INFO L288 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2022-11-25 15:51:04,143 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 70 transitions, 282 flow [2022-11-25 15:51:04,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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) [2022-11-25 15:51:04,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:04,144 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-25 15:51:04,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:51:04,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-25 15:51:04,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash -315179547, now seen corresponding path program 1 times [2022-11-25 15:51:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:04,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689926086] [2022-11-25 15:51:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:04,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:04,177 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:51:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:04,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:51:04,190 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:51:04,190 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2022-11-25 15:51:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2022-11-25 15:51:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2022-11-25 15:51:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2022-11-25 15:51:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2022-11-25 15:51:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2022-11-25 15:51:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2022-11-25 15:51:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2022-11-25 15:51:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2022-11-25 15:51:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2022-11-25 15:51:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2022-11-25 15:51:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2022-11-25 15:51:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2022-11-25 15:51:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2022-11-25 15:51:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2022-11-25 15:51:04,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2022-11-25 15:51:04,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:51:04,219 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-25 15:51:04,220 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 15:51:04,220 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-25 15:51:04,239 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:51:04,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 134 transitions, 289 flow [2022-11-25 15:51:04,264 INFO L130 PetriNetUnfolder]: 10/171 cut-off events. [2022-11-25 15:51:04,265 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 15:51:04,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 171 events. 10/171 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 483 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2022-11-25 15:51:04,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 134 transitions, 289 flow [2022-11-25 15:51:04,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 134 transitions, 289 flow [2022-11-25 15:51:04,268 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:51:04,268 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 134 transitions, 289 flow [2022-11-25 15:51:04,269 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 134 transitions, 289 flow [2022-11-25 15:51:04,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 134 transitions, 289 flow [2022-11-25 15:51:04,291 INFO L130 PetriNetUnfolder]: 10/171 cut-off events. [2022-11-25 15:51:04,291 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-25 15:51:04,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 171 events. 10/171 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 483 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2022-11-25 15:51:04,298 INFO L119 LiptonReduction]: Number of co-enabled transitions 9996 [2022-11-25 15:51:06,091 INFO L134 LiptonReduction]: Checked pairs total: 32892 [2022-11-25 15:51:06,091 INFO L136 LiptonReduction]: Total number of compositions: 78 [2022-11-25 15:51:06,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:51:06,095 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@ecb0a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:51:06,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-25 15:51:06,097 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 15:51:06,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:51:06,097 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:06,098 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:51:06,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-25 15:51:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash 686514546, now seen corresponding path program 1 times [2022-11-25 15:51:06,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:06,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86858706] [2022-11-25 15:51:06,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:06,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:06,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:06,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86858706] [2022-11-25 15:51:06,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86858706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:06,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:06,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951130945] [2022-11-25 15:51:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:06,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:06,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 212 [2022-11-25 15:51:06,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 66 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2022-11-25 15:51:06,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:06,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 212 [2022-11-25 15:51:06,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:08,066 INFO L130 PetriNetUnfolder]: 8205/14729 cut-off events. [2022-11-25 15:51:08,067 INFO L131 PetriNetUnfolder]: For 868/868 co-relation queries the response was YES. [2022-11-25 15:51:08,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27117 conditions, 14729 events. 8205/14729 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 125494 event pairs, 3588 based on Foata normal form. 0/12719 useless extension candidates. Maximal degree in co-relation 17698. Up to 7897 conditions per place. [2022-11-25 15:51:08,227 INFO L137 encePairwiseOnDemand]: 196/212 looper letters, 55 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2022-11-25 15:51:08,227 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 359 flow [2022-11-25 15:51:08,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2022-11-25 15:51:08,230 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6367924528301887 [2022-11-25 15:51:08,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2022-11-25 15:51:08,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2022-11-25 15:51:08,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:08,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2022-11-25 15:51:08,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2022-11-25 15:51:08,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:08,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:08,236 INFO L175 Difference]: Start difference. First operand has 70 places, 66 transitions, 153 flow. Second operand 3 states and 405 transitions. [2022-11-25 15:51:08,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 359 flow [2022-11-25 15:51:08,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 351 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-25 15:51:08,242 INFO L231 Difference]: Finished difference. Result has 73 places, 77 transitions, 247 flow [2022-11-25 15:51:08,242 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=73, PETRI_TRANSITIONS=77} [2022-11-25 15:51:08,245 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2022-11-25 15:51:08,245 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 247 flow [2022-11-25 15:51:08,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2022-11-25 15:51:08,246 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:08,246 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:08,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:51:08,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-25 15:51:08,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:08,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1684343889, now seen corresponding path program 1 times [2022-11-25 15:51:08,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:08,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736291656] [2022-11-25 15:51:08,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:08,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:08,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736291656] [2022-11-25 15:51:08,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736291656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:08,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:08,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496020512] [2022-11-25 15:51:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:08,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:08,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:08,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:08,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 212 [2022-11-25 15:51:08,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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) [2022-11-25 15:51:08,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:08,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 212 [2022-11-25 15:51:08,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:12,626 INFO L130 PetriNetUnfolder]: 21246/35287 cut-off events. [2022-11-25 15:51:12,627 INFO L131 PetriNetUnfolder]: For 9708/10294 co-relation queries the response was YES. [2022-11-25 15:51:12,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75804 conditions, 35287 events. 21246/35287 cut-off events. For 9708/10294 co-relation queries the response was YES. Maximal size of possible extension queue 2311. Compared 316115 event pairs, 8225 based on Foata normal form. 1/33437 useless extension candidates. Maximal degree in co-relation 27267. Up to 16335 conditions per place. [2022-11-25 15:51:13,018 INFO L137 encePairwiseOnDemand]: 191/212 looper letters, 77 selfloop transitions, 15 changer transitions 0/119 dead transitions. [2022-11-25 15:51:13,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 573 flow [2022-11-25 15:51:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-11-25 15:51:13,021 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.610062893081761 [2022-11-25 15:51:13,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-11-25 15:51:13,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-11-25 15:51:13,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:13,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-11-25 15:51:13,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2022-11-25 15:51:13,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:13,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:13,026 INFO L175 Difference]: Start difference. First operand has 73 places, 77 transitions, 247 flow. Second operand 3 states and 388 transitions. [2022-11-25 15:51:13,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 573 flow [2022-11-25 15:51:13,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 119 transitions, 533 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:51:13,238 INFO L231 Difference]: Finished difference. Result has 75 places, 92 transitions, 355 flow [2022-11-25 15:51:13,238 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=75, PETRI_TRANSITIONS=92} [2022-11-25 15:51:13,240 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, 5 predicate places. [2022-11-25 15:51:13,240 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 92 transitions, 355 flow [2022-11-25 15:51:13,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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) [2022-11-25 15:51:13,241 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:13,241 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:13,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:51:13,242 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-25 15:51:13,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash -185288808, now seen corresponding path program 1 times [2022-11-25 15:51:13,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:13,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394131271] [2022-11-25 15:51:13,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:13,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:13,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:13,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394131271] [2022-11-25 15:51:13,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394131271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:13,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:13,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:13,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779280855] [2022-11-25 15:51:13,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:13,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:13,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:13,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:13,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:13,357 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 212 [2022-11-25 15:51:13,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 92 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2022-11-25 15:51:13,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:13,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 212 [2022-11-25 15:51:13,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:14,637 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][110], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, 145#(= |#race~s~0| 0), thr1Thread3of3ForFork0InUse, 149#true, 19#L689-5true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:14,637 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:51:14,637 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:51:14,638 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:51:14,638 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:14,917 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:14,917 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:14,918 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:14,919 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 128#L688-7true, 46#L690-1true, 149#true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:14,919 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:51:14,920 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:14,920 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:14,920 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:14,920 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:14,920 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:14,920 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:14,921 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:14,921 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:14,921 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:14,921 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:14,921 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:14,922 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:14,922 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:14,922 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:14,923 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:14,923 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:14,924 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:14,924 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:14,924 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:14,924 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:14,940 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, 145#(= |#race~s~0| 0), thr1Thread3of3ForFork0InUse, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:14,940 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:14,941 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:14,941 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:14,941 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:14,941 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, 42#L696-5true, Black: 143#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 145#(= |#race~s~0| 0), thr1Thread3of3ForFork0InUse, 46#L690-1true, 149#true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:14,942 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:51:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:14,942 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:14,942 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, 145#(= |#race~s~0| 0), thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:14,942 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:14,943 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:14,943 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:14,943 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,055 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][110], [57#L689-1true, Black: 143#true, thr1Thread1of3ForFork0InUse, 101#L696-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 149#true, 19#L689-5true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:15,056 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,056 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,056 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,056 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,128 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 128#L688-7true, 149#true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:15,129 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,129 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,129 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,129 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,139 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 149#true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:15,140 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,140 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,140 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,140 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,521 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [42#L696-5true, Black: 143#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,522 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,522 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,522 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,522 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,522 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,523 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,523 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L689-2-->L689-4: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet4_13| |v_#race~s~0_317|) InVars {} OutVars{#race~s~0=|v_#race~s~0_317|, thr1Thread3of3ForFork0_#t~nondet4=|v_thr1Thread3of3ForFork0_#t~nondet4_13|} AuxVars[] AssignedVars[#race~s~0, thr1Thread3of3ForFork0_#t~nondet4][62], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 145#(= |#race~s~0| 0), 143#true, 59#L689-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 128#L688-7true, 149#true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,524 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,524 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,524 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,524 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,536 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,537 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,537 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,537 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,537 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:15,537 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L689-2-->L689-4: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet4_13| |v_#race~s~0_317|) InVars {} OutVars{#race~s~0=|v_#race~s~0_317|, thr1Thread3of3ForFork0_#t~nondet4=|v_thr1Thread3of3ForFork0_#t~nondet4_13|} AuxVars[] AssignedVars[#race~s~0, thr1Thread3of3ForFork0_#t~nondet4][62], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 145#(= |#race~s~0| 0), 143#true, 59#L689-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 149#true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,538 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,538 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,538 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,539 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,599 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [thr1Thread1of3ForFork0InUse, Black: 143#true, 101#L696-4true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,599 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:15,599 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:15,600 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:15,600 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:15,601 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,601 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,601 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,601 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,601 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,602 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 128#L688-7true, 46#L690-1true, 149#true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:15,602 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-11-25 15:51:15,602 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:15,602 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 15:51:15,602 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:15,602 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,603 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:15,603 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:15,603 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:15,603 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:15,603 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:15,605 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [thr1Thread1of3ForFork0InUse, Black: 143#true, 101#L696-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,605 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,605 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,606 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,606 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,606 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,622 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, 145#(= |#race~s~0| 0), thr1Thread3of3ForFork0InUse, 46#L690-1true, 149#true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:15,622 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-11-25 15:51:15,623 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:15,623 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:15,623 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 15:51:15,623 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, 145#(= |#race~s~0| 0), thr1Thread3of3ForFork0InUse, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,623 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:15,623 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:15,624 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, 145#(= |#race~s~0| 0), thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,624 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,624 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,756 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [101#L696-4true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 128#L688-7true, 149#true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:15,756 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,757 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,757 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,757 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, 101#L696-4true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 149#true, 118#L689true, Black: 137#true]) [2022-11-25 15:51:15,769 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,770 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,770 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,770 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,931 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [Black: 143#true, 101#L696-4true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,931 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,931 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,931 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,931 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,931 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,932 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,932 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L689-2-->L689-4: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet4_13| |v_#race~s~0_317|) InVars {} OutVars{#race~s~0=|v_#race~s~0_317|, thr1Thread3of3ForFork0_#t~nondet4=|v_thr1Thread3of3ForFork0_#t~nondet4_13|} AuxVars[] AssignedVars[#race~s~0, thr1Thread3of3ForFork0_#t~nondet4][62], [thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 145#(= |#race~s~0| 0), 143#true, 59#L689-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 128#L688-7true, 149#true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,932 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,933 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,933 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,933 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,949 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][60], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 145#(= |#race~s~0| 0), 107#thr1EXITtrue, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,950 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,950 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,950 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,950 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,950 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:15,951 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L689-2-->L689-4: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet4_13| |v_#race~s~0_317|) InVars {} OutVars{#race~s~0=|v_#race~s~0_317|, thr1Thread3of3ForFork0_#t~nondet4=|v_thr1Thread3of3ForFork0_#t~nondet4_13|} AuxVars[] AssignedVars[#race~s~0, thr1Thread3of3ForFork0_#t~nondet4][62], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 145#(= |#race~s~0| 0), 143#true, 59#L689-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 149#true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:15,951 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,951 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,951 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:15,952 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:16,384 INFO L130 PetriNetUnfolder]: 18098/32023 cut-off events. [2022-11-25 15:51:16,384 INFO L131 PetriNetUnfolder]: For 19258/20890 co-relation queries the response was YES. [2022-11-25 15:51:16,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78960 conditions, 32023 events. 18098/32023 cut-off events. For 19258/20890 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 301635 event pairs, 9914 based on Foata normal form. 128/29836 useless extension candidates. Maximal degree in co-relation 30924. Up to 21780 conditions per place. [2022-11-25 15:51:16,622 INFO L137 encePairwiseOnDemand]: 202/212 looper letters, 66 selfloop transitions, 16 changer transitions 0/125 dead transitions. [2022-11-25 15:51:16,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 125 transitions, 651 flow [2022-11-25 15:51:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2022-11-25 15:51:16,624 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6053459119496856 [2022-11-25 15:51:16,624 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2022-11-25 15:51:16,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2022-11-25 15:51:16,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:16,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2022-11-25 15:51:16,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2022-11-25 15:51:16,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:16,629 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:16,629 INFO L175 Difference]: Start difference. First operand has 75 places, 92 transitions, 355 flow. Second operand 3 states and 385 transitions. [2022-11-25 15:51:16,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 125 transitions, 651 flow [2022-11-25 15:51:16,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 125 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:51:16,667 INFO L231 Difference]: Finished difference. Result has 77 places, 106 transitions, 471 flow [2022-11-25 15:51:16,668 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=77, PETRI_TRANSITIONS=106} [2022-11-25 15:51:16,669 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, 7 predicate places. [2022-11-25 15:51:16,669 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 106 transitions, 471 flow [2022-11-25 15:51:16,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2022-11-25 15:51:16,670 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:16,670 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:16,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:51:16,670 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-25 15:51:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:16,671 INFO L85 PathProgramCache]: Analyzing trace with hash -905256848, now seen corresponding path program 1 times [2022-11-25 15:51:16,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:16,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805716351] [2022-11-25 15:51:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:16,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805716351] [2022-11-25 15:51:16,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805716351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:16,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:16,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:16,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791487501] [2022-11-25 15:51:16,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:16,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:16,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:16,738 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 212 [2022-11-25 15:51:16,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 106 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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) [2022-11-25 15:51:16,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:16,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 212 [2022-11-25 15:51:16,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:18,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][113], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 19#L689-5true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,108 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,108 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:51:18,108 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:51:18,109 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,281 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][56], [42#L696-5true, Black: 143#true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, 71#L688-6true, 149#true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,281 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,281 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,281 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,282 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][56], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 71#L688-6true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,284 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,284 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,284 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,285 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,504 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][122], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:18,504 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,504 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:18,505 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:18,505 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,505 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true]) [2022-11-25 15:51:18,505 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,505 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,505 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,505 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,505 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 46#L690-1true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,506 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:51:18,506 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:18,506 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:18,506 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:18,527 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][122], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:18,527 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,528 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,528 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:18,528 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:18,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, 155#true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:18,528 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,528 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,529 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,529 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 46#L690-1true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,529 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:51:18,529 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:18,529 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:18,529 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:18,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][113], [thr1Thread1of3ForFork0InUse, Black: 143#true, 101#L696-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, 19#L689-5true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,792 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,793 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,793 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,793 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,876 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, 16#L688-7true, thr1Thread3of3ForFork0InUse, 79#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,876 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,876 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,877 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,877 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,895 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 80#L689-1true, 79#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,896 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,896 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,896 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,896 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,897 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true]) [2022-11-25 15:51:18,897 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,897 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,897 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,898 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,898 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:18,898 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][122], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:18,898 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,898 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:18,898 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,899 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:18,899 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,921 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][122], [57#L689-1true, 42#L696-5true, Black: 143#true, thr1Thread1of3ForFork0InUse, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:18,922 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,922 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,922 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:18,922 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:18,922 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:18,989 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][56], [Black: 143#true, thr1Thread1of3ForFork0InUse, 101#L696-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 71#L688-6true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,989 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,989 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,989 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,989 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][56], [57#L689-1true, thr1Thread1of3ForFork0InUse, Black: 143#true, 101#L696-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 71#L688-6true, 155#true, Black: 137#true]) [2022-11-25 15:51:18,992 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,992 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,992 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:18,992 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,091 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][42], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 62#L689-4true, 149#true, 71#L688-6true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,091 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is not cut-off event [2022-11-25 15:51:19,092 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2022-11-25 15:51:19,092 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2022-11-25 15:51:19,092 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is not cut-off event [2022-11-25 15:51:19,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 13#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,105 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,105 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,106 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:19,106 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:19,133 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 13#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,133 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,133 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:19,133 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,134 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:19,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][122], [thr1Thread1of3ForFork0InUse, Black: 143#true, 101#L696-4true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:19,205 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,205 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:19,206 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,206 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:19,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true]) [2022-11-25 15:51:19,206 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,206 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,206 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,206 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,207 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 46#L690-1true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,207 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-11-25 15:51:19,207 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:19,207 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 15:51:19,207 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:19,242 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][122], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:19,242 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,242 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:19,243 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:19,243 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,243 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true]) [2022-11-25 15:51:19,243 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,244 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,244 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,244 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,244 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 46#L690-1true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,245 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-11-25 15:51:19,245 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:19,245 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 15:51:19,245 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:19,387 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, 16#L688-7true, thr1Thread3of3ForFork0InUse, 79#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,387 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,387 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,388 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,388 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,408 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [Black: 143#true, thr1Thread1of3ForFork0InUse, 101#L696-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 80#L689-1true, 79#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,408 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,409 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,409 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,409 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,410 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, 155#true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:19,410 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,410 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,410 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,411 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,411 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,411 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][122], [Black: 143#true, 101#L696-4true, thr1Thread1of3ForFork0InUse, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:19,411 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,411 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:19,411 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,412 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:19,412 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,437 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][122], [57#L689-1true, Black: 143#true, thr1Thread1of3ForFork0InUse, 101#L696-4true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:19,438 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,438 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:19,438 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:19,438 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,438 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:19,557 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][42], [Black: 143#true, thr1Thread1of3ForFork0InUse, 101#L696-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 62#L689-4true, 149#true, 71#L688-6true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,557 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is not cut-off event [2022-11-25 15:51:19,557 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2022-11-25 15:51:19,558 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2022-11-25 15:51:19,558 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is not cut-off event [2022-11-25 15:51:19,574 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [Black: 143#true, 101#L696-4true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 13#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,574 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,575 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,575 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,575 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,604 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][57], [57#L689-1true, Black: 143#true, thr1Thread1of3ForFork0InUse, 101#L696-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 13#thr1Err4ASSERT_VIOLATIONDATA_RACEtrue, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-25 15:51:19,604 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,604 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:19,604 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:19,604 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:20,243 INFO L130 PetriNetUnfolder]: 18952/33301 cut-off events. [2022-11-25 15:51:20,244 INFO L131 PetriNetUnfolder]: For 31297/33874 co-relation queries the response was YES. [2022-11-25 15:51:20,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88744 conditions, 33301 events. 18952/33301 cut-off events. For 31297/33874 co-relation queries the response was YES. Maximal size of possible extension queue 2143. Compared 313665 event pairs, 9998 based on Foata normal form. 371/30614 useless extension candidates. Maximal degree in co-relation 36139. Up to 23467 conditions per place. [2022-11-25 15:51:20,498 INFO L137 encePairwiseOnDemand]: 205/212 looper letters, 80 selfloop transitions, 11 changer transitions 0/138 dead transitions. [2022-11-25 15:51:20,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 138 transitions, 791 flow [2022-11-25 15:51:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2022-11-25 15:51:20,500 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2022-11-25 15:51:20,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2022-11-25 15:51:20,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2022-11-25 15:51:20,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:20,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2022-11-25 15:51:20,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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) [2022-11-25 15:51:20,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:20,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:20,505 INFO L175 Difference]: Start difference. First operand has 77 places, 106 transitions, 471 flow. Second operand 3 states and 392 transitions. [2022-11-25 15:51:20,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 138 transitions, 791 flow [2022-11-25 15:51:20,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 138 transitions, 759 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:51:20,679 INFO L231 Difference]: Finished difference. Result has 78 places, 115 transitions, 526 flow [2022-11-25 15:51:20,679 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=78, PETRI_TRANSITIONS=115} [2022-11-25 15:51:20,680 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2022-11-25 15:51:20,680 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 115 transitions, 526 flow [2022-11-25 15:51:20,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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) [2022-11-25 15:51:20,680 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:20,680 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:20,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:51:20,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-25 15:51:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash 627155430, now seen corresponding path program 1 times [2022-11-25 15:51:20,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:20,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667366907] [2022-11-25 15:51:20,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 15:51:20,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:20,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667366907] [2022-11-25 15:51:20,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667366907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:20,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:20,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:20,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547570191] [2022-11-25 15:51:20,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:20,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:20,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:20,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:20,752 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 212 [2022-11-25 15:51:20,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 115 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2022-11-25 15:51:20,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:20,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 212 [2022-11-25 15:51:20,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:21,995 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][121], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, Black: 143#true, 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 19#L689-5true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:21,995 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:51:21,995 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:21,995 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:51:21,995 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-11-25 15:51:22,193 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][58], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 71#L688-6true, 155#true, Black: 137#true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,194 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,194 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,194 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,194 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,196 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][58], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 71#L688-6true, 155#true, Black: 137#true, 57#L689-1true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,197 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,197 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,197 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,197 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,407 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, Black: 143#true, thr1Thread1of3ForFork0InUse, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 160#true, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:22,408 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:22,408 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:22,408 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:22,408 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:22,409 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, Black: 143#true, 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 46#L690-1true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,409 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:51:22,409 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:22,409 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:22,410 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:22,410 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:22,410 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:22,410 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:22,410 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:22,410 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:22,410 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:22,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true, Black: 143#true, 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,410 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,411 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,411 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,411 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,412 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,412 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,412 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,412 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,412 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,412 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,429 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true, 57#L689-1true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,429 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,429 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,429 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,430 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,430 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:22,430 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-11-25 15:51:22,430 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:22,430 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-11-25 15:51:22,430 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:22,430 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, 57#L689-1true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 46#L690-1true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,430 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-11-25 15:51:22,430 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:22,431 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:22,431 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-11-25 15:51:22,518 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][121], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, 101#L696-4true, Black: 143#true, 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 19#L689-5true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,518 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,519 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,519 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:22,519 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,898 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][58], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 71#L688-6true, 155#true, Black: 137#true, Black: 143#true, 101#L696-4true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,898 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,898 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,898 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,898 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,900 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([669] L688-2-->L688-6: Formula: (and (= |v_#race~s~0_547| 0) (not (= (mod v_~l~0_241 256) 0)) (not |v_thr1Thread3of3ForFork0_#t~short3_55|)) InVars {~l~0=v_~l~0_241} OutVars{thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_55|, ~l~0=v_~l~0_241, #race~s~0=|v_#race~s~0_547|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][58], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 71#L688-6true, 155#true, Black: 137#true, 57#L689-1true, 101#L696-4true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:22,900 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,901 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,901 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:22,901 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,017 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,017 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,018 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,018 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:23,018 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,018 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:23,018 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,019 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L689-2-->L689-4: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet4_13| |v_#race~s~0_317|) InVars {} OutVars{#race~s~0=|v_#race~s~0_317|, thr1Thread3of3ForFork0_#t~nondet4=|v_thr1Thread3of3ForFork0_#t~nondet4_13|} AuxVars[] AssignedVars[#race~s~0, thr1Thread3of3ForFork0_#t~nondet4][61], [42#L696-5true, thr1Thread1of3ForFork0InUse, 59#L689-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 139#(= |#race~l~0| 0), 155#true, Black: 145#(= |#race~s~0| 0), 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,019 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,020 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,020 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,020 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,045 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true, 57#L689-1true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,045 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,045 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:23,045 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,046 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,046 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-11-25 15:51:23,047 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L689-2-->L689-4: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet4_13| |v_#race~s~0_317|) InVars {} OutVars{#race~s~0=|v_#race~s~0_317|, thr1Thread3of3ForFork0_#t~nondet4=|v_thr1Thread3of3ForFork0_#t~nondet4_13|} AuxVars[] AssignedVars[#race~s~0, thr1Thread3of3ForFork0_#t~nondet4][61], [42#L696-5true, thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 59#L689-4true, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 155#true, Black: 139#(= |#race~l~0| 0), 57#L689-1true, Black: 145#(= |#race~s~0| 0), 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,047 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,047 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,048 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,048 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,121 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [Black: 143#true, thr1Thread1of3ForFork0InUse, 101#L696-4true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 160#true, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:23,121 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:23,121 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:23,121 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:23,122 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:23,123 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, Black: 143#true, 101#L696-4true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, 46#L690-1true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,123 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-11-25 15:51:23,123 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:23,123 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:23,124 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 15:51:23,124 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true, Black: 143#true, 101#L696-4true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,124 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,124 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,124 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,124 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,125 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [thr1Thread1of3ForFork0InUse, Black: 143#true, 101#L696-4true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:23,125 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:23,125 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:23,125 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:23,125 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:23,125 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:23,126 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, 155#true, Black: 139#(= |#race~l~0| 0), 101#L696-4true, Black: 143#true, 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,127 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,127 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,127 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,127 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,127 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, 155#true, Black: 139#(= |#race~l~0| 0), 57#L689-1true, Black: 143#true, 101#L696-4true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,151 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,151 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,152 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,152 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,152 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, 57#L689-1true, Black: 143#true, 101#L696-4true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 46#L690-1true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,152 INFO L383 tUnfolder$Statistics]: this new event has 32 ancestors and is cut-off event [2022-11-25 15:51:23,152 INFO L386 tUnfolder$Statistics]: existing Event has 32 ancestors and is cut-off event [2022-11-25 15:51:23,152 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:23,152 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-11-25 15:51:23,153 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [57#L689-1true, thr1Thread1of3ForFork0InUse, 101#L696-4true, Black: 143#true, 15#L690-3true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 160#true, 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|), Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 118#L689true, Black: 139#(= |#race~l~0| 0)]) [2022-11-25 15:51:23,153 INFO L383 tUnfolder$Statistics]: this new event has 33 ancestors and is cut-off event [2022-11-25 15:51:23,153 INFO L386 tUnfolder$Statistics]: existing Event has 33 ancestors and is cut-off event [2022-11-25 15:51:23,153 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:23,153 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-11-25 15:51:23,523 INFO L381 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, Black: 139#(= |#race~l~0| 0), 155#true, Black: 143#true, 101#L696-4true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 128#L688-7true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,524 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,524 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,524 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,524 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,524 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,524 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,525 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L689-2-->L689-4: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet4_13| |v_#race~s~0_317|) InVars {} OutVars{#race~s~0=|v_#race~s~0_317|, thr1Thread3of3ForFork0_#t~nondet4=|v_thr1Thread3of3ForFork0_#t~nondet4_13|} AuxVars[] AssignedVars[#race~s~0, thr1Thread3of3ForFork0_#t~nondet4][61], [thr1Thread1of3ForFork0InUse, 59#L689-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 155#true, Black: 139#(= |#race~l~0| 0), 101#L696-4true, Black: 145#(= |#race~s~0| 0), 160#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,525 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,525 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,525 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,526 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,554 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([688] L688-8-->L689: Formula: (and |v_thr1Thread3of3ForFork0_#t~short3_In_1| (= |v_#race~s~0_Out_26| 0)) InVars {thr1Thread3of3ForFork0_#t~short3=|v_thr1Thread3of3ForFork0_#t~short3_In_1|} OutVars{#race~s~0=|v_#race~s~0_Out_26|} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_#t~short3, #race~s~0][59], [thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, 118#L689true, 155#true, Black: 139#(= |#race~l~0| 0), 57#L689-1true, 101#L696-4true, Black: 143#true, 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,554 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,554 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,554 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,555 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,555 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-11-25 15:51:23,556 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([619] L689-2-->L689-4: Formula: (= |v_thr1Thread3of3ForFork0_#t~nondet4_13| |v_#race~s~0_317|) InVars {} OutVars{#race~s~0=|v_#race~s~0_317|, thr1Thread3of3ForFork0_#t~nondet4=|v_thr1Thread3of3ForFork0_#t~nondet4_13|} AuxVars[] AssignedVars[#race~s~0, thr1Thread3of3ForFork0_#t~nondet4][61], [thr1Thread1of3ForFork0InUse, 59#L689-4true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 107#thr1EXITtrue, Black: 139#(= |#race~l~0| 0), 155#true, 57#L689-1true, 101#L696-4true, Black: 145#(= |#race~s~0| 0), 160#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-25 15:51:23,556 INFO L383 tUnfolder$Statistics]: this new event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,556 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,556 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:23,556 INFO L386 tUnfolder$Statistics]: existing Event has 34 ancestors and is cut-off event [2022-11-25 15:51:24,243 INFO L130 PetriNetUnfolder]: 20088/35516 cut-off events. [2022-11-25 15:51:24,244 INFO L131 PetriNetUnfolder]: For 36181/39642 co-relation queries the response was YES. [2022-11-25 15:51:24,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97986 conditions, 35516 events. 20088/35516 cut-off events. For 36181/39642 co-relation queries the response was YES. Maximal size of possible extension queue 2187. Compared 338343 event pairs, 10121 based on Foata normal form. 587/32732 useless extension candidates. Maximal degree in co-relation 67882. Up to 25361 conditions per place. [2022-11-25 15:51:24,503 INFO L137 encePairwiseOnDemand]: 203/212 looper letters, 85 selfloop transitions, 22 changer transitions 0/154 dead transitions. [2022-11-25 15:51:24,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 154 transitions, 932 flow [2022-11-25 15:51:24,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2022-11-25 15:51:24,505 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5990566037735849 [2022-11-25 15:51:24,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2022-11-25 15:51:24,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2022-11-25 15:51:24,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:24,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2022-11-25 15:51:24,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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) [2022-11-25 15:51:24,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:24,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 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) [2022-11-25 15:51:24,513 INFO L175 Difference]: Start difference. First operand has 78 places, 115 transitions, 526 flow. Second operand 3 states and 381 transitions. [2022-11-25 15:51:24,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 154 transitions, 932 flow [2022-11-25 15:51:24,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 154 transitions, 916 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:51:24,558 INFO L231 Difference]: Finished difference. Result has 80 places, 133 transitions, 715 flow [2022-11-25 15:51:24,558 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=80, PETRI_TRANSITIONS=133} [2022-11-25 15:51:24,559 INFO L288 CegarLoopForPetriNet]: 70 programPoint places, 10 predicate places. [2022-11-25 15:51:24,559 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 133 transitions, 715 flow [2022-11-25 15:51:24,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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) [2022-11-25 15:51:24,560 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:24,560 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2022-11-25 15:51:24,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:51:24,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-25 15:51:24,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1294014533, now seen corresponding path program 1 times [2022-11-25 15:51:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:24,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812669300] [2022-11-25 15:51:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:24,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:51:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:51:24,604 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:51:24,604 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:51:24,604 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-25 15:51:24,605 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2022-11-25 15:51:24,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2022-11-25 15:51:24,606 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2022-11-25 15:51:24,611 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2022-11-25 15:51:24,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2022-11-25 15:51:24,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2022-11-25 15:51:24,612 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2022-11-25 15:51:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2022-11-25 15:51:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2022-11-25 15:51:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2022-11-25 15:51:24,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2022-11-25 15:51:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2022-11-25 15:51:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2022-11-25 15:51:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2022-11-25 15:51:24,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2022-11-25 15:51:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2022-11-25 15:51:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2022-11-25 15:51:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2022-11-25 15:51:24,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2022-11-25 15:51:24,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2022-11-25 15:51:24,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:51:24,616 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-25 15:51:24,617 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-25 15:51:24,617 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-25 15:51:24,661 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:51:24,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 169 transitions, 370 flow [2022-11-25 15:51:24,706 INFO L130 PetriNetUnfolder]: 13/219 cut-off events. [2022-11-25 15:51:24,706 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 15:51:24,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 219 events. 13/219 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 673 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 179. Up to 10 conditions per place. [2022-11-25 15:51:24,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 169 transitions, 370 flow [2022-11-25 15:51:24,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 169 transitions, 370 flow [2022-11-25 15:51:24,716 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:51:24,716 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 169 transitions, 370 flow [2022-11-25 15:51:24,717 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 169 transitions, 370 flow [2022-11-25 15:51:24,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 169 transitions, 370 flow [2022-11-25 15:51:24,747 INFO L130 PetriNetUnfolder]: 13/219 cut-off events. [2022-11-25 15:51:24,747 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 15:51:24,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 219 events. 13/219 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 673 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 179. Up to 10 conditions per place. [2022-11-25 15:51:24,761 INFO L119 LiptonReduction]: Number of co-enabled transitions 18088 [2022-11-25 15:51:26,728 INFO L134 LiptonReduction]: Checked pairs total: 64260 [2022-11-25 15:51:26,728 INFO L136 LiptonReduction]: Total number of compositions: 93 [2022-11-25 15:51:26,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:51:26,731 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@ecb0a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:51:26,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-25 15:51:26,733 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 15:51:26,733 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:51:26,733 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:26,734 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:51:26,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-11-25 15:51:26,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:26,735 INFO L85 PathProgramCache]: Analyzing trace with hash 969896770, now seen corresponding path program 1 times [2022-11-25 15:51:26,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:26,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94442420] [2022-11-25 15:51:26,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:26,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:26,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:26,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94442420] [2022-11-25 15:51:26,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94442420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:26,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:26,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:26,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507318303] [2022-11-25 15:51:26,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:26,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:26,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:26,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:26,812 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 262 [2022-11-25 15:51:26,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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) [2022-11-25 15:51:26,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:26,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 262 [2022-11-25 15:51:26,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:51:46,419 INFO L130 PetriNetUnfolder]: 150293/236027 cut-off events. [2022-11-25 15:51:46,419 INFO L131 PetriNetUnfolder]: For 20749/20749 co-relation queries the response was YES. [2022-11-25 15:51:47,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444269 conditions, 236027 events. 150293/236027 cut-off events. For 20749/20749 co-relation queries the response was YES. Maximal size of possible extension queue 9352. Compared 2335561 event pairs, 68820 based on Foata normal form. 0/202971 useless extension candidates. Maximal degree in co-relation 242902. Up to 126753 conditions per place. [2022-11-25 15:51:48,436 INFO L137 encePairwiseOnDemand]: 241/262 looper letters, 74 selfloop transitions, 16 changer transitions 0/130 dead transitions. [2022-11-25 15:51:48,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 130 transitions, 493 flow [2022-11-25 15:51:48,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:48,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:51:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2022-11-25 15:51:48,439 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6526717557251909 [2022-11-25 15:51:48,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2022-11-25 15:51:48,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2022-11-25 15:51:48,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:51:48,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2022-11-25 15:51:48,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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) [2022-11-25 15:51:48,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 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) [2022-11-25 15:51:48,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 262.0) internal successors, (1048), 4 states have internal predecessors, (1048), 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) [2022-11-25 15:51:48,445 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 210 flow. Second operand 3 states and 513 transitions. [2022-11-25 15:51:48,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 130 transitions, 493 flow [2022-11-25 15:51:48,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 130 transitions, 475 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-11-25 15:51:48,459 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 332 flow [2022-11-25 15:51:48,460 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2022-11-25 15:51:48,460 INFO L288 CegarLoopForPetriNet]: 94 programPoint places, 3 predicate places. [2022-11-25 15:51:48,461 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 332 flow [2022-11-25 15:51:48,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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) [2022-11-25 15:51:48,461 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:51:48,461 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:48,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:51:48,462 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-11-25 15:51:48,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:48,463 INFO L85 PathProgramCache]: Analyzing trace with hash 63048051, now seen corresponding path program 1 times [2022-11-25 15:51:48,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:48,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875403295] [2022-11-25 15:51:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:51:48,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:48,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875403295] [2022-11-25 15:51:48,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875403295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:48,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:48,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928410793] [2022-11-25 15:51:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:48,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:48,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:48,534 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 262 [2022-11-25 15:51:48,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2022-11-25 15:51:48,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:51:48,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 262 [2022-11-25 15:51:48,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand