./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 e04fb08f 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_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/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_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 12:48:28,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:48:28,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:48:28,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:48:28,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:48:28,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:48:28,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:48:28,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:48:28,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:48:28,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:48:28,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:48:28,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:48:28,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:48:28,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:48:28,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:48:28,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:48:28,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:48:28,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:48:28,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:48:28,156 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:48:28,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:48:28,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:48:28,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:48:28,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:48:28,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:48:28,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:48:28,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:48:28,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:48:28,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:48:28,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:48:28,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:48:28,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:48:28,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:48:28,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:48:28,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:48:28,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:48:28,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:48:28,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:48:28,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:48:28,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:48:28,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:48:28,191 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 12:48:28,232 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:48:28,232 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:48:28,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:48:28,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:48:28,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:48:28,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:48:28,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:48:28,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:48:28,235 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:48:28,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:48:28,236 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:48:28,237 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:48:28,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:48:28,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:48:28,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:48:28,237 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:48:28,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:48:28,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:48:28,238 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 12:48:28,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:48:28,238 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:48:28,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:48:28,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:48:28,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:48:28,239 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:48:28,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:48:28,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:48:28,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:48:28,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:48:28,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:48:28,240 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:48:28,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:48:28,241 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:48:28,241 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:48:28,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:48:28,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/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_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8 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-16 12:48:28,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:48:28,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:48:28,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:48:28,637 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:48:28,638 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:48:28,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i [2022-11-16 12:48:28,736 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/data/df5837987/8e22a563f21b4253b4c054898de552c6/FLAG6dfb4cdbe [2022-11-16 12:48:29,278 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:48:29,279 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i [2022-11-16 12:48:29,292 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/data/df5837987/8e22a563f21b4253b4c054898de552c6/FLAG6dfb4cdbe [2022-11-16 12:48:29,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/data/df5837987/8e22a563f21b4253b4c054898de552c6 [2022-11-16 12:48:29,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:48:29,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:48:29,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:48:29,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:48:29,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:48:29,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:48:29" (1/1) ... [2022-11-16 12:48:29,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789b6be3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:29, skipping insertion in model container [2022-11-16 12:48:29,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:48:29" (1/1) ... [2022-11-16 12:48:29,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:48:29,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:48:30,112 WARN L229 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_a0cd1374-08ef-4d54-98cd-51828e014aa3/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i[29939,29952] [2022-11-16 12:48:30,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:48:30,130 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:48:30,169 WARN L229 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_a0cd1374-08ef-4d54-98cd-51828e014aa3/sv-benchmarks/c/pthread-ext/46_monabsex2_vs-b.i[29939,29952] [2022-11-16 12:48:30,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:48:30,205 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:48:30,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30 WrapperNode [2022-11-16 12:48:30,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:48:30,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:48:30,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:48:30,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:48:30,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,270 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-11-16 12:48:30,270 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:48:30,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:48:30,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:48:30,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:48:30,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,317 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:48:30,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:48:30,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:48:30,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:48:30,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (1/1) ... [2022-11-16 12:48:30,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:48:30,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:48:30,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:48:30,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0cd1374-08ef-4d54-98cd-51828e014aa3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:48:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-11-16 12:48:30,428 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-11-16 12:48:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:48:30,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:48:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:48:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:48:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:48:30,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:48:30,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:48:30,430 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:48:30,602 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:48:30,604 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:48:30,753 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:48:30,760 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:48:30,761 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:48:30,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:48:30 BoogieIcfgContainer [2022-11-16 12:48:30,763 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:48:30,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:48:30,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:48:30,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:48:30,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:48:29" (1/3) ... [2022-11-16 12:48:30,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f6c738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:48:30, skipping insertion in model container [2022-11-16 12:48:30,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:48:30" (2/3) ... [2022-11-16 12:48:30,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f6c738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:48:30, skipping insertion in model container [2022-11-16 12:48:30,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:48:30" (3/3) ... [2022-11-16 12:48:30,776 INFO L112 eAbstractionObserver]: Analyzing ICFG 46_monabsex2_vs-b.i [2022-11-16 12:48:30,792 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:48:30,804 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:48:30,805 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-11-16 12:48:30,805 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:48:30,882 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:48:30,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 64 transitions, 133 flow [2022-11-16 12:48:30,977 INFO L130 PetriNetUnfolder]: 4/75 cut-off events. [2022-11-16 12:48:30,977 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:48:30,983 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-16 12:48:30,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 64 transitions, 133 flow [2022-11-16 12:48:30,989 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 64 transitions, 133 flow [2022-11-16 12:48:31,001 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:48:31,009 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;@61ce1f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:48:31,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-16 12:48:31,021 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-16 12:48:31,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:48:31,022 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:31,023 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:31,023 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-16 12:48:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 341928378, now seen corresponding path program 1 times [2022-11-16 12:48:31,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:31,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321363493] [2022-11-16 12:48:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:31,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:31,273 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-16 12:48:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:31,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321363493] [2022-11-16 12:48:31,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321363493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:31,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:31,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549597577] [2022-11-16 12:48:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:31,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:31,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:31,328 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 64 [2022-11-16 12:48:31,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-16 12:48:31,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:31,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 64 [2022-11-16 12:48:31,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:31,378 INFO L130 PetriNetUnfolder]: 1/58 cut-off events. [2022-11-16 12:48:31,378 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 12:48:31,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 58 events. 1/58 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 8/60 useless extension candidates. Maximal degree in co-relation 42. Up to 5 conditions per place. [2022-11-16 12:48:31,380 INFO L137 encePairwiseOnDemand]: 58/64 looper letters, 4 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2022-11-16 12:48:31,380 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 125 flow [2022-11-16 12:48:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-11-16 12:48:31,394 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.890625 [2022-11-16 12:48:31,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 171 transitions. [2022-11-16 12:48:31,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 171 transitions. [2022-11-16 12:48:31,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:31,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 171 transitions. [2022-11-16 12:48:31,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-16 12:48:31,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-16 12:48:31,408 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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-16 12:48:31,410 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 133 flow. Second operand 3 states and 171 transitions. [2022-11-16 12:48:31,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 125 flow [2022-11-16 12:48:31,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 125 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:48:31,417 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 117 flow [2022-11-16 12:48:31,419 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2022-11-16 12:48:31,423 INFO L288 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2022-11-16 12:48:31,424 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 117 flow [2022-11-16 12:48:31,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-16 12:48:31,424 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:31,424 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:31,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:48:31,425 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-16 12:48:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:31,426 INFO L85 PathProgramCache]: Analyzing trace with hash -763135107, now seen corresponding path program 1 times [2022-11-16 12:48:31,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:31,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078074721] [2022-11-16 12:48:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:31,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:48:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:31,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:48:31,494 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:48:31,496 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2022-11-16 12:48:31,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2022-11-16 12:48:31,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2022-11-16 12:48:31,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2022-11-16 12:48:31,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2022-11-16 12:48:31,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2022-11-16 12:48:31,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2022-11-16 12:48:31,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2022-11-16 12:48:31,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2022-11-16 12:48:31,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2022-11-16 12:48:31,500 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2022-11-16 12:48:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:48:31,501 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-16 12:48:31,504 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:48:31,504 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-16 12:48:31,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:48:31,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 210 flow [2022-11-16 12:48:31,598 INFO L130 PetriNetUnfolder]: 7/123 cut-off events. [2022-11-16 12:48:31,598 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 12:48:31,601 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-16 12:48:31,601 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 210 flow [2022-11-16 12:48:31,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 99 transitions, 210 flow [2022-11-16 12:48:31,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:48:31,607 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;@61ce1f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:48:31,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-16 12:48:31,616 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-16 12:48:31,616 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:48:31,616 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:31,616 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:31,617 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-16 12:48:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash 980846205, now seen corresponding path program 1 times [2022-11-16 12:48:31,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:31,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838620120] [2022-11-16 12:48:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:31,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:31,713 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-16 12:48:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838620120] [2022-11-16 12:48:31,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838620120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:31,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60454331] [2022-11-16 12:48:31,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:31,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:31,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:31,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:31,719 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 99 [2022-11-16 12:48:31,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-16 12:48:31,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:31,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 99 [2022-11-16 12:48:31,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:31,875 INFO L130 PetriNetUnfolder]: 54/441 cut-off events. [2022-11-16 12:48:31,876 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-16 12:48:31,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 441 events. 54/441 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2368 event pairs, 13 based on Foata normal form. 78/431 useless extension candidates. Maximal degree in co-relation 326. Up to 61 conditions per place. [2022-11-16 12:48:31,883 INFO L137 encePairwiseOnDemand]: 87/99 looper letters, 19 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2022-11-16 12:48:31,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 99 transitions, 265 flow [2022-11-16 12:48:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-11-16 12:48:31,886 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9158249158249159 [2022-11-16 12:48:31,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2022-11-16 12:48:31,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2022-11-16 12:48:31,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:31,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2022-11-16 12:48:31,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-16 12:48:31,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-16 12:48:31,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-16 12:48:31,893 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 210 flow. Second operand 3 states and 272 transitions. [2022-11-16 12:48:31,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 99 transitions, 265 flow [2022-11-16 12:48:31,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 99 transitions, 263 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-16 12:48:31,898 INFO L231 Difference]: Finished difference. Result has 95 places, 94 transitions, 238 flow [2022-11-16 12:48:31,899 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=95, PETRI_TRANSITIONS=94} [2022-11-16 12:48:31,900 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, -4 predicate places. [2022-11-16 12:48:31,900 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 94 transitions, 238 flow [2022-11-16 12:48:31,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-16 12:48:31,901 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:31,902 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:31,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:48:31,902 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2022-11-16 12:48:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2000162403, now seen corresponding path program 1 times [2022-11-16 12:48:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388942533] [2022-11-16 12:48:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:32,023 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-16 12:48:32,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:32,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388942533] [2022-11-16 12:48:32,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388942533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:32,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:32,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:32,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345067747] [2022-11-16 12:48:32,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:32,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:32,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:32,028 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 99 [2022-11-16 12:48:32,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 94 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-16 12:48:32,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:32,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 99 [2022-11-16 12:48:32,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:32,276 INFO L130 PetriNetUnfolder]: 112/671 cut-off events. [2022-11-16 12:48:32,276 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-16 12:48:32,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 671 events. 112/671 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4466 event pairs, 32 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 845. Up to 148 conditions per place. [2022-11-16 12:48:32,288 INFO L137 encePairwiseOnDemand]: 85/99 looper letters, 25 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2022-11-16 12:48:32,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 343 flow [2022-11-16 12:48:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2022-11-16 12:48:32,327 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8686868686868687 [2022-11-16 12:48:32,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2022-11-16 12:48:32,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2022-11-16 12:48:32,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:32,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2022-11-16 12:48:32,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-16 12:48:32,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-16 12:48:32,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-16 12:48:32,336 INFO L175 Difference]: Start difference. First operand has 95 places, 94 transitions, 238 flow. Second operand 3 states and 258 transitions. [2022-11-16 12:48:32,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 343 flow [2022-11-16 12:48:32,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 109 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:48:32,347 INFO L231 Difference]: Finished difference. Result has 97 places, 104 transitions, 314 flow [2022-11-16 12:48:32,347 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=97, PETRI_TRANSITIONS=104} [2022-11-16 12:48:32,350 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, -2 predicate places. [2022-11-16 12:48:32,351 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 104 transitions, 314 flow [2022-11-16 12:48:32,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-16 12:48:32,352 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:32,352 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:32,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:48:32,354 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-16 12:48:32,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash 253180552, now seen corresponding path program 1 times [2022-11-16 12:48:32,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:32,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799949906] [2022-11-16 12:48:32,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:32,470 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-16 12:48:32,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:32,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799949906] [2022-11-16 12:48:32,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799949906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:32,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:32,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:32,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178205436] [2022-11-16 12:48:32,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:32,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:32,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:32,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:32,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 99 [2022-11-16 12:48:32,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 104 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-16 12:48:32,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:32,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 99 [2022-11-16 12:48:32,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:32,697 INFO L130 PetriNetUnfolder]: 139/794 cut-off events. [2022-11-16 12:48:32,698 INFO L131 PetriNetUnfolder]: For 251/274 co-relation queries the response was YES. [2022-11-16 12:48:32,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 794 events. 139/794 cut-off events. For 251/274 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5578 event pairs, 49 based on Foata normal form. 3/692 useless extension candidates. Maximal degree in co-relation 1284. Up to 254 conditions per place. [2022-11-16 12:48:32,708 INFO L137 encePairwiseOnDemand]: 92/99 looper letters, 39 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2022-11-16 12:48:32,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 120 transitions, 479 flow [2022-11-16 12:48:32,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:32,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-11-16 12:48:32,710 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.835016835016835 [2022-11-16 12:48:32,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2022-11-16 12:48:32,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2022-11-16 12:48:32,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:32,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2022-11-16 12:48:32,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-16 12:48:32,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-16 12:48:32,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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-16 12:48:32,715 INFO L175 Difference]: Start difference. First operand has 97 places, 104 transitions, 314 flow. Second operand 3 states and 248 transitions. [2022-11-16 12:48:32,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 120 transitions, 479 flow [2022-11-16 12:48:32,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 120 transitions, 449 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:48:32,726 INFO L231 Difference]: Finished difference. Result has 99 places, 111 transitions, 370 flow [2022-11-16 12:48:32,727 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=99, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2022-11-16 12:48:32,729 INFO L288 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2022-11-16 12:48:32,729 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 370 flow [2022-11-16 12:48:32,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-16 12:48:32,730 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:32,730 INFO L209 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:32,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:48:32,730 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-16 12:48:32,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:32,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1844260839, now seen corresponding path program 1 times [2022-11-16 12:48:32,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:32,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396559720] [2022-11-16 12:48:32,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:32,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:48:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:32,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:48:32,818 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:48:32,819 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2022-11-16 12:48:32,820 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2022-11-16 12:48:32,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2022-11-16 12:48:32,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2022-11-16 12:48:32,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2022-11-16 12:48:32,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2022-11-16 12:48:32,822 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2022-11-16 12:48:32,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2022-11-16 12:48:32,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2022-11-16 12:48:32,823 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2022-11-16 12:48:32,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2022-11-16 12:48:32,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2022-11-16 12:48:32,824 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2022-11-16 12:48:32,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2022-11-16 12:48:32,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2022-11-16 12:48:32,825 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2022-11-16 12:48:32,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:48:32,828 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-16 12:48:32,829 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:48:32,831 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-16 12:48:32,877 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:48:32,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 134 transitions, 289 flow [2022-11-16 12:48:32,906 INFO L130 PetriNetUnfolder]: 10/171 cut-off events. [2022-11-16 12:48:32,906 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-16 12:48:32,908 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-16 12:48:32,909 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 134 transitions, 289 flow [2022-11-16 12:48:32,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 134 transitions, 289 flow [2022-11-16 12:48:32,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:48:32,919 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;@61ce1f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:48:32,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-16 12:48:32,926 INFO L130 PetriNetUnfolder]: 2/34 cut-off events. [2022-11-16 12:48:32,927 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:48:32,927 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:32,928 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:32,929 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-16 12:48:32,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1321755807, now seen corresponding path program 1 times [2022-11-16 12:48:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:32,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653963063] [2022-11-16 12:48:32,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:32,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:33,018 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-16 12:48:33,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:33,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653963063] [2022-11-16 12:48:33,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653963063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:33,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:33,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748371072] [2022-11-16 12:48:33,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:33,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:33,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:33,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:33,023 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2022-11-16 12:48:33,024 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 134 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-16 12:48:33,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:33,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2022-11-16 12:48:33,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:33,759 INFO L130 PetriNetUnfolder]: 890/4155 cut-off events. [2022-11-16 12:48:33,759 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2022-11-16 12:48:33,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5710 conditions, 4155 events. 890/4155 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 41267 event pairs, 271 based on Foata normal form. 757/3980 useless extension candidates. Maximal degree in co-relation 3582. Up to 713 conditions per place. [2022-11-16 12:48:33,813 INFO L137 encePairwiseOnDemand]: 117/134 looper letters, 29 selfloop transitions, 9 changer transitions 0/138 dead transitions. [2022-11-16 12:48:33,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 138 transitions, 385 flow [2022-11-16 12:48:33,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-11-16 12:48:33,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9104477611940298 [2022-11-16 12:48:33,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-11-16 12:48:33,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-11-16 12:48:33,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:33,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-11-16 12:48:33,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-16 12:48:33,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:33,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:33,827 INFO L175 Difference]: Start difference. First operand has 134 places, 134 transitions, 289 flow. Second operand 3 states and 366 transitions. [2022-11-16 12:48:33,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 138 transitions, 385 flow [2022-11-16 12:48:33,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 377 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-11-16 12:48:33,834 INFO L231 Difference]: Finished difference. Result has 129 places, 130 transitions, 335 flow [2022-11-16 12:48:33,835 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=335, PETRI_PLACES=129, PETRI_TRANSITIONS=130} [2022-11-16 12:48:33,837 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, -5 predicate places. [2022-11-16 12:48:33,838 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 130 transitions, 335 flow [2022-11-16 12:48:33,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-16 12:48:33,838 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:33,839 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:33,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:48:33,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-16 12:48:33,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:33,840 INFO L85 PathProgramCache]: Analyzing trace with hash -870645049, now seen corresponding path program 1 times [2022-11-16 12:48:33,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:33,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892518657] [2022-11-16 12:48:33,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:33,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:33,905 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-16 12:48:33,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:33,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892518657] [2022-11-16 12:48:33,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892518657] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:33,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:33,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:33,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197299440] [2022-11-16 12:48:33,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:33,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:33,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:33,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:33,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:33,911 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 134 [2022-11-16 12:48:33,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 130 transitions, 335 flow. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-16 12:48:33,912 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:33,912 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 134 [2022-11-16 12:48:33,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:36,025 INFO L130 PetriNetUnfolder]: 3503/11956 cut-off events. [2022-11-16 12:48:36,026 INFO L131 PetriNetUnfolder]: For 798/801 co-relation queries the response was YES. [2022-11-16 12:48:36,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19311 conditions, 11956 events. 3503/11956 cut-off events. For 798/801 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 139413 event pairs, 1176 based on Foata normal form. 0/9813 useless extension candidates. Maximal degree in co-relation 18970. Up to 3503 conditions per place. [2022-11-16 12:48:36,165 INFO L137 encePairwiseOnDemand]: 113/134 looper letters, 38 selfloop transitions, 15 changer transitions 0/153 dead transitions. [2022-11-16 12:48:36,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 153 transitions, 497 flow [2022-11-16 12:48:36,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:36,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:36,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-11-16 12:48:36,169 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8631840796019901 [2022-11-16 12:48:36,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-11-16 12:48:36,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-11-16 12:48:36,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:36,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-11-16 12:48:36,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-16 12:48:36,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:36,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:36,174 INFO L175 Difference]: Start difference. First operand has 129 places, 130 transitions, 335 flow. Second operand 3 states and 347 transitions. [2022-11-16 12:48:36,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 153 transitions, 497 flow [2022-11-16 12:48:36,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 153 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:48:36,189 INFO L231 Difference]: Finished difference. Result has 131 places, 145 transitions, 449 flow [2022-11-16 12:48:36,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=449, PETRI_PLACES=131, PETRI_TRANSITIONS=145} [2022-11-16 12:48:36,190 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, -3 predicate places. [2022-11-16 12:48:36,191 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 145 transitions, 449 flow [2022-11-16 12:48:36,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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-16 12:48:36,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:36,191 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:36,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:48:36,192 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-16 12:48:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1188366804, now seen corresponding path program 1 times [2022-11-16 12:48:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:36,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761474470] [2022-11-16 12:48:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:36,231 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-16 12:48:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:36,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761474470] [2022-11-16 12:48:36,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761474470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:36,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:36,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:36,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096646000] [2022-11-16 12:48:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:36,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:36,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:36,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:36,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:36,235 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2022-11-16 12:48:36,236 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 145 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-16 12:48:36,236 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:36,236 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2022-11-16 12:48:36,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:38,716 INFO L130 PetriNetUnfolder]: 4532/15371 cut-off events. [2022-11-16 12:48:38,717 INFO L131 PetriNetUnfolder]: For 6010/6675 co-relation queries the response was YES. [2022-11-16 12:48:38,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30653 conditions, 15371 events. 4532/15371 cut-off events. For 6010/6675 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 186735 event pairs, 1841 based on Foata normal form. 57/13147 useless extension candidates. Maximal degree in co-relation 30292. Up to 6214 conditions per place. [2022-11-16 12:48:38,905 INFO L137 encePairwiseOnDemand]: 124/134 looper letters, 63 selfloop transitions, 16 changer transitions 0/177 dead transitions. [2022-11-16 12:48:38,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 177 transitions, 749 flow [2022-11-16 12:48:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 337 transitions. [2022-11-16 12:48:38,910 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8383084577114428 [2022-11-16 12:48:38,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 337 transitions. [2022-11-16 12:48:38,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 337 transitions. [2022-11-16 12:48:38,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:38,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 337 transitions. [2022-11-16 12:48:38,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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-16 12:48:38,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:38,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:38,915 INFO L175 Difference]: Start difference. First operand has 131 places, 145 transitions, 449 flow. Second operand 3 states and 337 transitions. [2022-11-16 12:48:38,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 177 transitions, 749 flow [2022-11-16 12:48:38,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 177 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:48:38,938 INFO L231 Difference]: Finished difference. Result has 133 places, 159 transitions, 565 flow [2022-11-16 12:48:38,938 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=565, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2022-11-16 12:48:38,940 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, -1 predicate places. [2022-11-16 12:48:38,940 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 565 flow [2022-11-16 12:48:38,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-16 12:48:38,941 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:38,941 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:38,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:48:38,941 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-16 12:48:38,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:38,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1628221845, now seen corresponding path program 1 times [2022-11-16 12:48:38,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:38,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997550334] [2022-11-16 12:48:38,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:38,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:38,999 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-16 12:48:38,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:38,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997550334] [2022-11-16 12:48:39,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997550334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:39,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:39,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:39,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733297442] [2022-11-16 12:48:39,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:39,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:39,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:39,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:39,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:39,003 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 134 [2022-11-16 12:48:39,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 565 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-16 12:48:39,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:39,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 134 [2022-11-16 12:48:39,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:40,151 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][143], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 19#L689-5true, 155#true, Black: 137#true, 125#L689true, 81#L688-7true]) [2022-11-16 12:48:40,151 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2022-11-16 12:48:40,152 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:40,152 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-16 12:48:40,152 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-16 12:48:40,164 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][153], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 19#L689-5true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-16 12:48:40,165 INFO L383 tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event [2022-11-16 12:48:40,165 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:40,165 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-16 12:48:40,166 INFO L386 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2022-11-16 12:48:40,272 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][73], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 129#L690true, 155#true, Black: 137#true, 125#L689true, 81#L688-7true]) [2022-11-16 12:48:40,272 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-16 12:48:40,273 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-16 12:48:40,273 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-16 12:48:40,273 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 12:48:40,389 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][103], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 129#L690true, 118#L689true, 155#true, Black: 137#true]) [2022-11-16 12:48:40,389 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-16 12:48:40,390 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 12:48:40,390 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-16 12:48:40,390 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-16 12:48:40,396 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][143], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 33#L689-1true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 19#L689-5true, 149#true, 155#true, Black: 137#true, 125#L689true]) [2022-11-16 12:48:40,396 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-16 12:48:40,396 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-16 12:48:40,397 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-16 12:48:40,397 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-16 12:48:40,426 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][153], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 19#L689-5true, 149#true, 118#L689true, 155#true, Black: 137#true]) [2022-11-16 12:48:40,426 INFO L383 tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event [2022-11-16 12:48:40,426 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-16 12:48:40,426 INFO L386 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-11-16 12:48:40,426 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-16 12:48:40,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][73], [42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, 33#L689-1true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 129#L690true, 155#true, 125#L689true, Black: 137#true]) [2022-11-16 12:48:40,482 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-16 12:48:40,482 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-16 12:48:40,482 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:40,482 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:40,613 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][103], [57#L689-1true, 42#L696-5true, thr1Thread1of3ForFork0InUse, Black: 143#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 149#true, 129#L690true, 118#L689true, 155#true, Black: 137#true]) [2022-11-16 12:48:40,613 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-16 12:48:40,614 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-16 12:48:40,614 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:40,614 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:41,609 INFO L130 PetriNetUnfolder]: 3962/14490 cut-off events. [2022-11-16 12:48:41,610 INFO L131 PetriNetUnfolder]: For 4062/5065 co-relation queries the response was YES. [2022-11-16 12:48:41,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27354 conditions, 14490 events. 3962/14490 cut-off events. For 4062/5065 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 177950 event pairs, 1378 based on Foata normal form. 54/11813 useless extension candidates. Maximal degree in co-relation 27230. Up to 3263 conditions per place. [2022-11-16 12:48:41,762 INFO L137 encePairwiseOnDemand]: 126/134 looper letters, 42 selfloop transitions, 12 changer transitions 0/181 dead transitions. [2022-11-16 12:48:41,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 181 transitions, 755 flow [2022-11-16 12:48:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-11-16 12:48:41,765 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8681592039800995 [2022-11-16 12:48:41,765 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2022-11-16 12:48:41,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2022-11-16 12:48:41,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:41,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2022-11-16 12:48:41,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-16 12:48:41,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:41,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:41,769 INFO L175 Difference]: Start difference. First operand has 133 places, 159 transitions, 565 flow. Second operand 3 states and 349 transitions. [2022-11-16 12:48:41,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 181 transitions, 755 flow [2022-11-16 12:48:41,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:48:41,787 INFO L231 Difference]: Finished difference. Result has 135 places, 169 transitions, 639 flow [2022-11-16 12:48:41,788 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=135, PETRI_TRANSITIONS=169} [2022-11-16 12:48:41,790 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, 1 predicate places. [2022-11-16 12:48:41,790 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 169 transitions, 639 flow [2022-11-16 12:48:41,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-16 12:48:41,791 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:41,791 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:41,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:48:41,791 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-16 12:48:41,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1842888451, now seen corresponding path program 1 times [2022-11-16 12:48:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:41,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128607430] [2022-11-16 12:48:41,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:48:41,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:41,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128607430] [2022-11-16 12:48:41,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128607430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:41,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:41,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:41,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099875468] [2022-11-16 12:48:41,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:41,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:41,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:41,867 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 134 [2022-11-16 12:48:41,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 169 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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-16 12:48:41,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:41,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 134 [2022-11-16 12:48:41,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:43,269 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][104], [42#L696-5true, thr1Thread1of3ForFork0InUse, 161#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, Black: 143#true, 128#L688-7true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 129#L690true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-16 12:48:43,269 INFO L383 tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event [2022-11-16 12:48:43,269 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-16 12:48:43,269 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-16 12:48:43,269 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-16 12:48:43,514 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([462] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][73], [42#L696-5true, thr1Thread1of3ForFork0InUse, 33#L689-1true, 161#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 155#true, Black: 137#true, 125#L689true, Black: 143#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 129#L690true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-16 12:48:43,514 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-16 12:48:43,514 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:43,514 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:43,514 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-16 12:48:43,679 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][104], [42#L696-5true, thr1Thread1of3ForFork0InUse, 161#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, 57#L689-1true, Black: 143#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 129#L690true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-16 12:48:43,680 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-16 12:48:43,680 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:43,680 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-16 12:48:43,680 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-16 12:48:43,902 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][104], [42#L696-5true, thr1Thread1of3ForFork0InUse, 114#L689-3true, 161#true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 118#L689true, 155#true, Black: 137#true, Black: 143#true, Black: 151#(= |thr1Thread1of3ForFork0_#t~nondet4| |#race~s~0|), 129#L690true, Black: 157#(= |thr1Thread1of3ForFork0_#t~nondet5| |#race~l~0|)]) [2022-11-16 12:48:43,902 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-16 12:48:43,903 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-16 12:48:43,903 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-16 12:48:43,903 INFO L386 tUnfolder$Statistics]: existing Event has 67 ancestors and is cut-off event [2022-11-16 12:48:44,637 INFO L130 PetriNetUnfolder]: 6011/20030 cut-off events. [2022-11-16 12:48:44,637 INFO L131 PetriNetUnfolder]: For 10559/12278 co-relation queries the response was YES. [2022-11-16 12:48:44,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43394 conditions, 20030 events. 6011/20030 cut-off events. For 10559/12278 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 250700 event pairs, 1916 based on Foata normal form. 127/16939 useless extension candidates. Maximal degree in co-relation 41567. Up to 7923 conditions per place. [2022-11-16 12:48:44,995 INFO L137 encePairwiseOnDemand]: 124/134 looper letters, 74 selfloop transitions, 23 changer transitions 0/206 dead transitions. [2022-11-16 12:48:44,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 206 transitions, 1002 flow [2022-11-16 12:48:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-11-16 12:48:44,998 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.835820895522388 [2022-11-16 12:48:44,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-11-16 12:48:44,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-11-16 12:48:44,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:44,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-11-16 12:48:45,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-16 12:48:45,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:45,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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-16 12:48:45,002 INFO L175 Difference]: Start difference. First operand has 135 places, 169 transitions, 639 flow. Second operand 3 states and 336 transitions. [2022-11-16 12:48:45,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 206 transitions, 1002 flow [2022-11-16 12:48:45,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 206 transitions, 978 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:48:45,041 INFO L231 Difference]: Finished difference. Result has 137 places, 188 transitions, 845 flow [2022-11-16 12:48:45,041 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=845, PETRI_PLACES=137, PETRI_TRANSITIONS=188} [2022-11-16 12:48:45,043 INFO L288 CegarLoopForPetriNet]: 134 programPoint places, 3 predicate places. [2022-11-16 12:48:45,043 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 188 transitions, 845 flow [2022-11-16 12:48:45,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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-16 12:48:45,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:45,044 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:45,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:48:45,044 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-16 12:48:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:45,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1793019771, now seen corresponding path program 1 times [2022-11-16 12:48:45,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:45,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028785131] [2022-11-16 12:48:45,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:45,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:45,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:48:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:48:45,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:48:45,106 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 12:48:45,106 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 21 remaining) [2022-11-16 12:48:45,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2022-11-16 12:48:45,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2022-11-16 12:48:45,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2022-11-16 12:48:45,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2022-11-16 12:48:45,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2022-11-16 12:48:45,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2022-11-16 12:48:45,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2022-11-16 12:48:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2022-11-16 12:48:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2022-11-16 12:48:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2022-11-16 12:48:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2022-11-16 12:48:45,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2022-11-16 12:48:45,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2022-11-16 12:48:45,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2022-11-16 12:48:45,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2022-11-16 12:48:45,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2022-11-16 12:48:45,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2022-11-16 12:48:45,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2022-11-16 12:48:45,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2022-11-16 12:48:45,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2022-11-16 12:48:45,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:48:45,113 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-16 12:48:45,114 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-16 12:48:45,114 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-11-16 12:48:45,173 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 12:48:45,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 169 transitions, 370 flow [2022-11-16 12:48:45,226 INFO L130 PetriNetUnfolder]: 13/219 cut-off events. [2022-11-16 12:48:45,226 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-16 12:48:45,228 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-16 12:48:45,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 169 transitions, 370 flow [2022-11-16 12:48:45,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 169 transitions, 370 flow [2022-11-16 12:48:45,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:48:45,238 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;@61ce1f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:48:45,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-16 12:48:45,241 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-11-16 12:48:45,241 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:48:45,241 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:45,242 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:45,242 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-16 12:48:45,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:45,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2024124458, now seen corresponding path program 1 times [2022-11-16 12:48:45,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:45,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000846340] [2022-11-16 12:48:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:45,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:45,270 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-16 12:48:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:45,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000846340] [2022-11-16 12:48:45,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000846340] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:45,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:45,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:45,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379305101] [2022-11-16 12:48:45,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:45,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:45,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:45,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:45,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:45,274 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 169 [2022-11-16 12:48:45,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 169 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-16 12:48:45,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:45,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 169 [2022-11-16 12:48:45,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:48:49,775 INFO L130 PetriNetUnfolder]: 10552/36460 cut-off events. [2022-11-16 12:48:49,775 INFO L131 PetriNetUnfolder]: For 5029/5029 co-relation queries the response was YES. [2022-11-16 12:48:49,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52975 conditions, 36460 events. 10552/36460 cut-off events. For 5029/5029 co-relation queries the response was YES. Maximal size of possible extension queue 1431. Compared 486652 event pairs, 4260 based on Foata normal form. 6641/34518 useless extension candidates. Maximal degree in co-relation 44195. Up to 7193 conditions per place. [2022-11-16 12:48:50,162 INFO L137 encePairwiseOnDemand]: 147/169 looper letters, 39 selfloop transitions, 12 changer transitions 0/177 dead transitions. [2022-11-16 12:48:50,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 177 transitions, 509 flow [2022-11-16 12:48:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:48:50,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:48:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2022-11-16 12:48:50,165 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9072978303747534 [2022-11-16 12:48:50,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2022-11-16 12:48:50,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2022-11-16 12:48:50,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:48:50,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2022-11-16 12:48:50,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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-16 12:48:50,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-16 12:48:50,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-16 12:48:50,171 INFO L175 Difference]: Start difference. First operand has 169 places, 169 transitions, 370 flow. Second operand 3 states and 460 transitions. [2022-11-16 12:48:50,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 177 transitions, 509 flow [2022-11-16 12:48:50,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 177 transitions, 491 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-11-16 12:48:50,176 INFO L231 Difference]: Finished difference. Result has 163 places, 166 transitions, 432 flow [2022-11-16 12:48:50,177 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=163, PETRI_TRANSITIONS=166} [2022-11-16 12:48:50,178 INFO L288 CegarLoopForPetriNet]: 169 programPoint places, -6 predicate places. [2022-11-16 12:48:50,178 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 166 transitions, 432 flow [2022-11-16 12:48:50,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 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-16 12:48:50,179 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:48:50,179 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:48:50,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:48:50,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-11-16 12:48:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:48:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1372513744, now seen corresponding path program 1 times [2022-11-16 12:48:50,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:48:50,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748476296] [2022-11-16 12:48:50,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:48:50,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:48:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:48:50,216 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-16 12:48:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:48:50,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748476296] [2022-11-16 12:48:50,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748476296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:48:50,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:48:50,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:48:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986527703] [2022-11-16 12:48:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:48:50,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:48:50,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:48:50,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:48:50,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:48:50,219 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 169 [2022-11-16 12:48:50,219 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 166 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-16 12:48:50,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:48:50,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 169 [2022-11-16 12:48:50,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:49:01,956 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 145#L689-4true, 78#L689true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true, 89#L689-4true]) [2022-11-16 12:49:01,956 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-11-16 12:49:01,956 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-16 12:49:01,956 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:01,956 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-11-16 12:49:03,076 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 82#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 174#(= |#race~l~0| 0), 81#L688-2true, 89#L689-4true]) [2022-11-16 12:49:03,076 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,076 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,076 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 12:49:03,077 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,117 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 107#L689-5true, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true, 89#L689-4true]) [2022-11-16 12:49:03,117 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,117 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,117 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 12:49:03,117 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,144 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 145#L689-4true, 78#L689true, 35#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 63#L696-5true, 180#(= |#race~s~0| 0), thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-16 12:49:03,145 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,145 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 12:49:03,145 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,145 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,147 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 145#L689-4true, 78#L689true, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, 62#L689-5true, thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-16 12:49:03,147 INFO L383 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,147 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,147 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is not cut-off event [2022-11-16 12:49:03,147 INFO L386 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-11-16 12:49:03,886 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 36#L690-3true, 174#(= |#race~l~0| 0), 89#L689-4true]) [2022-11-16 12:49:03,886 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,886 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,887 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,887 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 12:49:03,904 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 145#L689-4true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 105#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-16 12:49:03,904 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,904 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,904 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,904 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 12:49:03,962 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, 35#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread4of4ForFork0InUse, 82#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-16 12:49:03,962 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,962 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 12:49:03,962 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,962 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,964 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 62#L689-5true, 82#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-16 12:49:03,964 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,964 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 12:49:03,964 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:03,964 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:04,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 35#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 63#L696-5true, thr1Thread3of4ForFork0InUse, 107#L689-5true, 180#(= |#race~s~0| 0), thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-16 12:49:04,353 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-16 12:49:04,354 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:04,354 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:04,354 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 12:49:04,356 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([597] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][146], [Black: 172#true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 78#L689true, 63#L696-5true, thr1Thread3of4ForFork0InUse, 107#L689-5true, 180#(= |#race~s~0| 0), 62#L689-5true, thr1Thread4of4ForFork0InUse, 174#(= |#race~l~0| 0), 81#L688-2true]) [2022-11-16 12:49:04,356 INFO L383 tUnfolder$Statistics]: this new event has 78 ancestors and is not cut-off event [2022-11-16 12:49:04,357 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is not cut-off event [2022-11-16 12:49:04,357 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:04,357 INFO L386 tUnfolder$Statistics]: existing Event has 78 ancestors and is not cut-off event [2022-11-16 12:49:05,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 82#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 105#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-16 12:49:05,105 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,106 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,106 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-16 12:49:05,106 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,112 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, 35#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, thr1Thread4of4ForFork0InUse, 36#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-16 12:49:05,113 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,113 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,113 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,113 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-16 12:49:05,114 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 180#(= |#race~s~0| 0), 63#L696-5true, thr1Thread3of4ForFork0InUse, thr1Thread4of4ForFork0InUse, 62#L689-5true, 36#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-16 12:49:05,115 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,115 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,115 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-16 12:49:05,115 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,141 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([563] L688-14-->L689: Formula: (= |v_#race~s~0_4| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_4|} AuxVars[] AssignedVars[#race~s~0][98], [Black: 172#true, 113#thr1ENTRYtrue, 101#L689true, thr1Thread1of4ForFork0InUse, thr1Thread2of4ForFork0InUse, 63#L696-5true, thr1Thread3of4ForFork0InUse, 180#(= |#race~s~0| 0), 107#L689-5true, thr1Thread4of4ForFork0InUse, 105#L690-3true, 174#(= |#race~l~0| 0)]) [2022-11-16 12:49:05,141 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,141 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:05,141 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is not cut-off event [2022-11-16 12:49:05,141 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-11-16 12:49:15,819 INFO L130 PetriNetUnfolder]: 82293/214654 cut-off events. [2022-11-16 12:49:15,819 INFO L131 PetriNetUnfolder]: For 13308/13434 co-relation queries the response was YES. [2022-11-16 12:49:16,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359265 conditions, 214654 events. 82293/214654 cut-off events. For 13308/13434 co-relation queries the response was YES. Maximal size of possible extension queue 8748. Compared 3266344 event pairs, 29422 based on Foata normal form. 0/173858 useless extension candidates. Maximal degree in co-relation 358635. Up to 72872 conditions per place. [2022-11-16 12:49:18,251 INFO L137 encePairwiseOnDemand]: 141/169 looper letters, 51 selfloop transitions, 20 changer transitions 0/197 dead transitions. [2022-11-16 12:49:18,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 197 transitions, 651 flow [2022-11-16 12:49:18,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:49:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:49:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-11-16 12:49:18,254 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8599605522682445 [2022-11-16 12:49:18,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2022-11-16 12:49:18,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2022-11-16 12:49:18,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:49:18,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2022-11-16 12:49:18,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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-16 12:49:18,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-16 12:49:18,258 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 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-16 12:49:18,259 INFO L175 Difference]: Start difference. First operand has 163 places, 166 transitions, 432 flow. Second operand 3 states and 436 transitions. [2022-11-16 12:49:18,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 197 transitions, 651 flow [2022-11-16 12:49:18,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 197 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:49:18,670 INFO L231 Difference]: Finished difference. Result has 165 places, 186 transitions, 584 flow [2022-11-16 12:49:18,670 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=165, PETRI_TRANSITIONS=186} [2022-11-16 12:49:18,671 INFO L288 CegarLoopForPetriNet]: 169 programPoint places, -4 predicate places. [2022-11-16 12:49:18,671 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 186 transitions, 584 flow [2022-11-16 12:49:18,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-16 12:49:18,672 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:49:18,672 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:49:18,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:49:18,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2022-11-16 12:49:18,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:49:18,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1429500565, now seen corresponding path program 1 times [2022-11-16 12:49:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:49:18,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903553785] [2022-11-16 12:49:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:49:18,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:49:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:49:18,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-16 12:49:18,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:49:18,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903553785] [2022-11-16 12:49:18,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903553785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:49:18,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:49:18,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:49:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649077840] [2022-11-16 12:49:18,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:49:18,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:49:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:49:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:49:18,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:49:18,707 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 169 [2022-11-16 12:49:18,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 186 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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-16 12:49:18,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:49:18,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 169 [2022-11-16 12:49:18,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand