./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-multiply-verify.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_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/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_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/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_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/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 b6872adb14a2dfa535a444bb6d903bd37f60f26cf718935f2927b47d5c5a6aaa --- 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:35:44,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:35:44,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:35:44,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:35:44,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:35:44,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:35:44,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:35:44,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:35:44,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:35:44,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:35:44,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:35:44,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:35:44,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:35:44,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:35:44,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:35:44,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:35:44,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:35:44,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:35:44,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:35:44,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:35:44,639 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:35:44,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:35:44,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:35:44,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:35:44,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:35:44,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:35:44,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:35:44,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:35:44,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:35:44,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:35:44,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:35:44,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:35:44,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:35:44,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:35:44,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:35:44,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:35:44,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:35:44,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:35:44,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:35:44,672 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:35:44,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:35:44,674 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 11:35:44,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:35:44,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:35:44,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:35:44,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:35:44,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:35:44,716 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:35:44,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:35:44,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:35:44,717 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:35:44,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:35:44,718 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:35:44,719 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:35:44,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:35:44,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:35:44,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:35:44,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:35:44,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:35:44,720 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:35:44,720 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 11:35:44,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:35:44,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:35:44,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:35:44,721 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:35:44,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:35:44,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:35:44,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:35:44,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:35:44,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:35:44,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:35:44,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:35:44,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:35:44,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:35:44,725 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:35:44,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:35:44,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:35:44,725 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_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/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_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/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 -> b6872adb14a2dfa535a444bb6d903bd37f60f26cf718935f2927b47d5c5a6aaa [2022-11-16 11:35:45,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:35:45,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:35:45,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:35:45,086 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:35:45,087 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:35:45,088 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2022-11-16 11:35:45,149 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/data/4b16b2cf5/a64f4f55cd4e42e0bbb5d021830f8c73/FLAG72f52f128 [2022-11-16 11:35:45,690 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:35:45,691 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2022-11-16 11:35:45,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/data/4b16b2cf5/a64f4f55cd4e42e0bbb5d021830f8c73/FLAG72f52f128 [2022-11-16 11:35:46,037 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/data/4b16b2cf5/a64f4f55cd4e42e0bbb5d021830f8c73 [2022-11-16 11:35:46,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:35:46,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:35:46,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:35:46,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:35:46,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:35:46,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1548ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46, skipping insertion in model container [2022-11-16 11:35:46,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:35:46,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:35:46,320 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_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-11-16 11:35:46,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:35:46,335 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:35:46,370 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_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-11-16 11:35:46,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:35:46,390 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:35:46,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46 WrapperNode [2022-11-16 11:35:46,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:35:46,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:35:46,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:35:46,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:35:46,400 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:35:46" (1/1) ... [2022-11-16 11:35:46,413 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:35:46" (1/1) ... [2022-11-16 11:35:46,455 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 325 [2022-11-16 11:35:46,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:35:46,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:35:46,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:35:46,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:35:46,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,538 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:35:46,553 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:35:46,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:35:46,553 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:35:46,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (1/1) ... [2022-11-16 11:35:46,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:35:46,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:35:46,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:35:46,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:35:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:35:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:35:46,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:35:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:35:46,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 11:35:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 11:35:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 11:35:46,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 11:35:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 11:35:46,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 11:35:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:35:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:35:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:35:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:35:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:35:46,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:35:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:35:46,649 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:35:46,787 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:35:46,789 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:35:47,531 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:35:47,839 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:35:47,840 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 11:35:47,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:35:47 BoogieIcfgContainer [2022-11-16 11:35:47,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:35:47,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:35:47,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:35:47,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:35:47,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:35:46" (1/3) ... [2022-11-16 11:35:47,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1ac8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:35:47, skipping insertion in model container [2022-11-16 11:35:47,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:35:46" (2/3) ... [2022-11-16 11:35:47,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1ac8ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:35:47, skipping insertion in model container [2022-11-16 11:35:47,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:35:47" (3/3) ... [2022-11-16 11:35:47,857 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-11-16 11:35:47,866 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:35:47,878 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:35:47,878 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-11-16 11:35:47,879 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:35:47,988 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 11:35:48,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 276 transitions, 576 flow [2022-11-16 11:35:48,185 INFO L130 PetriNetUnfolder]: 9/273 cut-off events. [2022-11-16 11:35:48,188 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-16 11:35:48,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 273 events. 9/273 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 336 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 183. Up to 2 conditions per place. [2022-11-16 11:35:48,198 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 276 transitions, 576 flow [2022-11-16 11:35:48,210 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 253 transitions, 524 flow [2022-11-16 11:35:48,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:35:48,241 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;@2e52cfe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:35:48,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-16 11:35:48,257 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-16 11:35:48,261 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:35:48,261 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:48,262 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] [2022-11-16 11:35:48,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:48,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:48,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1749502789, now seen corresponding path program 1 times [2022-11-16 11:35:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:48,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532614632] [2022-11-16 11:35:48,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:48,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:48,529 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:35:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:48,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532614632] [2022-11-16 11:35:48,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532614632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:48,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:48,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:48,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462103094] [2022-11-16 11:35:48,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:48,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:48,597 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-16 11:35:48,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 253 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:35:48,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:48,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-16 11:35:48,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:49,259 INFO L130 PetriNetUnfolder]: 207/2157 cut-off events. [2022-11-16 11:35:49,260 INFO L131 PetriNetUnfolder]: For 88/122 co-relation queries the response was YES. [2022-11-16 11:35:49,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2601 conditions, 2157 events. 207/2157 cut-off events. For 88/122 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 18802 event pairs, 167 based on Foata normal form. 3/1768 useless extension candidates. Maximal degree in co-relation 2368. Up to 337 conditions per place. [2022-11-16 11:35:49,280 INFO L137 encePairwiseOnDemand]: 245/276 looper letters, 20 selfloop transitions, 2 changer transitions 2/224 dead transitions. [2022-11-16 11:35:49,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 224 transitions, 510 flow [2022-11-16 11:35:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:49,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2022-11-16 11:35:49,298 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2022-11-16 11:35:49,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2022-11-16 11:35:49,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2022-11-16 11:35:49,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:49,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2022-11-16 11:35:49,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 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:35:49,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:49,317 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:49,319 INFO L175 Difference]: Start difference. First operand has 255 places, 253 transitions, 524 flow. Second operand 3 states and 720 transitions. [2022-11-16 11:35:49,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 224 transitions, 510 flow [2022-11-16 11:35:49,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 224 transitions, 498 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-16 11:35:49,330 INFO L231 Difference]: Finished difference. Result has 227 places, 222 transitions, 454 flow [2022-11-16 11:35:49,332 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=227, PETRI_TRANSITIONS=222} [2022-11-16 11:35:49,336 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -28 predicate places. [2022-11-16 11:35:49,336 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 222 transitions, 454 flow [2022-11-16 11:35:49,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:35:49,337 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:49,337 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:35:49,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:35:49,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1826977481, now seen corresponding path program 1 times [2022-11-16 11:35:49,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:49,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334900182] [2022-11-16 11:35:49,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:49,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:49,393 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:35:49,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:49,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334900182] [2022-11-16 11:35:49,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334900182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:49,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:49,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:49,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797623014] [2022-11-16 11:35:49,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:49,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:49,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:49,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:49,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:49,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-16 11:35:49,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 222 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:49,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:49,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-16 11:35:49,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:49,668 INFO L130 PetriNetUnfolder]: 59/827 cut-off events. [2022-11-16 11:35:49,668 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:35:49,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943 conditions, 827 events. 59/827 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4471 event pairs, 38 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 909. Up to 97 conditions per place. [2022-11-16 11:35:49,677 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2022-11-16 11:35:49,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 221 transitions, 484 flow [2022-11-16 11:35:49,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2022-11-16 11:35:49,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2022-11-16 11:35:49,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2022-11-16 11:35:49,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2022-11-16 11:35:49,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:49,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2022-11-16 11:35:49,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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:35:49,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:49,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:49,690 INFO L175 Difference]: Start difference. First operand has 227 places, 222 transitions, 454 flow. Second operand 3 states and 704 transitions. [2022-11-16 11:35:49,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 221 transitions, 484 flow [2022-11-16 11:35:49,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 221 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:35:49,702 INFO L231 Difference]: Finished difference. Result has 224 places, 221 transitions, 452 flow [2022-11-16 11:35:49,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=224, PETRI_TRANSITIONS=221} [2022-11-16 11:35:49,704 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -31 predicate places. [2022-11-16 11:35:49,705 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 221 transitions, 452 flow [2022-11-16 11:35:49,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:49,706 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:49,706 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] [2022-11-16 11:35:49,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:35:49,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:49,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:49,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1793036583, now seen corresponding path program 1 times [2022-11-16 11:35:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:49,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535421507] [2022-11-16 11:35:49,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:49,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:49,829 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:35:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:49,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535421507] [2022-11-16 11:35:49,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535421507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:49,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:49,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547792852] [2022-11-16 11:35:49,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:49,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:49,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:49,834 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-16 11:35:49,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 221 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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:35:49,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:49,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-16 11:35:49,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:50,055 INFO L130 PetriNetUnfolder]: 59/826 cut-off events. [2022-11-16 11:35:50,055 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:35:50,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 945 conditions, 826 events. 59/826 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4472 event pairs, 38 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 905. Up to 100 conditions per place. [2022-11-16 11:35:50,063 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2022-11-16 11:35:50,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 220 transitions, 488 flow [2022-11-16 11:35:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2022-11-16 11:35:50,068 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8429951690821256 [2022-11-16 11:35:50,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 698 transitions. [2022-11-16 11:35:50,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 698 transitions. [2022-11-16 11:35:50,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:50,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 698 transitions. [2022-11-16 11:35:50,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 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:35:50,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:50,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:50,074 INFO L175 Difference]: Start difference. First operand has 224 places, 221 transitions, 452 flow. Second operand 3 states and 698 transitions. [2022-11-16 11:35:50,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 220 transitions, 488 flow [2022-11-16 11:35:50,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:35:50,079 INFO L231 Difference]: Finished difference. Result has 223 places, 220 transitions, 450 flow [2022-11-16 11:35:50,079 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=220} [2022-11-16 11:35:50,082 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -32 predicate places. [2022-11-16 11:35:50,082 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 220 transitions, 450 flow [2022-11-16 11:35:50,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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:35:50,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:50,083 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] [2022-11-16 11:35:50,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:35:50,083 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:50,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1175633459, now seen corresponding path program 1 times [2022-11-16 11:35:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:50,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283699418] [2022-11-16 11:35:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:50,176 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:35:50,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:50,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283699418] [2022-11-16 11:35:50,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283699418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:50,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:50,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:50,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914036600] [2022-11-16 11:35:50,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:50,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:50,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:50,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 276 [2022-11-16 11:35:50,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 220 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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:35:50,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:50,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 276 [2022-11-16 11:35:50,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:50,444 INFO L130 PetriNetUnfolder]: 215/981 cut-off events. [2022-11-16 11:35:50,444 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-16 11:35:50,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 981 events. 215/981 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5703 event pairs, 146 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1287. Up to 334 conditions per place. [2022-11-16 11:35:50,455 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 23 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2022-11-16 11:35:50,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 219 transitions, 498 flow [2022-11-16 11:35:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2022-11-16 11:35:50,459 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2022-11-16 11:35:50,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2022-11-16 11:35:50,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2022-11-16 11:35:50,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:50,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2022-11-16 11:35:50,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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:35:50,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:50,469 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:50,470 INFO L175 Difference]: Start difference. First operand has 223 places, 220 transitions, 450 flow. Second operand 3 states and 686 transitions. [2022-11-16 11:35:50,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 219 transitions, 498 flow [2022-11-16 11:35:50,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:35:50,479 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 448 flow [2022-11-16 11:35:50,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2022-11-16 11:35:50,481 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -33 predicate places. [2022-11-16 11:35:50,482 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 448 flow [2022-11-16 11:35:50,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 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:35:50,483 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:50,483 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] [2022-11-16 11:35:50,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:35:50,483 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:50,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:50,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1678395873, now seen corresponding path program 1 times [2022-11-16 11:35:50,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:50,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833043715] [2022-11-16 11:35:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:50,569 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:35:50,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:50,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833043715] [2022-11-16 11:35:50,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833043715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:50,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:50,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356169647] [2022-11-16 11:35:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:50,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:50,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:50,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:50,574 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-16 11:35:50,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:35:50,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:50,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-16 11:35:50,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:50,773 INFO L130 PetriNetUnfolder]: 163/902 cut-off events. [2022-11-16 11:35:50,773 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-16 11:35:50,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 902 events. 163/902 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5123 event pairs, 110 based on Foata normal form. 0/779 useless extension candidates. Maximal degree in co-relation 1118. Up to 251 conditions per place. [2022-11-16 11:35:50,781 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 18 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2022-11-16 11:35:50,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 216 transitions, 480 flow [2022-11-16 11:35:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2022-11-16 11:35:50,784 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2022-11-16 11:35:50,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2022-11-16 11:35:50,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2022-11-16 11:35:50,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:50,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2022-11-16 11:35:50,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:50,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:50,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:50,790 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 448 flow. Second operand 3 states and 691 transitions. [2022-11-16 11:35:50,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 216 transitions, 480 flow [2022-11-16 11:35:50,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:35:50,794 INFO L231 Difference]: Finished difference. Result has 219 places, 216 transitions, 440 flow [2022-11-16 11:35:50,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=219, PETRI_TRANSITIONS=216} [2022-11-16 11:35:50,798 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -36 predicate places. [2022-11-16 11:35:50,799 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 216 transitions, 440 flow [2022-11-16 11:35:50,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:35:50,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:50,800 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] [2022-11-16 11:35:50,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:35:50,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1585547056, now seen corresponding path program 1 times [2022-11-16 11:35:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:50,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250485572] [2022-11-16 11:35:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:50,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:50,869 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:35:50,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:50,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250485572] [2022-11-16 11:35:50,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250485572] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:50,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:50,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956751180] [2022-11-16 11:35:50,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:50,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:50,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:50,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:50,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:50,876 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-16 11:35:50,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 216 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:50,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:50,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-16 11:35:50,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:51,042 INFO L130 PetriNetUnfolder]: 59/797 cut-off events. [2022-11-16 11:35:51,043 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:35:51,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 797 events. 59/797 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4224 event pairs, 38 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 858. Up to 97 conditions per place. [2022-11-16 11:35:51,050 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-16 11:35:51,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 470 flow [2022-11-16 11:35:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2022-11-16 11:35:51,053 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2022-11-16 11:35:51,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2022-11-16 11:35:51,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2022-11-16 11:35:51,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:51,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2022-11-16 11:35:51,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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:35:51,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:51,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:51,060 INFO L175 Difference]: Start difference. First operand has 219 places, 216 transitions, 440 flow. Second operand 3 states and 704 transitions. [2022-11-16 11:35:51,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 470 flow [2022-11-16 11:35:51,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:35:51,064 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 441 flow [2022-11-16 11:35:51,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2022-11-16 11:35:51,068 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -36 predicate places. [2022-11-16 11:35:51,068 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 441 flow [2022-11-16 11:35:51,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:51,069 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:51,070 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] [2022-11-16 11:35:51,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:35:51,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:51,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1018735170, now seen corresponding path program 1 times [2022-11-16 11:35:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:51,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150077674] [2022-11-16 11:35:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:51,147 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:35:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:51,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150077674] [2022-11-16 11:35:51,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150077674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:51,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:51,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733478774] [2022-11-16 11:35:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:51,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:51,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:51,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:51,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:51,158 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-16 11:35:51,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:51,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:51,161 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-16 11:35:51,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:51,325 INFO L130 PetriNetUnfolder]: 59/796 cut-off events. [2022-11-16 11:35:51,326 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-16 11:35:51,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 796 events. 59/796 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4223 event pairs, 38 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 857. Up to 95 conditions per place. [2022-11-16 11:35:51,334 INFO L137 encePairwiseOnDemand]: 274/276 looper letters, 14 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2022-11-16 11:35:51,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 214 transitions, 469 flow [2022-11-16 11:35:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2022-11-16 11:35:51,337 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8490338164251208 [2022-11-16 11:35:51,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 703 transitions. [2022-11-16 11:35:51,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 703 transitions. [2022-11-16 11:35:51,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:51,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 703 transitions. [2022-11-16 11:35:51,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 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:35:51,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:51,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:51,342 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 441 flow. Second operand 3 states and 703 transitions. [2022-11-16 11:35:51,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 214 transitions, 469 flow [2022-11-16 11:35:51,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:35:51,347 INFO L231 Difference]: Finished difference. Result has 218 places, 214 transitions, 437 flow [2022-11-16 11:35:51,347 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=218, PETRI_TRANSITIONS=214} [2022-11-16 11:35:51,348 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -37 predicate places. [2022-11-16 11:35:51,348 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 214 transitions, 437 flow [2022-11-16 11:35:51,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:35:51,349 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:51,349 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] [2022-11-16 11:35:51,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:35:51,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:51,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:51,350 INFO L85 PathProgramCache]: Analyzing trace with hash 595930173, now seen corresponding path program 1 times [2022-11-16 11:35:51,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:51,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669925331] [2022-11-16 11:35:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:51,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:51,426 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:35:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:51,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669925331] [2022-11-16 11:35:51,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669925331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:51,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:51,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141318444] [2022-11-16 11:35:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:51,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:51,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:51,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:51,430 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-16 11:35:51,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 214 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:35:51,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:51,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-16 11:35:51,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:51,658 INFO L130 PetriNetUnfolder]: 215/951 cut-off events. [2022-11-16 11:35:51,659 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-16 11:35:51,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1301 conditions, 951 events. 215/951 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5347 event pairs, 146 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 1247. Up to 331 conditions per place. [2022-11-16 11:35:51,668 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 20 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2022-11-16 11:35:51,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 479 flow [2022-11-16 11:35:51,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:51,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2022-11-16 11:35:51,670 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8357487922705314 [2022-11-16 11:35:51,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 692 transitions. [2022-11-16 11:35:51,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 692 transitions. [2022-11-16 11:35:51,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:51,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 692 transitions. [2022-11-16 11:35:51,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 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:35:51,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:51,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:51,682 INFO L175 Difference]: Start difference. First operand has 218 places, 214 transitions, 437 flow. Second operand 3 states and 692 transitions. [2022-11-16 11:35:51,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 479 flow [2022-11-16 11:35:51,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 11:35:51,687 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 438 flow [2022-11-16 11:35:51,687 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2022-11-16 11:35:51,689 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -37 predicate places. [2022-11-16 11:35:51,690 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 438 flow [2022-11-16 11:35:51,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 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:35:51,690 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:51,690 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] [2022-11-16 11:35:51,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:35:51,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1903309374, now seen corresponding path program 1 times [2022-11-16 11:35:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:51,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244386014] [2022-11-16 11:35:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:52,267 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:35:52,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:52,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244386014] [2022-11-16 11:35:52,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244386014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:52,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:52,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:35:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700925629] [2022-11-16 11:35:52,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:52,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:35:52,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:52,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:35:52,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:35:52,272 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2022-11-16 11:35:52,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 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:35:52,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:52,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2022-11-16 11:35:52,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:53,824 INFO L130 PetriNetUnfolder]: 3233/6048 cut-off events. [2022-11-16 11:35:53,824 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-16 11:35:53,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10599 conditions, 6048 events. 3233/6048 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 43423 event pairs, 2444 based on Foata normal form. 0/5384 useless extension candidates. Maximal degree in co-relation 10546. Up to 4527 conditions per place. [2022-11-16 11:35:53,896 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 52 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2022-11-16 11:35:53,897 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 212 transitions, 550 flow [2022-11-16 11:35:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:35:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:35:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2022-11-16 11:35:53,901 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.716183574879227 [2022-11-16 11:35:53,902 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1186 transitions. [2022-11-16 11:35:53,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1186 transitions. [2022-11-16 11:35:53,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:53,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1186 transitions. [2022-11-16 11:35:53,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 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:35:53,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:35:53,912 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:35:53,912 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 438 flow. Second operand 6 states and 1186 transitions. [2022-11-16 11:35:53,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 212 transitions, 550 flow [2022-11-16 11:35:53,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 212 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:35:53,918 INFO L231 Difference]: Finished difference. Result has 220 places, 212 transitions, 442 flow [2022-11-16 11:35:53,919 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=220, PETRI_TRANSITIONS=212} [2022-11-16 11:35:53,920 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -35 predicate places. [2022-11-16 11:35:53,920 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 212 transitions, 442 flow [2022-11-16 11:35:53,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 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:35:53,921 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:53,921 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] [2022-11-16 11:35:53,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:35:53,922 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:53,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1298298302, now seen corresponding path program 1 times [2022-11-16 11:35:53,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:53,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021447680] [2022-11-16 11:35:53,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:53,976 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:35:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:53,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021447680] [2022-11-16 11:35:53,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021447680] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:53,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:53,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:53,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560759207] [2022-11-16 11:35:53,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:53,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:53,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:53,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:53,981 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-16 11:35:53,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 212 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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:35:53,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:53,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-16 11:35:53,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:54,137 INFO L130 PetriNetUnfolder]: 148/591 cut-off events. [2022-11-16 11:35:54,137 INFO L131 PetriNetUnfolder]: For 13/37 co-relation queries the response was YES. [2022-11-16 11:35:54,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874 conditions, 591 events. 148/591 cut-off events. For 13/37 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2775 event pairs, 44 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 856. Up to 236 conditions per place. [2022-11-16 11:35:54,143 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 20 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-16 11:35:54,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 494 flow [2022-11-16 11:35:54,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:54,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-11-16 11:35:54,146 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-11-16 11:35:54,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-11-16 11:35:54,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-11-16 11:35:54,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:54,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-11-16 11:35:54,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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:35:54,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:54,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:54,152 INFO L175 Difference]: Start difference. First operand has 220 places, 212 transitions, 442 flow. Second operand 3 states and 702 transitions. [2022-11-16 11:35:54,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 494 flow [2022-11-16 11:35:54,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 484 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 11:35:54,158 INFO L231 Difference]: Finished difference. Result has 216 places, 212 transitions, 442 flow [2022-11-16 11:35:54,159 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=216, PETRI_TRANSITIONS=212} [2022-11-16 11:35:54,160 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -39 predicate places. [2022-11-16 11:35:54,160 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 212 transitions, 442 flow [2022-11-16 11:35:54,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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:35:54,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:54,161 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] [2022-11-16 11:35:54,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:35:54,161 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:54,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -402460687, now seen corresponding path program 1 times [2022-11-16 11:35:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:54,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523318994] [2022-11-16 11:35:54,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:54,224 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:35:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:54,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523318994] [2022-11-16 11:35:54,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523318994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:54,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:54,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:35:54,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136418667] [2022-11-16 11:35:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:54,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:35:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:54,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:35:54,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:35:54,229 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-16 11:35:54,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 212 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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:35:54,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:54,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-16 11:35:54,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:54,540 INFO L130 PetriNetUnfolder]: 191/1000 cut-off events. [2022-11-16 11:35:54,541 INFO L131 PetriNetUnfolder]: For 25/37 co-relation queries the response was YES. [2022-11-16 11:35:54,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 1000 events. 191/1000 cut-off events. For 25/37 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5956 event pairs, 38 based on Foata normal form. 1/905 useless extension candidates. Maximal degree in co-relation 1272. Up to 252 conditions per place. [2022-11-16 11:35:54,549 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 22 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2022-11-16 11:35:54,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 506 flow [2022-11-16 11:35:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:35:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:35:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-16 11:35:54,552 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2022-11-16 11:35:54,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-16 11:35:54,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-16 11:35:54,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:54,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-16 11:35:54,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 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:35:54,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:54,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:35:54,558 INFO L175 Difference]: Start difference. First operand has 216 places, 212 transitions, 442 flow. Second operand 3 states and 705 transitions. [2022-11-16 11:35:54,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 506 flow [2022-11-16 11:35:54,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 218 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:35:54,562 INFO L231 Difference]: Finished difference. Result has 217 places, 213 transitions, 459 flow [2022-11-16 11:35:54,563 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=217, PETRI_TRANSITIONS=213} [2022-11-16 11:35:54,564 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -38 predicate places. [2022-11-16 11:35:54,564 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 459 flow [2022-11-16 11:35:54,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 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:35:54,565 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:54,565 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] [2022-11-16 11:35:54,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:35:54,565 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1400055835, now seen corresponding path program 1 times [2022-11-16 11:35:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:54,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898286550] [2022-11-16 11:35:54,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:54,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:55,062 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:35:55,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:55,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898286550] [2022-11-16 11:35:55,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898286550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:55,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:55,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:35:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053279167] [2022-11-16 11:35:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:55,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:35:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:35:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:35:55,067 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-16 11:35:55,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 213 transitions, 459 flow. Second operand has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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:35:55,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:55,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-16 11:35:55,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:55,796 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][172], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, 332#(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: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 126#L60true, 264#L105-3true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:55,796 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-16 11:35:55,797 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-16 11:35:55,797 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-16 11:35:55,797 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-16 11:35:55,798 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][163], [326#(= |#race~queue~0| 0), 38#L105-2true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 126#L60true, 331#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:55,798 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is cut-off event [2022-11-16 11:35:55,798 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-16 11:35:55,799 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-16 11:35:55,799 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:35:55,800 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][182], [326#(= |#race~queue~0| 0), 170#L105-4true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 126#L60true, 333#(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)), 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:55,800 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-16 11:35:55,801 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-16 11:35:55,801 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-16 11:35:55,801 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 11:35:55,814 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 223#L105-5true, 126#L60true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:55,814 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-16 11:35:55,815 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:35:55,815 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-16 11:35:55,815 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-16 11:35:55,865 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), 9#L105-6true, Black: 319#true, 298#(= |#race~start~0| 0), 334#(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)), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 126#L60true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:55,865 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-16 11:35:55,866 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 11:35:55,866 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:35:55,866 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 11:35:56,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 334#(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)), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 252#L105-7true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:56,029 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-16 11:35:56,029 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:35:56,029 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:56,029 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:35:56,250 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 54#L106-2true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:56,250 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-16 11:35:56,251 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:35:56,251 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 11:35:56,251 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:35:56,296 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 7#L106-3true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:56,296 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-16 11:35:56,297 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:35:56,297 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:35:56,297 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 11:35:56,343 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), Black: 319#true, 124#L106-4true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:56,344 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-16 11:35:56,344 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 11:35:56,344 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:35:56,344 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 11:35:56,394 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 131#L106-5true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:56,394 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-16 11:35:56,394 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 11:35:56,395 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 11:35:56,395 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 11:35:56,435 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 50#L106-6true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:56,435 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 11:35:56,435 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:56,435 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:56,436 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:35:56,437 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][191], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 334#(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)), 231#L86true, Black: 324#true, 160#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:56,437 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 11:35:56,437 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:56,438 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:35:56,438 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:57,042 INFO L130 PetriNetUnfolder]: 3989/6364 cut-off events. [2022-11-16 11:35:57,042 INFO L131 PetriNetUnfolder]: For 1397/1438 co-relation queries the response was YES. [2022-11-16 11:35:57,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13489 conditions, 6364 events. 3989/6364 cut-off events. For 1397/1438 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 42868 event pairs, 394 based on Foata normal form. 0/5753 useless extension candidates. Maximal degree in co-relation 13433. Up to 2515 conditions per place. [2022-11-16 11:35:57,115 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 123 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2022-11-16 11:35:57,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 288 transitions, 903 flow [2022-11-16 11:35:57,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:35:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:35:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1276 transitions. [2022-11-16 11:35:57,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7705314009661836 [2022-11-16 11:35:57,121 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1276 transitions. [2022-11-16 11:35:57,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1276 transitions. [2022-11-16 11:35:57,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:57,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1276 transitions. [2022-11-16 11:35:57,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 212.66666666666666) internal successors, (1276), 6 states have internal predecessors, (1276), 0 states have call successors, (0), 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:35:57,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:35:57,131 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:35:57,131 INFO L175 Difference]: Start difference. First operand has 217 places, 213 transitions, 459 flow. Second operand 6 states and 1276 transitions. [2022-11-16 11:35:57,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 288 transitions, 903 flow [2022-11-16 11:35:57,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 288 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 11:35:57,141 INFO L231 Difference]: Finished difference. Result has 221 places, 212 transitions, 465 flow [2022-11-16 11:35:57,142 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=221, PETRI_TRANSITIONS=212} [2022-11-16 11:35:57,143 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-16 11:35:57,143 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 212 transitions, 465 flow [2022-11-16 11:35:57,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 0 states have call successors, (0), 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:35:57,146 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:57,146 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] [2022-11-16 11:35:57,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:35:57,146 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:57,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:57,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1363169815, now seen corresponding path program 1 times [2022-11-16 11:35:57,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:57,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881862768] [2022-11-16 11:35:57,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:35:57,799 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:35:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:35:57,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881862768] [2022-11-16 11:35:57,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881862768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:35:57,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:35:57,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:35:57,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909863185] [2022-11-16 11:35:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:35:57,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:35:57,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:35:57,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:35:57,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:35:57,804 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 276 [2022-11-16 11:35:57,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 212 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 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:35:57,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:35:57,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 276 [2022-11-16 11:35:57,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:35:58,569 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 170#L105-4true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 126#L60true, 333#(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)), 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:58,569 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-16 11:35:58,569 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-16 11:35:58,569 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 11:35:58,570 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-16 11:35:58,571 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, 332#(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: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 126#L60true, 264#L105-3true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:58,571 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-16 11:35:58,571 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-16 11:35:58,571 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-16 11:35:58,572 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-16 11:35:58,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 223#L105-5true, 126#L60true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:58,574 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-16 11:35:58,574 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:35:58,574 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-16 11:35:58,574 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-16 11:35:58,588 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, 9#L105-6true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 126#L60true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:58,589 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-16 11:35:58,589 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 11:35:58,589 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 11:35:58,589 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:35:58,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 252#L105-7true, 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:58,723 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-16 11:35:58,723 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:35:58,723 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:58,724 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:35:58,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 54#L106-2true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:58,882 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-16 11:35:58,882 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 11:35:58,882 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:35:58,882 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:35:58,936 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 7#L106-3true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:58,936 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-16 11:35:58,936 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:35:58,936 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:35:58,937 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 11:35:58,994 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, 124#L106-4true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:58,994 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-16 11:35:58,994 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:35:58,995 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 11:35:58,995 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 11:35:59,050 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 131#L106-5true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:59,051 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-16 11:35:59,051 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 11:35:59,051 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 11:35:59,051 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 11:35:59,101 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 50#L106-6true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:59,101 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 11:35:59,101 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:59,101 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:59,102 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:35:59,103 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 160#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:35:59,104 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 11:35:59,104 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:59,104 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:35:59,108 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:35:59,840 INFO L130 PetriNetUnfolder]: 3758/6946 cut-off events. [2022-11-16 11:35:59,840 INFO L131 PetriNetUnfolder]: For 1955/1991 co-relation queries the response was YES. [2022-11-16 11:35:59,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14345 conditions, 6946 events. 3758/6946 cut-off events. For 1955/1991 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 51187 event pairs, 485 based on Foata normal form. 0/6336 useless extension candidates. Maximal degree in co-relation 14287. Up to 3034 conditions per place. [2022-11-16 11:35:59,906 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 141 selfloop transitions, 4 changer transitions 0/303 dead transitions. [2022-11-16 11:35:59,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 303 transitions, 993 flow [2022-11-16 11:35:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:35:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:35:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1296 transitions. [2022-11-16 11:35:59,911 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2022-11-16 11:35:59,911 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1296 transitions. [2022-11-16 11:35:59,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1296 transitions. [2022-11-16 11:35:59,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:35:59,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1296 transitions. [2022-11-16 11:35:59,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 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:35:59,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:35:59,920 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:35:59,921 INFO L175 Difference]: Start difference. First operand has 221 places, 212 transitions, 465 flow. Second operand 6 states and 1296 transitions. [2022-11-16 11:35:59,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 303 transitions, 993 flow [2022-11-16 11:35:59,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 303 transitions, 958 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:35:59,931 INFO L231 Difference]: Finished difference. Result has 221 places, 211 transitions, 464 flow [2022-11-16 11:35:59,932 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=221, PETRI_TRANSITIONS=211} [2022-11-16 11:35:59,933 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-16 11:35:59,933 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 211 transitions, 464 flow [2022-11-16 11:35:59,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 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:35:59,934 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:35:59,934 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] [2022-11-16 11:35:59,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:35:59,935 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:35:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:35:59,935 INFO L85 PathProgramCache]: Analyzing trace with hash 661821471, now seen corresponding path program 1 times [2022-11-16 11:35:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:35:59,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577602337] [2022-11-16 11:35:59,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:35:59,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:35:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:00,501 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:36:00,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:00,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577602337] [2022-11-16 11:36:00,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577602337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:00,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:00,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:36:00,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87687958] [2022-11-16 11:36:00,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:00,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:36:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:00,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:36:00,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:36:00,508 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 276 [2022-11-16 11:36:00,519 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 211 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 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:36:00,519 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:00,519 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 276 [2022-11-16 11:36:00,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:01,105 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 223#L105-5true, 126#L60true]) [2022-11-16 11:36:01,105 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-16 11:36:01,105 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:36:01,105 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-16 11:36:01,106 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-16 11:36:01,108 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 126#L60true, 264#L105-3true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:36:01,108 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-16 11:36:01,108 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-16 11:36:01,108 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-16 11:36:01,109 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-16 11:36:01,109 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 126#L60true, 343#true, 306#(= |#race~n~0| 0), 333#(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))]) [2022-11-16 11:36:01,110 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-16 11:36:01,110 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-16 11:36:01,110 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-16 11:36:01,110 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-16 11:36:01,116 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, 9#L105-6true, Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 126#L60true]) [2022-11-16 11:36:01,116 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-16 11:36:01,116 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 11:36:01,117 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:36:01,117 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-16 11:36:01,246 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 252#L105-7true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:36:01,247 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-16 11:36:01,247 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:36:01,247 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:36:01,247 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-16 11:36:01,446 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 54#L106-2true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:36:01,446 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-16 11:36:01,447 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:36:01,447 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 11:36:01,447 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-16 11:36:01,489 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 7#L106-3true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:36:01,490 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-16 11:36:01,490 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 11:36:01,490 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:36:01,490 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-16 11:36:01,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 124#L106-4true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:36:01,535 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-16 11:36:01,535 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 11:36:01,536 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-16 11:36:01,536 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-16 11:36:01,578 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 131#L106-5true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:36:01,578 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-16 11:36:01,579 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-16 11:36:01,579 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 11:36:01,579 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-16 11:36:01,613 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 50#L106-6true, 215#L76true, 321#(= |#race~A~0| 0), 343#true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:36:01,613 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 11:36:01,613 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:36:01,613 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:36:01,613 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:36:01,615 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 334#(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)), 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 160#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-16 11:36:01,615 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-16 11:36:01,615 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:36:01,615 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-16 11:36:01,615 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:36:02,240 INFO L130 PetriNetUnfolder]: 3515/6545 cut-off events. [2022-11-16 11:36:02,240 INFO L131 PetriNetUnfolder]: For 1432/1468 co-relation queries the response was YES. [2022-11-16 11:36:02,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13391 conditions, 6545 events. 3515/6545 cut-off events. For 1432/1468 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 47320 event pairs, 1355 based on Foata normal form. 0/6042 useless extension candidates. Maximal degree in co-relation 13333. Up to 3211 conditions per place. [2022-11-16 11:36:02,304 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 140 selfloop transitions, 4 changer transitions 0/302 dead transitions. [2022-11-16 11:36:02,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 302 transitions, 962 flow [2022-11-16 11:36:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:36:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:36:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2022-11-16 11:36:02,308 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7820048309178744 [2022-11-16 11:36:02,309 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1295 transitions. [2022-11-16 11:36:02,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1295 transitions. [2022-11-16 11:36:02,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:02,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1295 transitions. [2022-11-16 11:36:02,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 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:36:02,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:36:02,318 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:36:02,318 INFO L175 Difference]: Start difference. First operand has 221 places, 211 transitions, 464 flow. Second operand 6 states and 1295 transitions. [2022-11-16 11:36:02,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 302 transitions, 962 flow [2022-11-16 11:36:02,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 302 transitions, 955 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:36:02,327 INFO L231 Difference]: Finished difference. Result has 221 places, 210 transitions, 463 flow [2022-11-16 11:36:02,327 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=221, PETRI_TRANSITIONS=210} [2022-11-16 11:36:02,328 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-16 11:36:02,328 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 210 transitions, 463 flow [2022-11-16 11:36:02,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.5) internal successors, (1173), 6 states have internal predecessors, (1173), 0 states have call successors, (0), 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:36:02,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:02,330 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] [2022-11-16 11:36:02,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:36:02,331 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:36:02,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1240852725, now seen corresponding path program 1 times [2022-11-16 11:36:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:02,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701015734] [2022-11-16 11:36:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:02,628 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:36:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:02,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701015734] [2022-11-16 11:36:02,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701015734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:02,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:02,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:36:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508802603] [2022-11-16 11:36:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:02,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:36:02,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:02,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:36:02,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:36:02,633 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 276 [2022-11-16 11:36:02,634 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 210 transitions, 463 flow. Second operand has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 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:36:02,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:02,635 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 276 [2022-11-16 11:36:02,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:02,890 INFO L130 PetriNetUnfolder]: 103/966 cut-off events. [2022-11-16 11:36:02,891 INFO L131 PetriNetUnfolder]: For 68/74 co-relation queries the response was YES. [2022-11-16 11:36:02,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 966 events. 103/966 cut-off events. For 68/74 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5274 event pairs, 48 based on Foata normal form. 18/925 useless extension candidates. Maximal degree in co-relation 1308. Up to 135 conditions per place. [2022-11-16 11:36:02,899 INFO L137 encePairwiseOnDemand]: 266/276 looper letters, 35 selfloop transitions, 6 changer transitions 6/225 dead transitions. [2022-11-16 11:36:02,899 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 590 flow [2022-11-16 11:36:02,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:36:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 11:36:02,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1553 transitions. [2022-11-16 11:36:02,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8038302277432712 [2022-11-16 11:36:02,905 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1553 transitions. [2022-11-16 11:36:02,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1553 transitions. [2022-11-16 11:36:02,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:02,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1553 transitions. [2022-11-16 11:36:02,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.85714285714286) internal successors, (1553), 7 states have internal predecessors, (1553), 0 states have call successors, (0), 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:36:02,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 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:36:02,913 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 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:36:02,914 INFO L175 Difference]: Start difference. First operand has 221 places, 210 transitions, 463 flow. Second operand 7 states and 1553 transitions. [2022-11-16 11:36:02,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 590 flow [2022-11-16 11:36:02,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 225 transitions, 583 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:36:02,919 INFO L231 Difference]: Finished difference. Result has 225 places, 211 transitions, 482 flow [2022-11-16 11:36:02,920 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=482, PETRI_PLACES=225, PETRI_TRANSITIONS=211} [2022-11-16 11:36:02,920 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -30 predicate places. [2022-11-16 11:36:02,921 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 211 transitions, 482 flow [2022-11-16 11:36:02,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.5) internal successors, (1305), 6 states have internal predecessors, (1305), 0 states have call successors, (0), 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:36:02,922 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:02,922 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] [2022-11-16 11:36:02,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:36:02,923 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:36:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1731398901, now seen corresponding path program 1 times [2022-11-16 11:36:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579295170] [2022-11-16 11:36:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:36:03,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:03,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579295170] [2022-11-16 11:36:03,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579295170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:03,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:03,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:36:03,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251575060] [2022-11-16 11:36:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:03,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:36:03,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:03,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:36:03,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:36:03,600 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-16 11:36:03,602 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 211 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 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:36:03,602 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:03,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-16 11:36:03,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:04,205 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0), 365#true, 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 126#L60true, 333#(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))]) [2022-11-16 11:36:04,205 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-16 11:36:04,205 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 11:36:04,205 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-16 11:36:04,205 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-16 11:36:04,206 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 365#true, 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 126#L60true, 223#L105-5true]) [2022-11-16 11:36:04,206 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-16 11:36:04,207 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-16 11:36:04,207 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 11:36:04,207 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-16 11:36:04,209 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 365#true, 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 126#L60true, 264#L105-3true]) [2022-11-16 11:36:04,209 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-16 11:36:04,209 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-16 11:36:04,209 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-16 11:36:04,209 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-16 11:36:04,222 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), 9#L105-6true, Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 215#L76true, Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 306#(= |#race~n~0| 0), 365#true, 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 126#L60true]) [2022-11-16 11:36:04,222 INFO L383 tUnfolder$Statistics]: this new event has 147 ancestors and is cut-off event [2022-11-16 11:36:04,223 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-16 11:36:04,223 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 11:36:04,223 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-16 11:36:04,354 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 252#L105-7true, 306#(= |#race~n~0| 0), 365#true, 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-16 11:36:04,355 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-16 11:36:04,355 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 11:36:04,355 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:36:04,355 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-16 11:36:04,483 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][150], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 215#L76true, Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 306#(= |#race~n~0| 0), 365#true, 334#(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)), 231#L86true, 103#L106-1true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-16 11:36:04,484 INFO L383 tUnfolder$Statistics]: this new event has 152 ancestors and is cut-off event [2022-11-16 11:36:04,484 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 11:36:04,484 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-16 11:36:04,484 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-16 11:36:04,541 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][183], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 54#L106-2true, 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 367#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-16 11:36:04,541 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is cut-off event [2022-11-16 11:36:04,541 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-16 11:36:04,542 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-16 11:36:04,542 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-16 11:36:04,592 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][189], [326#(= |#race~queue~0| 0), 368#(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: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 7#L106-3true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-16 11:36:04,592 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-16 11:36:04,592 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-16 11:36:04,593 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-16 11:36:04,593 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-16 11:36:04,644 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][195], [326#(= |#race~queue~0| 0), 369#(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)), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 306#(= |#race~n~0| 0), 124#L106-4true, 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-16 11:36:04,644 INFO L383 tUnfolder$Statistics]: this new event has 155 ancestors and is cut-off event [2022-11-16 11:36:04,644 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-16 11:36:04,644 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 11:36:04,644 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-16 11:36:04,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][201], [326#(= |#race~queue~0| 0), Black: 319#true, 370#(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|)))), 298#(= |#race~start~0| 0), Black: 324#true, 131#L106-5true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 321#(= |#race~A~0| 0), 215#L76true, Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-16 11:36:04,702 INFO L383 tUnfolder$Statistics]: this new event has 156 ancestors and is cut-off event [2022-11-16 11:36:04,702 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 11:36:04,702 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-16 11:36:04,703 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-16 11:36:04,746 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L67-8-->L76: Formula: (let ((.cse9 (* v_~end~0_195 4))) (let ((.cse1 (+ .cse9 v_~queue~0.offset_99 1)) (.cse3 (+ 3 .cse9 v_~queue~0.offset_99)) (.cse2 (+ 2 .cse9 v_~queue~0.offset_99)) (.cse7 (not |v_thread2_#t~short7#1_130|)) (.cse4 (select |v_#race_219| v_~queue~0.base_99)) (.cse0 (+ .cse9 v_~queue~0.offset_99))) (and (= |v_#race_219| (store |v_#race_220| v_~queue~0.base_99 (store (store (store (store (select |v_#race_220| v_~queue~0.base_99) .cse0 0) .cse1 0) .cse2 0) .cse3 0))) (= |v_#race~queue~0_84| 0) (= (select .cse4 .cse1) 0) (let ((.cse6 (= |v_#race~end~0_289| 0))) (or (and (let ((.cse5 (< v_~end~0_195 v_~n~0_51))) (or (and .cse5 |v_thread2_#t~short7#1_129|) (and (not |v_thread2_#t~short7#1_129|) (not .cse5)))) .cse6 (= |v_#race~n~0_104| 0) |v_thread2_#t~short7#1_130|) (and (= |v_thread2_#t~short7#1_129| |v_thread2_#t~short7#1_130|) (= |v_#race~n~0_105| |v_#race~n~0_104|) .cse7 .cse6))) (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11| 0)) (= (select .cse4 .cse3) 0) (= v_~end~0_194 (+ v_~end~0_195 1)) (= (select .cse4 .cse2) 0) (let ((.cse8 (<= 0 v_~end~0_195))) (or (and .cse8 |v_thread2_#t~short7#1_130|) (and .cse7 (not .cse8)))) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| (ite (= (mod (select (select |v_#memory_int_62| v_~queue~0.base_99) .cse0) 4294967296) (mod |v_thread2Thread1of1ForFork2_~x~1#1_3| 4294967296)) 1 0)) (= (select .cse4 .cse0) 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|) (not (= (ite |v_thread2_#t~short7#1_129| 1 0) 0))))) InVars {#race=|v_#race_220|, #race~n~0=|v_#race~n~0_105|, ~queue~0.offset=v_~queue~0.offset_99, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_195, ~queue~0.base=v_~queue~0.base_99, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} OutVars{#race=|v_#race_219|, thread2Thread1of1ForFork2_#t~mem8#1=|v_thread2Thread1of1ForFork2_#t~mem8#1_7|, ~queue~0.offset=v_~queue~0.offset_99, #race~queue~0=|v_#race~queue~0_84|, thread2Thread1of1ForFork2_#t~short7#1=|v_thread2Thread1of1ForFork2_#t~short7#1_15|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_11|, ~queue~0.base=v_~queue~0.base_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_3|, #race~n~0=|v_#race~n~0_104|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_11|, #race~end~0=|v_#race~end~0_263|, thread2Thread1of1ForFork2_#t~nondet10#1=|v_thread2Thread1of1ForFork2_#t~nondet10#1_3|, #memory_int=|v_#memory_int_62|, ~end~0=v_~end~0_194, ~n~0=v_~n~0_51, thread2Thread1of1ForFork2_~x~1#1=|v_thread2Thread1of1ForFork2_~x~1#1_3|} AuxVars[|v_thread2_#t~short7#1_130|, |v_thread2_#t~short7#1_129|, |v_#race~end~0_289|] AssignedVars[#race, thread2Thread1of1ForFork2_#t~mem8#1, #race~n~0, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~queue~0, #race~end~0, thread2Thread1of1ForFork2_#t~short7#1, thread2Thread1of1ForFork2_#t~nondet10#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~end~0, thread2Thread1of1ForFork2_#t~post9#1][201], [326#(= |#race~queue~0| 0), Black: 319#true, 370#(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|)))), 298#(= |#race~start~0| 0), Black: 324#true, 50#L106-6true, Black: 361#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 0) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 215#L76true, 321#(= |#race~A~0| 0), Black: 359#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~2#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 306#(= |#race~n~0| 0), 334#(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)), 231#L86true, 357#(and (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|))]) [2022-11-16 11:36:04,746 INFO L383 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-11-16 11:36:04,746 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 11:36:04,747 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-16 11:36:04,747 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-16 11:36:05,240 INFO L130 PetriNetUnfolder]: 3031/5729 cut-off events. [2022-11-16 11:36:05,240 INFO L131 PetriNetUnfolder]: For 1369/1445 co-relation queries the response was YES. [2022-11-16 11:36:05,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11748 conditions, 5729 events. 3031/5729 cut-off events. For 1369/1445 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 41227 event pairs, 1424 based on Foata normal form. 0/5305 useless extension candidates. Maximal degree in co-relation 11687. Up to 3409 conditions per place. [2022-11-16 11:36:05,312 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 96 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2022-11-16 11:36:05,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 262 transitions, 808 flow [2022-11-16 11:36:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:36:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:36:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-11-16 11:36:05,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7590579710144928 [2022-11-16 11:36:05,318 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-11-16 11:36:05,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-11-16 11:36:05,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:05,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-11-16 11:36:05,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 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:36:05,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:36:05,328 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:36:05,328 INFO L175 Difference]: Start difference. First operand has 225 places, 211 transitions, 482 flow. Second operand 6 states and 1257 transitions. [2022-11-16 11:36:05,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 262 transitions, 808 flow [2022-11-16 11:36:05,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 262 transitions, 798 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:36:05,336 INFO L231 Difference]: Finished difference. Result has 224 places, 210 transitions, 478 flow [2022-11-16 11:36:05,337 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=224, PETRI_TRANSITIONS=210} [2022-11-16 11:36:05,337 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -31 predicate places. [2022-11-16 11:36:05,338 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 210 transitions, 478 flow [2022-11-16 11:36:05,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 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:36:05,338 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:05,339 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] [2022-11-16 11:36:05,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:36:05,339 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:36:05,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:05,340 INFO L85 PathProgramCache]: Analyzing trace with hash 394142322, now seen corresponding path program 1 times [2022-11-16 11:36:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:05,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696990175] [2022-11-16 11:36:05,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:05,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:05,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:36:05,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:05,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696990175] [2022-11-16 11:36:05,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696990175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:05,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:05,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:36:05,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675456688] [2022-11-16 11:36:05,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:05,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:05,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:05,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:05,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:05,473 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 276 [2022-11-16 11:36:05,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 210 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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:36:05,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:05,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 276 [2022-11-16 11:36:05,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:05,753 INFO L130 PetriNetUnfolder]: 205/965 cut-off events. [2022-11-16 11:36:05,753 INFO L131 PetriNetUnfolder]: For 167/181 co-relation queries the response was YES. [2022-11-16 11:36:05,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 965 events. 205/965 cut-off events. For 167/181 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5412 event pairs, 69 based on Foata normal form. 0/920 useless extension candidates. Maximal degree in co-relation 1469. Up to 213 conditions per place. [2022-11-16 11:36:05,765 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 23 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-16 11:36:05,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 215 transitions, 544 flow [2022-11-16 11:36:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:05,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:36:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-16 11:36:05,769 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2022-11-16 11:36:05,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-16 11:36:05,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-16 11:36:05,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:05,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-16 11:36:05,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 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:36:05,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:36:05,775 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:36:05,775 INFO L175 Difference]: Start difference. First operand has 224 places, 210 transitions, 478 flow. Second operand 3 states and 705 transitions. [2022-11-16 11:36:05,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 215 transitions, 544 flow [2022-11-16 11:36:05,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 215 transitions, 537 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:36:05,781 INFO L231 Difference]: Finished difference. Result has 221 places, 209 transitions, 473 flow [2022-11-16 11:36:05,782 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=221, PETRI_TRANSITIONS=209} [2022-11-16 11:36:05,782 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-16 11:36:05,782 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 209 transitions, 473 flow [2022-11-16 11:36:05,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 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:36:05,783 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:05,783 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:36:05,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 11:36:05,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:36:05,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1136780416, now seen corresponding path program 1 times [2022-11-16 11:36:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:05,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248278804] [2022-11-16 11:36:05,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:06,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248278804] [2022-11-16 11:36:06,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248278804] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:36:06,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695572264] [2022-11-16 11:36:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:06,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:36:06,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:36:06,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:36:06,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:36:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:06,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:36:06,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:36:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:07,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:36:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:36:07,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695572264] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:36:07,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:36:07,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-16 11:36:07,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321889537] [2022-11-16 11:36:07,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:36:07,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:36:07,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:36:07,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:36:07,814 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 276 [2022-11-16 11:36:07,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 209 transitions, 473 flow. Second operand has 19 states, 19 states have (on average 209.8421052631579) internal successors, (3987), 19 states have internal predecessors, (3987), 0 states have call successors, (0), 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:36:07,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:07,819 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 276 [2022-11-16 11:36:07,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:08,395 INFO L130 PetriNetUnfolder]: 119/1030 cut-off events. [2022-11-16 11:36:08,396 INFO L131 PetriNetUnfolder]: For 155/183 co-relation queries the response was YES. [2022-11-16 11:36:08,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 1030 events. 119/1030 cut-off events. For 155/183 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5689 event pairs, 48 based on Foata normal form. 24/1011 useless extension candidates. Maximal degree in co-relation 1495. Up to 128 conditions per place. [2022-11-16 11:36:08,406 INFO L137 encePairwiseOnDemand]: 263/276 looper letters, 47 selfloop transitions, 11 changer transitions 13/240 dead transitions. [2022-11-16 11:36:08,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 240 transitions, 697 flow [2022-11-16 11:36:08,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:36:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-16 11:36:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2545 transitions. [2022-11-16 11:36:08,413 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7684178743961353 [2022-11-16 11:36:08,413 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2545 transitions. [2022-11-16 11:36:08,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2545 transitions. [2022-11-16 11:36:08,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:08,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2545 transitions. [2022-11-16 11:36:08,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 212.08333333333334) internal successors, (2545), 12 states have internal predecessors, (2545), 0 states have call successors, (0), 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:36:08,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 276.0) internal successors, (3588), 13 states have internal predecessors, (3588), 0 states have call successors, (0), 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:36:08,429 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 276.0) internal successors, (3588), 13 states have internal predecessors, (3588), 0 states have call successors, (0), 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:36:08,429 INFO L175 Difference]: Start difference. First operand has 221 places, 209 transitions, 473 flow. Second operand 12 states and 2545 transitions. [2022-11-16 11:36:08,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 240 transitions, 697 flow [2022-11-16 11:36:08,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 240 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:36:08,435 INFO L231 Difference]: Finished difference. Result has 236 places, 213 transitions, 532 flow [2022-11-16 11:36:08,436 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=532, PETRI_PLACES=236, PETRI_TRANSITIONS=213} [2022-11-16 11:36:08,436 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -19 predicate places. [2022-11-16 11:36:08,436 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 213 transitions, 532 flow [2022-11-16 11:36:08,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 209.8421052631579) internal successors, (3987), 19 states have internal predecessors, (3987), 0 states have call successors, (0), 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:36:08,438 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:08,439 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:08,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:36:08,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 11:36:08,646 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:36:08,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1024261430, now seen corresponding path program 2 times [2022-11-16 11:36:08,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:08,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718706660] [2022-11-16 11:36:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:08,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:36:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:09,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718706660] [2022-11-16 11:36:09,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718706660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:09,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:09,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:36:09,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370890396] [2022-11-16 11:36:09,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:09,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:36:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:36:09,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:36:09,328 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-16 11:36:09,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 213 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 198.16666666666666) internal successors, (1189), 6 states have internal predecessors, (1189), 0 states have call successors, (0), 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:36:09,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:09,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-16 11:36:09,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:10,685 INFO L130 PetriNetUnfolder]: 2179/4775 cut-off events. [2022-11-16 11:36:10,685 INFO L131 PetriNetUnfolder]: For 2594/2602 co-relation queries the response was YES. [2022-11-16 11:36:10,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10311 conditions, 4775 events. 2179/4775 cut-off events. For 2594/2602 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 38667 event pairs, 1692 based on Foata normal form. 0/4536 useless extension candidates. Maximal degree in co-relation 10244. Up to 3230 conditions per place. [2022-11-16 11:36:10,755 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 87 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-16 11:36:10,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 256 transitions, 832 flow [2022-11-16 11:36:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:36:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 11:36:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1248 transitions. [2022-11-16 11:36:10,759 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2022-11-16 11:36:10,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1248 transitions. [2022-11-16 11:36:10,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1248 transitions. [2022-11-16 11:36:10,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:10,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1248 transitions. [2022-11-16 11:36:10,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 0 states have call successors, (0), 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:36:10,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:36:10,768 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 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:36:10,768 INFO L175 Difference]: Start difference. First operand has 236 places, 213 transitions, 532 flow. Second operand 6 states and 1248 transitions. [2022-11-16 11:36:10,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 256 transitions, 832 flow [2022-11-16 11:36:10,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 256 transitions, 805 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-16 11:36:10,776 INFO L231 Difference]: Finished difference. Result has 233 places, 212 transitions, 519 flow [2022-11-16 11:36:10,778 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=233, PETRI_TRANSITIONS=212} [2022-11-16 11:36:10,779 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -22 predicate places. [2022-11-16 11:36:10,779 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 212 transitions, 519 flow [2022-11-16 11:36:10,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.16666666666666) internal successors, (1189), 6 states have internal predecessors, (1189), 0 states have call successors, (0), 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:36:10,780 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:36:10,780 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:10,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:36:10,781 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2022-11-16 11:36:10,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:36:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash 633517383, now seen corresponding path program 1 times [2022-11-16 11:36:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:36:10,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850485815] [2022-11-16 11:36:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:36:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:36:10,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:36:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 11:36:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:36:10,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850485815] [2022-11-16 11:36:10,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850485815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:36:10,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:36:10,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:36:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053117381] [2022-11-16 11:36:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:36:10,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:36:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:36:10,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:36:10,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:36:10,898 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-16 11:36:10,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 212 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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:36:10,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:36:10,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-16 11:36:10,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:36:11,133 INFO L130 PetriNetUnfolder]: 145/910 cut-off events. [2022-11-16 11:36:11,133 INFO L131 PetriNetUnfolder]: For 251/275 co-relation queries the response was YES. [2022-11-16 11:36:11,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 910 events. 145/910 cut-off events. For 251/275 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4908 event pairs, 69 based on Foata normal form. 1/874 useless extension candidates. Maximal degree in co-relation 1402. Up to 211 conditions per place. [2022-11-16 11:36:11,143 INFO L137 encePairwiseOnDemand]: 274/276 looper letters, 0 selfloop transitions, 0 changer transitions 211/211 dead transitions. [2022-11-16 11:36:11,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 211 transitions, 549 flow [2022-11-16 11:36:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:36:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:36:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-11-16 11:36:11,146 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-11-16 11:36:11,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-11-16 11:36:11,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-11-16 11:36:11,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:36:11,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-11-16 11:36:11,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 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:36:11,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:36:11,151 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 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:36:11,152 INFO L175 Difference]: Start difference. First operand has 233 places, 212 transitions, 519 flow. Second operand 3 states and 702 transitions. [2022-11-16 11:36:11,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 211 transitions, 549 flow [2022-11-16 11:36:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 211 transitions, 542 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 11:36:11,156 INFO L231 Difference]: Finished difference. Result has 230 places, 0 transitions, 0 flow [2022-11-16 11:36:11,157 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=230, PETRI_TRANSITIONS=0} [2022-11-16 11:36:11,157 INFO L288 CegarLoopForPetriNet]: 255 programPoint places, -25 predicate places. [2022-11-16 11:36:11,157 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 0 transitions, 0 flow [2022-11-16 11:36:11,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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:36:11,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2022-11-16 11:36:11,162 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2022-11-16 11:36:11,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2022-11-16 11:36:11,163 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2022-11-16 11:36:11,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2022-11-16 11:36:11,164 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2022-11-16 11:36:11,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2022-11-16 11:36:11,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2022-11-16 11:36:11,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2022-11-16 11:36:11,165 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2022-11-16 11:36:11,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2022-11-16 11:36:11,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2022-11-16 11:36:11,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2022-11-16 11:36:11,166 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2022-11-16 11:36:11,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2022-11-16 11:36:11,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2022-11-16 11:36:11,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2022-11-16 11:36:11,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2022-11-16 11:36:11,167 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2022-11-16 11:36:11,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2022-11-16 11:36:11,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2022-11-16 11:36:11,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2022-11-16 11:36:11,168 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2022-11-16 11:36:11,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2022-11-16 11:36:11,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2022-11-16 11:36:11,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2022-11-16 11:36:11,169 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2022-11-16 11:36:11,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2022-11-16 11:36:11,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2022-11-16 11:36:11,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2022-11-16 11:36:11,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2022-11-16 11:36:11,170 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2022-11-16 11:36:11,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2022-11-16 11:36:11,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2022-11-16 11:36:11,171 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2022-11-16 11:36:11,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2022-11-16 11:36:11,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2022-11-16 11:36:11,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2022-11-16 11:36:11,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2022-11-16 11:36:11,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2022-11-16 11:36:11,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2022-11-16 11:36:11,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2022-11-16 11:36:11,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2022-11-16 11:36:11,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2022-11-16 11:36:11,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (35 of 80 remaining) [2022-11-16 11:36:11,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2022-11-16 11:36:11,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2022-11-16 11:36:11,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 80 remaining) [2022-11-16 11:36:11,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2022-11-16 11:36:11,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2022-11-16 11:36:11,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2022-11-16 11:36:11,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2022-11-16 11:36:11,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2022-11-16 11:36:11,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2022-11-16 11:36:11,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2022-11-16 11:36:11,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2022-11-16 11:36:11,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2022-11-16 11:36:11,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2022-11-16 11:36:11,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2022-11-16 11:36:11,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2022-11-16 11:36:11,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2022-11-16 11:36:11,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2022-11-16 11:36:11,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2022-11-16 11:36:11,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2022-11-16 11:36:11,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2022-11-16 11:36:11,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2022-11-16 11:36:11,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2022-11-16 11:36:11,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2022-11-16 11:36:11,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2022-11-16 11:36:11,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2022-11-16 11:36:11,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2022-11-16 11:36:11,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2022-11-16 11:36:11,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2022-11-16 11:36:11,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2022-11-16 11:36:11,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2022-11-16 11:36:11,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2022-11-16 11:36:11,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2022-11-16 11:36:11,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2022-11-16 11:36:11,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2022-11-16 11:36:11,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2022-11-16 11:36:11,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:36:11,182 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:36:11,190 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:36:11,191 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:36:11,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:36:11 BasicIcfg [2022-11-16 11:36:11,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:36:11,198 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:36:11,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:36:11,199 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:36:11,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:35:47" (3/4) ... [2022-11-16 11:36:11,203 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 11:36:11,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-16 11:36:11,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-16 11:36:11,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-16 11:36:11,215 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-16 11:36:11,216 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 11:36:11,216 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 11:36:11,217 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 11:36:11,280 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:36:11,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:36:11,281 INFO L158 Benchmark]: Toolchain (without parser) took 25238.80ms. Allocated memory was 109.1MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 70.0MB in the beginning and 909.4MB in the end (delta: -839.4MB). Peak memory consumption was 903.8MB. Max. memory is 16.1GB. [2022-11-16 11:36:11,281 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 109.1MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:36:11,282 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.50ms. Allocated memory is still 109.1MB. Free memory was 69.9MB in the beginning and 80.8MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:36:11,282 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.09ms. Allocated memory is still 109.1MB. Free memory was 80.8MB in the beginning and 77.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:36:11,282 INFO L158 Benchmark]: Boogie Preprocessor took 85.54ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 75.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:36:11,283 INFO L158 Benchmark]: RCFGBuilder took 1290.08ms. Allocated memory was 109.1MB in the beginning and 146.8MB in the end (delta: 37.7MB). Free memory was 75.4MB in the beginning and 97.2MB in the end (delta: -21.8MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2022-11-16 11:36:11,283 INFO L158 Benchmark]: TraceAbstraction took 23352.75ms. Allocated memory was 146.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 97.2MB in the beginning and 913.6MB in the end (delta: -816.4MB). Peak memory consumption was 889.4MB. Max. memory is 16.1GB. [2022-11-16 11:36:11,284 INFO L158 Benchmark]: Witness Printer took 81.82ms. Allocated memory is still 1.9GB. Free memory was 913.6MB in the beginning and 909.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:36:11,286 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 109.1MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.50ms. Allocated memory is still 109.1MB. Free memory was 69.9MB in the beginning and 80.8MB in the end (delta: -10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.09ms. Allocated memory is still 109.1MB. Free memory was 80.8MB in the beginning and 77.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.54ms. Allocated memory is still 109.1MB. Free memory was 77.9MB in the beginning and 75.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1290.08ms. Allocated memory was 109.1MB in the beginning and 146.8MB in the end (delta: 37.7MB). Free memory was 75.4MB in the beginning and 97.2MB in the end (delta: -21.8MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23352.75ms. Allocated memory was 146.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 97.2MB in the beginning and 913.6MB in the end (delta: -816.4MB). Peak memory consumption was 889.4MB. Max. memory is 16.1GB. * Witness Printer took 81.82ms. Allocated memory is still 1.9GB. Free memory was 913.6MB in the beginning and 909.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 360 locations, 80 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.1s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 500 mSDsluCounter, 343 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2058 IncrementalHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 276 mSDtfsCounter, 2058 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=532occurred in iteration=18, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2139 NumberOfCodeBlocks, 2139 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 4337 SizeOfPredicates, 6 NumberOfNonLiveVariables, 454 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 34/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 11:36:11,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ccb6d3e-1cd5-404d-a59f-57db8f63de32/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE