./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --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_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/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_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/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_957445bf-cb36-4157-b8d3-92ccf512bfee/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 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 --- 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 11:46:43,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:46:43,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:46:43,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:46:43,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:46:43,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:46:43,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:46:43,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:46:43,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:46:43,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:46:43,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:46:43,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:46:43,548 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:46:43,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:46:43,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:46:43,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:46:43,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:46:43,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:46:43,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:46:43,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:46:43,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:46:43,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:46:43,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:46:43,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:46:43,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:46:43,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:46:43,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:46:43,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:46:43,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:46:43,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:46:43,586 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:46:43,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:46:43,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:46:43,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:46:43,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:46:43,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:46:43,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:46:43,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:46:43,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:46:43,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:46:43,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:46:43,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 11:46:43,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:46:43,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:46:43,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:46:43,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:46:43,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:46:43,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:46:43,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:46:43,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:46:43,647 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:46:43,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:46:43,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:46:43,648 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:46:43,649 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:46:43,649 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:46:43,649 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:46:43,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:46:43,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:46:43,650 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:46:43,650 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 11:46:43,650 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:46:43,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:46:43,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:46:43,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:46:43,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:46:43,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:46:43,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:46:43,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:46:43,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:46:43,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:46:43,653 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:46:43,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:46:43,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:46:43,654 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:46:43,654 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:46:43,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:46:43,654 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_957445bf-cb36-4157-b8d3-92ccf512bfee/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_957445bf-cb36-4157-b8d3-92ccf512bfee/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 -> 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 [2022-11-16 11:46:44,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:46:44,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:46:44,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:46:44,027 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:46:44,028 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:46:44,030 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2022-11-16 11:46:44,103 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/data/e94c76f56/2b0ba2e8e25b44d9a880dd2716957ce3/FLAG2d55463ee [2022-11-16 11:46:44,622 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:46:44,623 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2022-11-16 11:46:44,633 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/data/e94c76f56/2b0ba2e8e25b44d9a880dd2716957ce3/FLAG2d55463ee [2022-11-16 11:46:44,991 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/data/e94c76f56/2b0ba2e8e25b44d9a880dd2716957ce3 [2022-11-16 11:46:44,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:46:45,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:46:45,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:46:45,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:46:45,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:46:45,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:44" (1/1) ... [2022-11-16 11:46:45,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f822c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45, skipping insertion in model container [2022-11-16 11:46:45,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:44" (1/1) ... [2022-11-16 11:46:45,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:46:45,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:46:45,282 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_957445bf-cb36-4157-b8d3-92ccf512bfee/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-11-16 11:46:45,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:46:45,297 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:46:45,330 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_957445bf-cb36-4157-b8d3-92ccf512bfee/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-11-16 11:46:45,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:46:45,348 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:46:45,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45 WrapperNode [2022-11-16 11:46:45,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:46:45,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:46:45,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:46:45,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:46:45,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,424 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 214 [2022-11-16 11:46:45,431 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:46:45,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:46:45,432 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:46:45,432 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:46:45,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,510 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:46:45,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:46:45,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:46:45,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:46:45,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (1/1) ... [2022-11-16 11:46:45,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:46:45,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:46:45,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:46:45,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_957445bf-cb36-4157-b8d3-92ccf512bfee/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:46:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:46:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:46:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:46:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:46:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:46:45,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:46:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:46:45,620 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:46:45,620 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 11:46:45,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 11:46:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:46:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:46:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:46:45,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:46:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:46:45,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:46:45,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:46:45,624 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 11:46:45,752 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:46:45,754 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:46:46,660 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:46:46,832 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:46:46,832 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-16 11:46:46,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:46:46 BoogieIcfgContainer [2022-11-16 11:46:46,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:46:46,840 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:46:46,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:46:46,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:46:46,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:46:44" (1/3) ... [2022-11-16 11:46:46,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fbda2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:46, skipping insertion in model container [2022-11-16 11:46:46,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:45" (2/3) ... [2022-11-16 11:46:46,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48fbda2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:46, skipping insertion in model container [2022-11-16 11:46:46,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:46:46" (3/3) ... [2022-11-16 11:46:46,848 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2022-11-16 11:46:46,857 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:46:46,868 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:46:46,868 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-16 11:46:46,869 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:46:46,958 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:46:46,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 352 places, 362 transitions, 748 flow [2022-11-16 11:46:47,140 INFO L130 PetriNetUnfolder]: 20/359 cut-off events. [2022-11-16 11:46:47,140 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:46:47,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 359 events. 20/359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 438 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 284. Up to 3 conditions per place. [2022-11-16 11:46:47,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 352 places, 362 transitions, 748 flow [2022-11-16 11:46:47,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 339 transitions, 696 flow [2022-11-16 11:46:47,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:46:47,184 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;@4f1168fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:46:47,184 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-16 11:46:47,192 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-16 11:46:47,195 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:46:47,196 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:47,196 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] [2022-11-16 11:46:47,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash 104500589, now seen corresponding path program 1 times [2022-11-16 11:46:47,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:47,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689048495] [2022-11-16 11:46:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:47,431 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 11:46:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:47,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689048495] [2022-11-16 11:46:47,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689048495] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:47,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:47,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:46:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494773433] [2022-11-16 11:46:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:47,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:46:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:46:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:46:47,489 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 362 [2022-11-16 11:46:47,497 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 339 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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 11:46:47,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:47,498 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 362 [2022-11-16 11:46:47,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:48,137 INFO L130 PetriNetUnfolder]: 380/1345 cut-off events. [2022-11-16 11:46:48,137 INFO L131 PetriNetUnfolder]: For 161/314 co-relation queries the response was YES. [2022-11-16 11:46:48,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1345 events. 380/1345 cut-off events. For 161/314 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7857 event pairs, 255 based on Foata normal form. 9/1050 useless extension candidates. Maximal degree in co-relation 1630. Up to 542 conditions per place. [2022-11-16 11:46:48,158 INFO L137 encePairwiseOnDemand]: 335/362 looper letters, 30 selfloop transitions, 2 changer transitions 6/314 dead transitions. [2022-11-16 11:46:48,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 710 flow [2022-11-16 11:46:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:46:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:46:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2022-11-16 11:46:48,183 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8895027624309392 [2022-11-16 11:46:48,184 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 966 transitions. [2022-11-16 11:46:48,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 966 transitions. [2022-11-16 11:46:48,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:48,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 966 transitions. [2022-11-16 11:46:48,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 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 11:46:48,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:48,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:48,211 INFO L175 Difference]: Start difference. First operand has 330 places, 339 transitions, 696 flow. Second operand 3 states and 966 transitions. [2022-11-16 11:46:48,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 710 flow [2022-11-16 11:46:48,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 698 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 11:46:48,230 INFO L231 Difference]: Finished difference. Result has 313 places, 308 transitions, 626 flow [2022-11-16 11:46:48,233 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2022-11-16 11:46:48,237 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -17 predicate places. [2022-11-16 11:46:48,238 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 626 flow [2022-11-16 11:46:48,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 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 11:46:48,239 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:48,239 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] [2022-11-16 11:46:48,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:46:48,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:48,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash 602349567, now seen corresponding path program 1 times [2022-11-16 11:46:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:48,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422337997] [2022-11-16 11:46:48,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:48,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:48,347 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 11:46:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:48,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422337997] [2022-11-16 11:46:48,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422337997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:48,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:48,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:46:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426511876] [2022-11-16 11:46:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:48,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:46:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:46:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:46:48,353 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 362 [2022-11-16 11:46:48,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 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 11:46:48,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:48,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 362 [2022-11-16 11:46:48,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:48,674 INFO L130 PetriNetUnfolder]: 213/996 cut-off events. [2022-11-16 11:46:48,674 INFO L131 PetriNetUnfolder]: For 27/107 co-relation queries the response was YES. [2022-11-16 11:46:48,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 996 events. 213/996 cut-off events. For 27/107 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5265 event pairs, 128 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1279. Up to 297 conditions per place. [2022-11-16 11:46:48,685 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 22 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2022-11-16 11:46:48,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 660 flow [2022-11-16 11:46:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:46:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:46:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2022-11-16 11:46:48,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8720073664825047 [2022-11-16 11:46:48,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 947 transitions. [2022-11-16 11:46:48,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 947 transitions. [2022-11-16 11:46:48,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:48,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 947 transitions. [2022-11-16 11:46:48,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 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 11:46:48,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:48,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:48,699 INFO L175 Difference]: Start difference. First operand has 313 places, 308 transitions, 626 flow. Second operand 3 states and 947 transitions. [2022-11-16 11:46:48,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 660 flow [2022-11-16 11:46:48,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:46:48,708 INFO L231 Difference]: Finished difference. Result has 301 places, 302 transitions, 612 flow [2022-11-16 11:46:48,709 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=301, PETRI_TRANSITIONS=302} [2022-11-16 11:46:48,710 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-16 11:46:48,711 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 302 transitions, 612 flow [2022-11-16 11:46:48,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 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 11:46:48,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:48,712 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, 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 11:46:48,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:46:48,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -274483700, now seen corresponding path program 1 times [2022-11-16 11:46:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099518616] [2022-11-16 11:46:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:48,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:48,886 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 11:46:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:48,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099518616] [2022-11-16 11:46:48,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099518616] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:48,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:48,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:46:48,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989373327] [2022-11-16 11:46:48,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:48,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:46:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:48,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:46:48,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:46:48,894 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-16 11:46:48,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 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 11:46:48,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:48,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-16 11:46:48,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:49,149 INFO L130 PetriNetUnfolder]: 94/832 cut-off events. [2022-11-16 11:46:49,150 INFO L131 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2022-11-16 11:46:49,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 832 events. 94/832 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4077 event pairs, 45 based on Foata normal form. 0/711 useless extension candidates. Maximal degree in co-relation 945. Up to 131 conditions per place. [2022-11-16 11:46:49,159 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 15 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-16 11:46:49,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 301 transitions, 644 flow [2022-11-16 11:46:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:46:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:46:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2022-11-16 11:46:49,164 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8950276243093923 [2022-11-16 11:46:49,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2022-11-16 11:46:49,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2022-11-16 11:46:49,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:49,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2022-11-16 11:46:49,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 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 11:46:49,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:49,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:49,172 INFO L175 Difference]: Start difference. First operand has 301 places, 302 transitions, 612 flow. Second operand 3 states and 972 transitions. [2022-11-16 11:46:49,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 301 transitions, 644 flow [2022-11-16 11:46:49,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:46:49,178 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 613 flow [2022-11-16 11:46:49,178 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2022-11-16 11:46:49,181 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-16 11:46:49,181 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 613 flow [2022-11-16 11:46:49,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 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 11:46:49,182 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:49,182 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, 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 11:46:49,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:46:49,183 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1464145761, now seen corresponding path program 1 times [2022-11-16 11:46:49,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:49,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026451697] [2022-11-16 11:46:49,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:49,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:49,848 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 11:46:49,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:49,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026451697] [2022-11-16 11:46:49,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026451697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:49,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:49,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:46:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916917461] [2022-11-16 11:46:49,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:49,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:46:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:46:49,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:46:49,859 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 362 [2022-11-16 11:46:49,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 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 11:46:49,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:49,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 362 [2022-11-16 11:46:49,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:51,169 INFO L130 PetriNetUnfolder]: 1533/3699 cut-off events. [2022-11-16 11:46:51,169 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-16 11:46:51,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5965 conditions, 3699 events. 1533/3699 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 25509 event pairs, 1176 based on Foata normal form. 0/3180 useless extension candidates. Maximal degree in co-relation 5930. Up to 2206 conditions per place. [2022-11-16 11:46:51,210 INFO L137 encePairwiseOnDemand]: 344/362 looper letters, 72 selfloop transitions, 15 changer transitions 0/298 dead transitions. [2022-11-16 11:46:51,210 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 298 transitions, 781 flow [2022-11-16 11:46:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:46:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:46:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1566 transitions. [2022-11-16 11:46:51,215 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7209944751381215 [2022-11-16 11:46:51,215 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1566 transitions. [2022-11-16 11:46:51,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1566 transitions. [2022-11-16 11:46:51,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:51,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1566 transitions. [2022-11-16 11:46:51,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 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 11:46:51,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:46:51,226 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:46:51,227 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 613 flow. Second operand 6 states and 1566 transitions. [2022-11-16 11:46:51,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 298 transitions, 781 flow [2022-11-16 11:46:51,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:46:51,237 INFO L231 Difference]: Finished difference. Result has 301 places, 298 transitions, 633 flow [2022-11-16 11:46:51,237 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=301, PETRI_TRANSITIONS=298} [2022-11-16 11:46:51,238 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-16 11:46:51,238 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 298 transitions, 633 flow [2022-11-16 11:46:51,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 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 11:46:51,240 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:51,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:51,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:46:51,240 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1075413526, now seen corresponding path program 1 times [2022-11-16 11:46:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:51,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148235809] [2022-11-16 11:46:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:51,328 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 11:46:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:51,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148235809] [2022-11-16 11:46:51,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148235809] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:51,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:51,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:46:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720180894] [2022-11-16 11:46:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:51,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:46:51,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:51,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:46:51,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:46:51,335 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-16 11:46:51,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 298 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 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 11:46:51,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:51,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-16 11:46:51,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:51,633 INFO L130 PetriNetUnfolder]: 94/912 cut-off events. [2022-11-16 11:46:51,634 INFO L131 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2022-11-16 11:46:51,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 912 events. 94/912 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4322 event pairs, 45 based on Foata normal form. 0/773 useless extension candidates. Maximal degree in co-relation 1040. Up to 131 conditions per place. [2022-11-16 11:46:51,641 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 15 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2022-11-16 11:46:51,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 297 transitions, 665 flow [2022-11-16 11:46:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:46:51,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:46:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2022-11-16 11:46:51,645 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8950276243093923 [2022-11-16 11:46:51,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2022-11-16 11:46:51,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2022-11-16 11:46:51,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:51,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2022-11-16 11:46:51,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 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 11:46:51,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:51,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:51,652 INFO L175 Difference]: Start difference. First operand has 301 places, 298 transitions, 633 flow. Second operand 3 states and 972 transitions. [2022-11-16 11:46:51,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 297 transitions, 665 flow [2022-11-16 11:46:51,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 297 transitions, 635 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:46:51,658 INFO L231 Difference]: Finished difference. Result has 297 places, 297 transitions, 605 flow [2022-11-16 11:46:51,659 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=297, PETRI_TRANSITIONS=297} [2022-11-16 11:46:51,660 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -33 predicate places. [2022-11-16 11:46:51,660 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 297 transitions, 605 flow [2022-11-16 11:46:51,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 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 11:46:51,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:51,661 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:51,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:46:51,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:51,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1893027788, now seen corresponding path program 1 times [2022-11-16 11:46:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:51,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851818887] [2022-11-16 11:46:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:51,726 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 11:46:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:51,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851818887] [2022-11-16 11:46:51,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851818887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:51,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:51,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:46:51,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663653541] [2022-11-16 11:46:51,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:51,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:46:51,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:46:51,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:46:51,730 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-16 11:46:51,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 297 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 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 11:46:51,732 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:51,732 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-16 11:46:51,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:51,875 INFO L130 PetriNetUnfolder]: 35/400 cut-off events. [2022-11-16 11:46:51,875 INFO L131 PetriNetUnfolder]: For 14/17 co-relation queries the response was YES. [2022-11-16 11:46:51,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 400 events. 35/400 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 951 event pairs, 12 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 423. Up to 48 conditions per place. [2022-11-16 11:46:51,882 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-11-16 11:46:51,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 296 transitions, 631 flow [2022-11-16 11:46:51,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:46:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:46:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2022-11-16 11:46:51,891 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9005524861878453 [2022-11-16 11:46:51,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 978 transitions. [2022-11-16 11:46:51,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 978 transitions. [2022-11-16 11:46:51,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:51,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 978 transitions. [2022-11-16 11:46:51,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 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 11:46:51,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:51,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:51,904 INFO L175 Difference]: Start difference. First operand has 297 places, 297 transitions, 605 flow. Second operand 3 states and 978 transitions. [2022-11-16 11:46:51,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 296 transitions, 631 flow [2022-11-16 11:46:51,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:46:51,910 INFO L231 Difference]: Finished difference. Result has 296 places, 296 transitions, 603 flow [2022-11-16 11:46:51,911 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=296, PETRI_TRANSITIONS=296} [2022-11-16 11:46:51,912 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -34 predicate places. [2022-11-16 11:46:51,912 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 296 transitions, 603 flow [2022-11-16 11:46:51,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 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 11:46:51,913 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:51,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:51,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:46:51,914 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:51,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:51,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1202485386, now seen corresponding path program 1 times [2022-11-16 11:46:51,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:51,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029723681] [2022-11-16 11:46:51,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:51,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:51,977 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 11:46:51,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:51,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029723681] [2022-11-16 11:46:51,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029723681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:51,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:51,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:46:51,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003955155] [2022-11-16 11:46:51,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:51,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:46:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:46:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:46:51,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-16 11:46:51,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 296 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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 11:46:51,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:51,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-16 11:46:51,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:52,290 INFO L130 PetriNetUnfolder]: 119/893 cut-off events. [2022-11-16 11:46:52,290 INFO L131 PetriNetUnfolder]: For 20/25 co-relation queries the response was YES. [2022-11-16 11:46:52,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 893 events. 119/893 cut-off events. For 20/25 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4458 event pairs, 45 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 1058. Up to 120 conditions per place. [2022-11-16 11:46:52,300 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 18 selfloop transitions, 3 changer transitions 0/299 dead transitions. [2022-11-16 11:46:52,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 299 transitions, 653 flow [2022-11-16 11:46:52,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:46:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:46:52,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2022-11-16 11:46:52,303 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8996316758747698 [2022-11-16 11:46:52,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2022-11-16 11:46:52,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2022-11-16 11:46:52,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:52,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2022-11-16 11:46:52,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 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 11:46:52,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:52,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:52,311 INFO L175 Difference]: Start difference. First operand has 296 places, 296 transitions, 603 flow. Second operand 3 states and 977 transitions. [2022-11-16 11:46:52,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 299 transitions, 653 flow [2022-11-16 11:46:52,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 299 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:46:52,319 INFO L231 Difference]: Finished difference. Result has 294 places, 294 transitions, 601 flow [2022-11-16 11:46:52,319 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=294} [2022-11-16 11:46:52,320 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -36 predicate places. [2022-11-16 11:46:52,320 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 294 transitions, 601 flow [2022-11-16 11:46:52,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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 11:46:52,321 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:52,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:52,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:46:52,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:52,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:52,322 INFO L85 PathProgramCache]: Analyzing trace with hash 242284172, now seen corresponding path program 1 times [2022-11-16 11:46:52,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:52,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818757058] [2022-11-16 11:46:52,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:52,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:52,394 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 11:46:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:52,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818757058] [2022-11-16 11:46:52,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818757058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:52,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:52,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:46:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968204367] [2022-11-16 11:46:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:52,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:46:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:46:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:46:52,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-16 11:46:52,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 294 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 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 11:46:52,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:52,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-16 11:46:52,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:52,674 INFO L130 PetriNetUnfolder]: 84/837 cut-off events. [2022-11-16 11:46:52,675 INFO L131 PetriNetUnfolder]: For 25/30 co-relation queries the response was YES. [2022-11-16 11:46:52,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 837 events. 84/837 cut-off events. For 25/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4006 event pairs, 8 based on Foata normal form. 1/748 useless extension candidates. Maximal degree in co-relation 954. Up to 102 conditions per place. [2022-11-16 11:46:52,684 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 20 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-16 11:46:52,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 302 transitions, 666 flow [2022-11-16 11:46:52,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:46:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:46:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 986 transitions. [2022-11-16 11:46:52,688 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9079189686924494 [2022-11-16 11:46:52,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 986 transitions. [2022-11-16 11:46:52,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 986 transitions. [2022-11-16 11:46:52,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:52,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 986 transitions. [2022-11-16 11:46:52,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 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 11:46:52,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:52,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:46:52,696 INFO L175 Difference]: Start difference. First operand has 294 places, 294 transitions, 601 flow. Second operand 3 states and 986 transitions. [2022-11-16 11:46:52,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 302 transitions, 666 flow [2022-11-16 11:46:52,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 302 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:46:52,705 INFO L231 Difference]: Finished difference. Result has 294 places, 295 transitions, 607 flow [2022-11-16 11:46:52,706 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2022-11-16 11:46:52,706 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -36 predicate places. [2022-11-16 11:46:52,707 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 607 flow [2022-11-16 11:46:52,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 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 11:46:52,708 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:52,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:52,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:46:52,708 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:52,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:52,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1316432944, now seen corresponding path program 1 times [2022-11-16 11:46:52,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:52,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176414148] [2022-11-16 11:46:52,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:52,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:52,951 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 11:46:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:52,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176414148] [2022-11-16 11:46:52,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176414148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:52,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:52,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:46:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625494457] [2022-11-16 11:46:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:52,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:46:52,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:52,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:46:52,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:46:52,955 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 362 [2022-11-16 11:46:52,957 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 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 11:46:52,957 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:52,957 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 362 [2022-11-16 11:46:52,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:54,815 INFO L130 PetriNetUnfolder]: 2045/5891 cut-off events. [2022-11-16 11:46:54,816 INFO L131 PetriNetUnfolder]: For 328/415 co-relation queries the response was YES. [2022-11-16 11:46:54,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9416 conditions, 5891 events. 2045/5891 cut-off events. For 328/415 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 45693 event pairs, 968 based on Foata normal form. 2/4763 useless extension candidates. Maximal degree in co-relation 9379. Up to 2066 conditions per place. [2022-11-16 11:46:54,869 INFO L137 encePairwiseOnDemand]: 343/362 looper letters, 196 selfloop transitions, 28 changer transitions 0/433 dead transitions. [2022-11-16 11:46:54,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 433 transitions, 1367 flow [2022-11-16 11:46:54,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:46:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:46:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2949 transitions. [2022-11-16 11:46:54,877 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7405826217980914 [2022-11-16 11:46:54,877 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2949 transitions. [2022-11-16 11:46:54,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2949 transitions. [2022-11-16 11:46:54,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:54,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2949 transitions. [2022-11-16 11:46:54,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 268.09090909090907) internal successors, (2949), 11 states have internal predecessors, (2949), 0 states have call successors, (0), 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 11:46:54,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 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 11:46:54,895 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 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 11:46:54,895 INFO L175 Difference]: Start difference. First operand has 294 places, 295 transitions, 607 flow. Second operand 11 states and 2949 transitions. [2022-11-16 11:46:54,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 433 transitions, 1367 flow [2022-11-16 11:46:54,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 433 transitions, 1367 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:46:54,903 INFO L231 Difference]: Finished difference. Result has 308 places, 312 transitions, 740 flow [2022-11-16 11:46:54,904 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=740, PETRI_PLACES=308, PETRI_TRANSITIONS=312} [2022-11-16 11:46:54,904 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -22 predicate places. [2022-11-16 11:46:54,904 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 312 transitions, 740 flow [2022-11-16 11:46:54,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 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 11:46:54,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:54,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:54,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:46:54,906 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:54,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2022030158, now seen corresponding path program 1 times [2022-11-16 11:46:54,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:54,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084899392] [2022-11-16 11:46:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:55,496 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 11:46:55,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:55,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084899392] [2022-11-16 11:46:55,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084899392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:55,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:55,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:46:55,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730429885] [2022-11-16 11:46:55,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:55,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:46:55,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:55,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:46:55,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:46:55,500 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-16 11:46:55,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 312 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 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 11:46:55,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:55,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-16 11:46:55,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:46:58,338 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][230], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 273#L97-1true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), 223#L62true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,339 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-16 11:46:58,340 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-16 11:46:58,340 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-16 11:46:58,340 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-16 11:46:58,341 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][259], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 73#L97-3true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), 223#L62true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,341 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-16 11:46:58,341 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:46:58,341 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:46:58,341 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:46:58,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][260], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 90#L97-4true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), 223#L62true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,342 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-16 11:46:58,342 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 11:46:58,343 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-16 11:46:58,343 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-16 11:46:58,343 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][261], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 154#L97-2true, 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 46#L50-3true, 223#L62true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,344 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-16 11:46:58,344 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-16 11:46:58,344 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-16 11:46:58,344 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-16 11:46:58,345 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 7#L97-6true, 46#L50-3true, 223#L62true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,345 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-16 11:46:58,345 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:46:58,345 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-16 11:46:58,346 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-16 11:46:58,346 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 36#L97-5true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), 223#L62true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,346 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-16 11:46:58,347 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 11:46:58,347 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:46:58,347 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:46:58,362 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][230], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 273#L97-1true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), 223#L62true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,363 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-16 11:46:58,363 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:46:58,363 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-16 11:46:58,363 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-16 11:46:58,364 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][259], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 73#L97-3true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 46#L50-3true, 223#L62true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,364 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-16 11:46:58,364 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-16 11:46:58,365 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:46:58,365 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-16 11:46:58,365 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][260], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 90#L97-4true, 46#L50-3true, 223#L62true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,366 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-16 11:46:58,366 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-16 11:46:58,366 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-16 11:46:58,366 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:46:58,367 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][261], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 154#L97-2true, 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 46#L50-3true, 223#L62true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,367 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-16 11:46:58,367 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-16 11:46:58,367 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-16 11:46:58,367 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-16 11:46:58,368 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 36#L97-5true, 417#true, 46#L50-3true, 223#L62true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,368 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-16 11:46:58,369 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-16 11:46:58,369 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-16 11:46:58,369 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-16 11:46:58,369 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 7#L97-6true, 46#L50-3true, 223#L62true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-16 11:46:58,370 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-16 11:46:58,370 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-16 11:46:58,370 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-16 11:46:58,370 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-16 11:46:58,421 INFO L130 PetriNetUnfolder]: 2820/7139 cut-off events. [2022-11-16 11:46:58,421 INFO L131 PetriNetUnfolder]: For 1311/1341 co-relation queries the response was YES. [2022-11-16 11:46:58,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12944 conditions, 7139 events. 2820/7139 cut-off events. For 1311/1341 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 54845 event pairs, 537 based on Foata normal form. 24/6583 useless extension candidates. Maximal degree in co-relation 12900. Up to 2540 conditions per place. [2022-11-16 11:46:58,503 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 129 selfloop transitions, 13 changer transitions 0/395 dead transitions. [2022-11-16 11:46:58,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 395 transitions, 1213 flow [2022-11-16 11:46:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:46:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:46:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1776 transitions. [2022-11-16 11:46:58,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8176795580110497 [2022-11-16 11:46:58,508 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1776 transitions. [2022-11-16 11:46:58,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1776 transitions. [2022-11-16 11:46:58,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:46:58,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1776 transitions. [2022-11-16 11:46:58,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 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 11:46:58,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:46:58,519 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:46:58,520 INFO L175 Difference]: Start difference. First operand has 308 places, 312 transitions, 740 flow. Second operand 6 states and 1776 transitions. [2022-11-16 11:46:58,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 395 transitions, 1213 flow [2022-11-16 11:46:58,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 395 transitions, 1208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:46:58,532 INFO L231 Difference]: Finished difference. Result has 316 places, 324 transitions, 845 flow [2022-11-16 11:46:58,534 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=845, PETRI_PLACES=316, PETRI_TRANSITIONS=324} [2022-11-16 11:46:58,535 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -14 predicate places. [2022-11-16 11:46:58,536 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 324 transitions, 845 flow [2022-11-16 11:46:58,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 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 11:46:58,538 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:46:58,538 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:58,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:46:58,538 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:46:58,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:46:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1595168434, now seen corresponding path program 1 times [2022-11-16 11:46:58,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:46:58,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392915247] [2022-11-16 11:46:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:46:58,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:46:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:46:58,817 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 11:46:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:46:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392915247] [2022-11-16 11:46:58,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392915247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:46:58,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:46:58,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:46:58,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219494678] [2022-11-16 11:46:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:46:58,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:46:58,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:46:58,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:46:58,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:46:58,822 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 362 [2022-11-16 11:46:58,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 324 transitions, 845 flow. Second operand has 7 states, 7 states have (on average 266.57142857142856) internal successors, (1866), 7 states have internal predecessors, (1866), 0 states have call successors, (0), 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 11:46:58,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:46:58,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 362 [2022-11-16 11:46:58,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:00,743 INFO L130 PetriNetUnfolder]: 2331/5562 cut-off events. [2022-11-16 11:47:00,743 INFO L131 PetriNetUnfolder]: For 3492/4112 co-relation queries the response was YES. [2022-11-16 11:47:00,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10994 conditions, 5562 events. 2331/5562 cut-off events. For 3492/4112 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40856 event pairs, 1130 based on Foata normal form. 37/4477 useless extension candidates. Maximal degree in co-relation 10948. Up to 2836 conditions per place. [2022-11-16 11:47:00,823 INFO L137 encePairwiseOnDemand]: 343/362 looper letters, 178 selfloop transitions, 28 changer transitions 0/435 dead transitions. [2022-11-16 11:47:00,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 435 transitions, 1511 flow [2022-11-16 11:47:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:47:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:47:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3081 transitions. [2022-11-16 11:47:00,833 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7737317930688097 [2022-11-16 11:47:00,834 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3081 transitions. [2022-11-16 11:47:00,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3081 transitions. [2022-11-16 11:47:00,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:00,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3081 transitions. [2022-11-16 11:47:00,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 280.09090909090907) internal successors, (3081), 11 states have internal predecessors, (3081), 0 states have call successors, (0), 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 11:47:00,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 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 11:47:00,857 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 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 11:47:00,857 INFO L175 Difference]: Start difference. First operand has 316 places, 324 transitions, 845 flow. Second operand 11 states and 3081 transitions. [2022-11-16 11:47:00,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 435 transitions, 1511 flow [2022-11-16 11:47:00,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 435 transitions, 1511 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:47:00,873 INFO L231 Difference]: Finished difference. Result has 328 places, 326 transitions, 913 flow [2022-11-16 11:47:00,874 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=913, PETRI_PLACES=328, PETRI_TRANSITIONS=326} [2022-11-16 11:47:00,875 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -2 predicate places. [2022-11-16 11:47:00,875 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 326 transitions, 913 flow [2022-11-16 11:47:00,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 266.57142857142856) internal successors, (1866), 7 states have internal predecessors, (1866), 0 states have call successors, (0), 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 11:47:00,876 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:00,876 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:00,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:47:00,877 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:47:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:00,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1011304084, now seen corresponding path program 1 times [2022-11-16 11:47:00,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:00,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584077168] [2022-11-16 11:47:00,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:00,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:01,627 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 11:47:01,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:01,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584077168] [2022-11-16 11:47:01,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584077168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:01,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:01,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:47:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655205079] [2022-11-16 11:47:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:01,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:47:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:01,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:47:01,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:47:01,630 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-16 11:47:01,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 326 transitions, 913 flow. Second operand has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 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 11:47:01,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:01,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-16 11:47:01,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:03,928 INFO L130 PetriNetUnfolder]: 2259/7129 cut-off events. [2022-11-16 11:47:03,928 INFO L131 PetriNetUnfolder]: For 5284/5389 co-relation queries the response was YES. [2022-11-16 11:47:03,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14516 conditions, 7129 events. 2259/7129 cut-off events. For 5284/5389 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 63278 event pairs, 1240 based on Foata normal form. 12/6634 useless extension candidates. Maximal degree in co-relation 14465. Up to 3011 conditions per place. [2022-11-16 11:47:04,014 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 86 selfloop transitions, 17 changer transitions 0/358 dead transitions. [2022-11-16 11:47:04,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 358 transitions, 1253 flow [2022-11-16 11:47:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:47:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:47:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2022-11-16 11:47:04,020 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7923572744014733 [2022-11-16 11:47:04,020 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2022-11-16 11:47:04,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2022-11-16 11:47:04,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:04,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2022-11-16 11:47:04,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 0 states have call successors, (0), 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 11:47:04,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:47:04,033 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:47:04,033 INFO L175 Difference]: Start difference. First operand has 328 places, 326 transitions, 913 flow. Second operand 6 states and 1721 transitions. [2022-11-16 11:47:04,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 358 transitions, 1253 flow [2022-11-16 11:47:04,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 358 transitions, 1228 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:47:04,065 INFO L231 Difference]: Finished difference. Result has 333 places, 342 transitions, 1072 flow [2022-11-16 11:47:04,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1072, PETRI_PLACES=333, PETRI_TRANSITIONS=342} [2022-11-16 11:47:04,068 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 3 predicate places. [2022-11-16 11:47:04,068 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 342 transitions, 1072 flow [2022-11-16 11:47:04,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 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 11:47:04,069 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:04,069 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:04,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:47:04,070 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:47:04,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:04,070 INFO L85 PathProgramCache]: Analyzing trace with hash -944163004, now seen corresponding path program 1 times [2022-11-16 11:47:04,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:04,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921591025] [2022-11-16 11:47:04,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:04,818 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 11:47:04,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:04,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921591025] [2022-11-16 11:47:04,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921591025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:04,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:04,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:47:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516788359] [2022-11-16 11:47:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:04,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:47:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:47:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:47:04,823 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-16 11:47:04,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 342 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 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 11:47:04,826 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:04,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-16 11:47:04,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:06,728 INFO L130 PetriNetUnfolder]: 2278/7172 cut-off events. [2022-11-16 11:47:06,729 INFO L131 PetriNetUnfolder]: For 7573/7714 co-relation queries the response was YES. [2022-11-16 11:47:06,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15476 conditions, 7172 events. 2278/7172 cut-off events. For 7573/7714 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 63526 event pairs, 1321 based on Foata normal form. 0/6681 useless extension candidates. Maximal degree in co-relation 15423. Up to 3204 conditions per place. [2022-11-16 11:47:06,806 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 90 selfloop transitions, 4 changer transitions 0/349 dead transitions. [2022-11-16 11:47:06,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 349 transitions, 1274 flow [2022-11-16 11:47:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:47:06,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:47:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1704 transitions. [2022-11-16 11:47:06,812 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7845303867403315 [2022-11-16 11:47:06,812 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1704 transitions. [2022-11-16 11:47:06,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1704 transitions. [2022-11-16 11:47:06,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:06,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1704 transitions. [2022-11-16 11:47:06,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 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 11:47:06,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:47:06,825 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:47:06,825 INFO L175 Difference]: Start difference. First operand has 333 places, 342 transitions, 1072 flow. Second operand 6 states and 1704 transitions. [2022-11-16 11:47:06,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 349 transitions, 1274 flow [2022-11-16 11:47:06,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 349 transitions, 1274 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:47:06,852 INFO L231 Difference]: Finished difference. Result has 337 places, 341 transitions, 1078 flow [2022-11-16 11:47:06,853 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1078, PETRI_PLACES=337, PETRI_TRANSITIONS=341} [2022-11-16 11:47:06,854 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 7 predicate places. [2022-11-16 11:47:06,855 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 341 transitions, 1078 flow [2022-11-16 11:47:06,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 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 11:47:06,855 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:06,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:06,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:47:06,856 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:47:06,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:06,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1076140392, now seen corresponding path program 1 times [2022-11-16 11:47:06,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:06,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497492131] [2022-11-16 11:47:06,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497492131] [2022-11-16 11:47:07,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497492131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:07,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:07,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:47:07,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746561897] [2022-11-16 11:47:07,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:07,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:47:07,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:47:07,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:47:07,670 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 362 [2022-11-16 11:47:07,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 341 transitions, 1078 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 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 11:47:07,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:07,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 362 [2022-11-16 11:47:07,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:11,015 INFO L130 PetriNetUnfolder]: 4571/12219 cut-off events. [2022-11-16 11:47:11,015 INFO L131 PetriNetUnfolder]: For 14795/15254 co-relation queries the response was YES. [2022-11-16 11:47:11,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28561 conditions, 12219 events. 4571/12219 cut-off events. For 14795/15254 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 113868 event pairs, 1236 based on Foata normal form. 21/11701 useless extension candidates. Maximal degree in co-relation 28508. Up to 4740 conditions per place. [2022-11-16 11:47:11,152 INFO L137 encePairwiseOnDemand]: 354/362 looper letters, 156 selfloop transitions, 26 changer transitions 0/430 dead transitions. [2022-11-16 11:47:11,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 430 transitions, 1876 flow [2022-11-16 11:47:11,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:47:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:47:11,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1740 transitions. [2022-11-16 11:47:11,159 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8011049723756906 [2022-11-16 11:47:11,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1740 transitions. [2022-11-16 11:47:11,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1740 transitions. [2022-11-16 11:47:11,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:11,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1740 transitions. [2022-11-16 11:47:11,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 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 11:47:11,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:47:11,170 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 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 11:47:11,171 INFO L175 Difference]: Start difference. First operand has 337 places, 341 transitions, 1078 flow. Second operand 6 states and 1740 transitions. [2022-11-16 11:47:11,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 430 transitions, 1876 flow [2022-11-16 11:47:11,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 430 transitions, 1869 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:47:11,288 INFO L231 Difference]: Finished difference. Result has 343 places, 366 transitions, 1375 flow [2022-11-16 11:47:11,289 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1375, PETRI_PLACES=343, PETRI_TRANSITIONS=366} [2022-11-16 11:47:11,289 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2022-11-16 11:47:11,289 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 366 transitions, 1375 flow [2022-11-16 11:47:11,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 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 11:47:11,290 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:11,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:11,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:47:11,291 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:47:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 28519659, now seen corresponding path program 1 times [2022-11-16 11:47:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:11,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031800714] [2022-11-16 11:47:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:11,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:11,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031800714] [2022-11-16 11:47:11,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031800714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:11,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:11,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982466089] [2022-11-16 11:47:11,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:11,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:11,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:11,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:11,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:11,379 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 362 [2022-11-16 11:47:11,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 366 transitions, 1375 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 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 11:47:11,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:11,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 362 [2022-11-16 11:47:11,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:12,942 INFO L130 PetriNetUnfolder]: 1650/5708 cut-off events. [2022-11-16 11:47:12,942 INFO L131 PetriNetUnfolder]: For 15721/15912 co-relation queries the response was YES. [2022-11-16 11:47:12,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14626 conditions, 5708 events. 1650/5708 cut-off events. For 15721/15912 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 49960 event pairs, 335 based on Foata normal form. 0/5411 useless extension candidates. Maximal degree in co-relation 14570. Up to 1509 conditions per place. [2022-11-16 11:47:13,008 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 70 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2022-11-16 11:47:13,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 379 transitions, 1641 flow [2022-11-16 11:47:13,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2022-11-16 11:47:13,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8941068139963168 [2022-11-16 11:47:13,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2022-11-16 11:47:13,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2022-11-16 11:47:13,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:13,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2022-11-16 11:47:13,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 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 11:47:13,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:47:13,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:47:13,024 INFO L175 Difference]: Start difference. First operand has 343 places, 366 transitions, 1375 flow. Second operand 3 states and 971 transitions. [2022-11-16 11:47:13,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 379 transitions, 1641 flow [2022-11-16 11:47:13,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 379 transitions, 1571 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-11-16 11:47:13,070 INFO L231 Difference]: Finished difference. Result has 344 places, 365 transitions, 1321 flow [2022-11-16 11:47:13,071 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=344, PETRI_TRANSITIONS=365} [2022-11-16 11:47:13,072 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 14 predicate places. [2022-11-16 11:47:13,072 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 365 transitions, 1321 flow [2022-11-16 11:47:13,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 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 11:47:13,073 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:13,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:13,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:47:13,074 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:47:13,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1477757883, now seen corresponding path program 1 times [2022-11-16 11:47:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:13,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684802734] [2022-11-16 11:47:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:13,184 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 11:47:13,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:13,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684802734] [2022-11-16 11:47:13,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684802734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:13,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:13,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:13,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688655470] [2022-11-16 11:47:13,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:13,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:13,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:13,192 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 362 [2022-11-16 11:47:13,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 365 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 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 11:47:13,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:13,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 362 [2022-11-16 11:47:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:14,119 INFO L130 PetriNetUnfolder]: 908/3585 cut-off events. [2022-11-16 11:47:14,120 INFO L131 PetriNetUnfolder]: For 7108/7212 co-relation queries the response was YES. [2022-11-16 11:47:14,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8184 conditions, 3585 events. 908/3585 cut-off events. For 7108/7212 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 28789 event pairs, 142 based on Foata normal form. 0/3261 useless extension candidates. Maximal degree in co-relation 8127. Up to 940 conditions per place. [2022-11-16 11:47:14,153 INFO L137 encePairwiseOnDemand]: 360/362 looper letters, 51 selfloop transitions, 1 changer transitions 0/364 dead transitions. [2022-11-16 11:47:14,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 364 transitions, 1423 flow [2022-11-16 11:47:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:14,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-11-16 11:47:14,156 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9060773480662984 [2022-11-16 11:47:14,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-11-16 11:47:14,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-11-16 11:47:14,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:14,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-11-16 11:47:14,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 11:47:14,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:47:14,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:47:14,162 INFO L175 Difference]: Start difference. First operand has 344 places, 365 transitions, 1321 flow. Second operand 3 states and 984 transitions. [2022-11-16 11:47:14,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 364 transitions, 1423 flow [2022-11-16 11:47:14,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 364 transitions, 1419 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:47:14,180 INFO L231 Difference]: Finished difference. Result has 343 places, 364 transitions, 1317 flow [2022-11-16 11:47:14,181 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=343, PETRI_TRANSITIONS=364} [2022-11-16 11:47:14,182 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2022-11-16 11:47:14,182 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 364 transitions, 1317 flow [2022-11-16 11:47:14,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 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 11:47:14,182 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:14,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:14,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:47:14,183 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:47:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1794678830, now seen corresponding path program 1 times [2022-11-16 11:47:14,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:14,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218907655] [2022-11-16 11:47:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:14,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:14,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:14,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:14,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218907655] [2022-11-16 11:47:14,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218907655] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:14,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:14,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:14,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652841416] [2022-11-16 11:47:14,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:14,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:14,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:14,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:14,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:14,259 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-16 11:47:14,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 364 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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 11:47:14,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:14,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-16 11:47:14,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:15,433 INFO L130 PetriNetUnfolder]: 1684/5304 cut-off events. [2022-11-16 11:47:15,433 INFO L131 PetriNetUnfolder]: For 12158/12392 co-relation queries the response was YES. [2022-11-16 11:47:15,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13120 conditions, 5304 events. 1684/5304 cut-off events. For 12158/12392 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 43285 event pairs, 302 based on Foata normal form. 6/4774 useless extension candidates. Maximal degree in co-relation 13063. Up to 1546 conditions per place. [2022-11-16 11:47:15,495 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 66 selfloop transitions, 2 changer transitions 23/376 dead transitions. [2022-11-16 11:47:15,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 376 transitions, 1563 flow [2022-11-16 11:47:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:15,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2022-11-16 11:47:15,499 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8987108655616943 [2022-11-16 11:47:15,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 976 transitions. [2022-11-16 11:47:15,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 976 transitions. [2022-11-16 11:47:15,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:15,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 976 transitions. [2022-11-16 11:47:15,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 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 11:47:15,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:47:15,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:47:15,505 INFO L175 Difference]: Start difference. First operand has 343 places, 364 transitions, 1317 flow. Second operand 3 states and 976 transitions. [2022-11-16 11:47:15,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 376 transitions, 1563 flow [2022-11-16 11:47:15,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 376 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:47:15,531 INFO L231 Difference]: Finished difference. Result has 342 places, 339 transitions, 1203 flow [2022-11-16 11:47:15,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=342, PETRI_TRANSITIONS=339} [2022-11-16 11:47:15,532 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, 12 predicate places. [2022-11-16 11:47:15,532 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 339 transitions, 1203 flow [2022-11-16 11:47:15,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 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 11:47:15,533 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:15,533 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:15,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:47:15,533 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:47:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1890465872, now seen corresponding path program 1 times [2022-11-16 11:47:15,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:15,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412858186] [2022-11-16 11:47:15,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:15,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:15,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:15,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412858186] [2022-11-16 11:47:15,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412858186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:15,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:15,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:47:15,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533628736] [2022-11-16 11:47:15,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:15,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:47:15,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:15,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:47:15,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:47:15,637 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-16 11:47:15,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 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 11:47:15,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:15,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-16 11:47:15,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:47:16,957 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][304], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, 47#L73true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), 223#L62true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 179#L97-7true, 388#(= |#race~A~0| 0), 453#true]) [2022-11-16 11:47:16,957 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-16 11:47:16,957 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:47:16,957 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-16 11:47:16,957 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-16 11:47:16,979 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][304], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), 223#L62true, Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 179#L97-7true, 388#(= |#race~A~0| 0), 453#true]) [2022-11-16 11:47:16,979 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-16 11:47:16,979 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-16 11:47:16,979 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-16 11:47:16,979 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-16 11:47:17,013 INFO L130 PetriNetUnfolder]: 1206/4116 cut-off events. [2022-11-16 11:47:17,014 INFO L131 PetriNetUnfolder]: For 9584/9771 co-relation queries the response was YES. [2022-11-16 11:47:17,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10244 conditions, 4116 events. 1206/4116 cut-off events. For 9584/9771 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 34037 event pairs, 70 based on Foata normal form. 0/3781 useless extension candidates. Maximal degree in co-relation 10213. Up to 1235 conditions per place. [2022-11-16 11:47:17,067 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 50 selfloop transitions, 35 changer transitions 0/370 dead transitions. [2022-11-16 11:47:17,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 370 transitions, 1633 flow [2022-11-16 11:47:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:47:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:47:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-11-16 11:47:17,070 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9060773480662984 [2022-11-16 11:47:17,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-11-16 11:47:17,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-11-16 11:47:17,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:47:17,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-11-16 11:47:17,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 11:47:17,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:47:17,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 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 11:47:17,078 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 1203 flow. Second operand 3 states and 984 transitions. [2022-11-16 11:47:17,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 370 transitions, 1633 flow [2022-11-16 11:47:17,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 370 transitions, 1585 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-11-16 11:47:17,107 INFO L231 Difference]: Finished difference. Result has 317 places, 364 transitions, 1556 flow [2022-11-16 11:47:17,108 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=317, PETRI_TRANSITIONS=364} [2022-11-16 11:47:17,109 INFO L288 CegarLoopForPetriNet]: 330 programPoint places, -13 predicate places. [2022-11-16 11:47:17,109 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 364 transitions, 1556 flow [2022-11-16 11:47:17,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 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 11:47:17,110 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:47:17,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:47:17,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:47:17,110 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-16 11:47:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:47:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash -170075700, now seen corresponding path program 1 times [2022-11-16 11:47:17,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:47:17,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872414233] [2022-11-16 11:47:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:47:17,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:47:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:47:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:47:20,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:47:20,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872414233] [2022-11-16 11:47:20,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872414233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:47:20,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:47:20,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-16 11:47:20,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139797371] [2022-11-16 11:47:20,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:47:20,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:47:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:47:20,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:47:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:47:20,237 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 362 [2022-11-16 11:47:20,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 364 transitions, 1556 flow. Second operand has 20 states, 20 states have (on average 227.4) internal successors, (4548), 20 states have internal predecessors, (4548), 0 states have call successors, (0), 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 11:47:20,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:47:20,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 362 [2022-11-16 11:47:20,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand