./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 5e519f3a 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_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/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_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc --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-5e519f3 [2022-11-02 20:47:51,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:51,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:52,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:52,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:52,033 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:52,036 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:52,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:52,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:52,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:52,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:52,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:52,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:52,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:52,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:52,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:52,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:52,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:52,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:52,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:52,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:52,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:52,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:52,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:52,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:52,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:52,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:52,084 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:52,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:52,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:52,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:52,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:52,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:52,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:52,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:52,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:52,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:52,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:52,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:52,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:52,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:52,095 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:47:52,137 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:52,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:52,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:52,138 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:52,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:52,140 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:52,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:52,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:52,141 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:52,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:52,142 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:47:52,143 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:47:52,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:52,143 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:47:52,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:52,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:47:52,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:52,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:47:52,145 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:47:52,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:47:52,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:47:52,145 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:52,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:47:52,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:52,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:52,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:52,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:52,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:52,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:52,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:47:52,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:47:52,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:47:52,151 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:47:52,151 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:47:52,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:47:52,152 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_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/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_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc 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-02 20:47:52,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:52,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:52,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:52,468 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:52,469 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:52,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2022-11-02 20:47:52,556 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/data/404534943/9a672f59c06f4e63934870a258837252/FLAGd14fb56f3 [2022-11-02 20:47:53,080 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:53,086 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c [2022-11-02 20:47:53,096 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/data/404534943/9a672f59c06f4e63934870a258837252/FLAGd14fb56f3 [2022-11-02 20:47:53,425 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/data/404534943/9a672f59c06f4e63934870a258837252 [2022-11-02 20:47:53,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:53,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:53,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:53,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:53,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:53,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a34f81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53, skipping insertion in model container [2022-11-02 20:47:53,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:53,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:53,731 WARN L230 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_83e6bc5f-de3f-4418-85a3-401f920fb766/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-11-02 20:47:53,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:53,745 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:47:53,778 WARN L230 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_83e6bc5f-de3f-4418-85a3-401f920fb766/sv-benchmarks/c/weaver/popl20-more-multiply-verify.wvr.c[3042,3055] [2022-11-02 20:47:53,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:53,796 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:47:53,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53 WrapperNode [2022-11-02 20:47:53,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:53,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:53,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:47:53,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:47:53,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,854 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 325 [2022-11-02 20:47:53,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:53,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:47:53,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:47:53,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:47:53,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,915 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:47:53,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:47:53,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:47:53,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:47:53,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (1/1) ... [2022-11-02 20:47:53,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:53,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:53,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:47:53,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:47:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:47:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:47:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:47:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:47:54,008 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:47:54,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:47:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:47:54,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:47:54,011 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:47:54,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:47:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:47:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:47:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:47:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:47:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:47:54,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:47:54,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:47:54,014 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:47:54,159 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:47:54,161 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:47:54,823 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:47:55,139 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:47:55,139 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:47:55,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:55 BoogieIcfgContainer [2022-11-02 20:47:55,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:47:55,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:47:55,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:47:55,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:47:55,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:53" (1/3) ... [2022-11-02 20:47:55,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c08052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:55, skipping insertion in model container [2022-11-02 20:47:55,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:53" (2/3) ... [2022-11-02 20:47:55,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c08052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:55, skipping insertion in model container [2022-11-02 20:47:55,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:55" (3/3) ... [2022-11-02 20:47:55,155 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2022-11-02 20:47:55,167 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:47:55,177 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:47:55,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-11-02 20:47:55,177 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:47:55,336 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:47:55,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 276 transitions, 576 flow [2022-11-02 20:47:55,511 INFO L130 PetriNetUnfolder]: 9/273 cut-off events. [2022-11-02 20:47:55,511 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:47:55,517 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 342 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-02 20:47:55,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 276 transitions, 576 flow [2022-11-02 20:47:55,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 253 transitions, 524 flow [2022-11-02 20:47:55,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:47:55,540 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;@5abd21d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:47:55,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-11-02 20:47:55,546 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-02 20:47:55,546 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:47:55,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:55,547 INFO L208 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-02 20:47:55,547 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-02 20:47:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2029531585, now seen corresponding path program 1 times [2022-11-02 20:47:55,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:55,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337226497] [2022-11-02 20:47:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:55,820 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-02 20:47:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:55,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337226497] [2022-11-02 20:47:55,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337226497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:55,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:55,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:55,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765653315] [2022-11-02 20:47:55,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:55,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:55,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:55,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:55,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:55,872 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-02 20:47:55,879 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-02 20:47:55,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:55,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-02 20:47:55,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:56,565 INFO L130 PetriNetUnfolder]: 207/2157 cut-off events. [2022-11-02 20:47:56,565 INFO L131 PetriNetUnfolder]: For 88/122 co-relation queries the response was YES. [2022-11-02 20:47:56,574 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 18922 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-02 20:47:56,584 INFO L137 encePairwiseOnDemand]: 245/276 looper letters, 20 selfloop transitions, 2 changer transitions 2/224 dead transitions. [2022-11-02 20:47:56,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 224 transitions, 510 flow [2022-11-02 20:47:56,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:56,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:47:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2022-11-02 20:47:56,600 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8695652173913043 [2022-11-02 20:47:56,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2022-11-02 20:47:56,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2022-11-02 20:47:56,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:56,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2022-11-02 20:47:56,610 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-02 20:47:56,616 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-02 20:47:56,617 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-02 20:47:56,619 INFO L175 Difference]: Start difference. First operand has 255 places, 253 transitions, 524 flow. Second operand 3 states and 720 transitions. [2022-11-02 20:47:56,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 224 transitions, 510 flow [2022-11-02 20:47:56,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 224 transitions, 498 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:47:56,629 INFO L231 Difference]: Finished difference. Result has 227 places, 222 transitions, 454 flow [2022-11-02 20:47:56,631 INFO L270 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-02 20:47:56,634 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -28 predicate places. [2022-11-02 20:47:56,635 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 222 transitions, 454 flow [2022-11-02 20:47:56,635 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-02 20:47:56,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:56,636 INFO L208 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-02 20:47:56,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:47:56,636 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-02 20:47:56,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:56,637 INFO L85 PathProgramCache]: Analyzing trace with hash -661938477, now seen corresponding path program 1 times [2022-11-02 20:47:56,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:56,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663690117] [2022-11-02 20:47:56,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:56,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:56,689 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-02 20:47:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:56,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663690117] [2022-11-02 20:47:56,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663690117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:56,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:56,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692202945] [2022-11-02 20:47:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:56,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:56,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:56,694 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-02 20:47:56,695 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-02 20:47:56,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:56,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-02 20:47:56,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:56,952 INFO L130 PetriNetUnfolder]: 59/827 cut-off events. [2022-11-02 20:47:56,952 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:47:56,957 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 4463 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-02 20:47:56,963 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2022-11-02 20:47:56,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 221 transitions, 484 flow [2022-11-02 20:47:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:47:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2022-11-02 20:47:56,966 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2022-11-02 20:47:56,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2022-11-02 20:47:56,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2022-11-02 20:47:56,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:56,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2022-11-02 20:47:56,970 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-02 20:47:56,972 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-02 20:47:56,973 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-02 20:47:56,974 INFO L175 Difference]: Start difference. First operand has 227 places, 222 transitions, 454 flow. Second operand 3 states and 704 transitions. [2022-11-02 20:47:56,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 221 transitions, 484 flow [2022-11-02 20:47:56,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 221 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:47:56,986 INFO L231 Difference]: Finished difference. Result has 224 places, 221 transitions, 452 flow [2022-11-02 20:47:56,986 INFO L270 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-02 20:47:56,988 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -31 predicate places. [2022-11-02 20:47:56,988 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 221 transitions, 452 flow [2022-11-02 20:47:56,989 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-02 20:47:56,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:56,989 INFO L208 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-02 20:47:56,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:47:56,990 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-02 20:47:56,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1148521980, now seen corresponding path program 1 times [2022-11-02 20:47:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:56,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242899881] [2022-11-02 20:47:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:57,098 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-02 20:47:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242899881] [2022-11-02 20:47:57,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242899881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:57,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:57,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:57,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835166151] [2022-11-02 20:47:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:57,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:57,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:57,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:57,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:57,103 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-02 20:47:57,104 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-02 20:47:57,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:57,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-02 20:47:57,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:57,300 INFO L130 PetriNetUnfolder]: 59/826 cut-off events. [2022-11-02 20:47:57,301 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:47:57,305 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 4471 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-02 20:47:57,309 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2022-11-02 20:47:57,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 220 transitions, 488 flow [2022-11-02 20:47:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:47:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2022-11-02 20:47:57,312 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8429951690821256 [2022-11-02 20:47:57,312 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 698 transitions. [2022-11-02 20:47:57,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 698 transitions. [2022-11-02 20:47:57,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:57,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 698 transitions. [2022-11-02 20:47:57,315 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-02 20:47:57,317 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-02 20:47:57,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-02 20:47:57,318 INFO L175 Difference]: Start difference. First operand has 224 places, 221 transitions, 452 flow. Second operand 3 states and 698 transitions. [2022-11-02 20:47:57,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 220 transitions, 488 flow [2022-11-02 20:47:57,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:47:57,323 INFO L231 Difference]: Finished difference. Result has 223 places, 220 transitions, 450 flow [2022-11-02 20:47:57,323 INFO L270 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-02 20:47:57,324 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -32 predicate places. [2022-11-02 20:47:57,324 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 220 transitions, 450 flow [2022-11-02 20:47:57,325 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-02 20:47:57,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:57,325 INFO L208 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-02 20:47:57,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:47:57,326 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-02 20:47:57,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:57,326 INFO L85 PathProgramCache]: Analyzing trace with hash -250869527, now seen corresponding path program 1 times [2022-11-02 20:47:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:57,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077735709] [2022-11-02 20:47:57,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:57,372 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-02 20:47:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:57,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077735709] [2022-11-02 20:47:57,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077735709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:57,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:57,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288057196] [2022-11-02 20:47:57,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:57,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:57,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:57,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:57,376 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 276 [2022-11-02 20:47:57,377 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-02 20:47:57,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:57,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 276 [2022-11-02 20:47:57,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:57,642 INFO L130 PetriNetUnfolder]: 215/981 cut-off events. [2022-11-02 20:47:57,642 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-02 20:47:57,647 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 44. Compared 5691 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-02 20:47:57,652 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 23 selfloop transitions, 2 changer transitions 0/219 dead transitions. [2022-11-02 20:47:57,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 219 transitions, 498 flow [2022-11-02 20:47:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:47:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2022-11-02 20:47:57,656 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8285024154589372 [2022-11-02 20:47:57,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2022-11-02 20:47:57,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2022-11-02 20:47:57,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:57,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2022-11-02 20:47:57,662 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-02 20:47:57,664 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-02 20:47:57,665 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-02 20:47:57,665 INFO L175 Difference]: Start difference. First operand has 223 places, 220 transitions, 450 flow. Second operand 3 states and 686 transitions. [2022-11-02 20:47:57,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 219 transitions, 498 flow [2022-11-02 20:47:57,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:47:57,675 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 448 flow [2022-11-02 20:47:57,675 INFO L270 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-02 20:47:57,677 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -33 predicate places. [2022-11-02 20:47:57,677 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 448 flow [2022-11-02 20:47:57,677 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-02 20:47:57,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:57,678 INFO L208 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-02 20:47:57,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:47:57,678 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-02 20:47:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:57,679 INFO L85 PathProgramCache]: Analyzing trace with hash 165908282, now seen corresponding path program 1 times [2022-11-02 20:47:57,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:57,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852760110] [2022-11-02 20:47:57,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:57,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:57,760 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-02 20:47:57,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:57,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852760110] [2022-11-02 20:47:57,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852760110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:57,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:57,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:57,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573801441] [2022-11-02 20:47:57,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:57,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:57,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:57,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:57,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:57,764 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-02 20:47:57,765 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-02 20:47:57,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:57,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-02 20:47:57,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:57,988 INFO L130 PetriNetUnfolder]: 163/902 cut-off events. [2022-11-02 20:47:57,988 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-02 20:47:57,992 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 36. Compared 5019 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-02 20:47:57,996 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 18 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2022-11-02 20:47:57,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 216 transitions, 480 flow [2022-11-02 20:47:57,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:47:57,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2022-11-02 20:47:57,999 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2022-11-02 20:47:57,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2022-11-02 20:47:58,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2022-11-02 20:47:58,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:58,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2022-11-02 20:47:58,002 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-02 20:47:58,004 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-02 20:47:58,005 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-02 20:47:58,005 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 448 flow. Second operand 3 states and 691 transitions. [2022-11-02 20:47:58,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 216 transitions, 480 flow [2022-11-02 20:47:58,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:47:58,010 INFO L231 Difference]: Finished difference. Result has 219 places, 216 transitions, 440 flow [2022-11-02 20:47:58,011 INFO L270 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-02 20:47:58,014 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -36 predicate places. [2022-11-02 20:47:58,014 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 216 transitions, 440 flow [2022-11-02 20:47:58,015 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-02 20:47:58,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:58,015 INFO L208 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-02 20:47:58,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:47:58,016 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-02 20:47:58,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1146374314, now seen corresponding path program 1 times [2022-11-02 20:47:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:58,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436691211] [2022-11-02 20:47:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:58,081 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-02 20:47:58,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:58,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436691211] [2022-11-02 20:47:58,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436691211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:58,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:58,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:58,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807456391] [2022-11-02 20:47:58,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:58,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:58,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:58,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:58,085 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-02 20:47:58,086 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-02 20:47:58,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:58,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-02 20:47:58,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:58,267 INFO L130 PetriNetUnfolder]: 59/797 cut-off events. [2022-11-02 20:47:58,267 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:47:58,270 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 4212 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-02 20:47:58,274 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 14 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-02 20:47:58,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 470 flow [2022-11-02 20:47:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:47:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2022-11-02 20:47:58,277 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2022-11-02 20:47:58,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 704 transitions. [2022-11-02 20:47:58,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 704 transitions. [2022-11-02 20:47:58,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:58,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 704 transitions. [2022-11-02 20:47:58,280 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-02 20:47:58,282 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-02 20:47:58,283 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-02 20:47:58,283 INFO L175 Difference]: Start difference. First operand has 219 places, 216 transitions, 440 flow. Second operand 3 states and 704 transitions. [2022-11-02 20:47:58,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 470 flow [2022-11-02 20:47:58,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:47:58,289 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 441 flow [2022-11-02 20:47:58,289 INFO L270 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-02 20:47:58,290 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -36 predicate places. [2022-11-02 20:47:58,290 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 441 flow [2022-11-02 20:47:58,291 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-02 20:47:58,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:58,291 INFO L208 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-02 20:47:58,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:47:58,291 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-02 20:47:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:58,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1941991352, now seen corresponding path program 1 times [2022-11-02 20:47:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:58,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218773167] [2022-11-02 20:47:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:58,334 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-02 20:47:58,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:58,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218773167] [2022-11-02 20:47:58,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218773167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:58,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:58,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:58,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533903535] [2022-11-02 20:47:58,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:58,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:58,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:58,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:58,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:58,339 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-02 20:47:58,340 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-02 20:47:58,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:58,340 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-02 20:47:58,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:58,511 INFO L130 PetriNetUnfolder]: 59/796 cut-off events. [2022-11-02 20:47:58,511 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-02 20:47:58,515 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-02 20:47:58,519 INFO L137 encePairwiseOnDemand]: 274/276 looper letters, 14 selfloop transitions, 1 changer transitions 0/214 dead transitions. [2022-11-02 20:47:58,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 214 transitions, 469 flow [2022-11-02 20:47:58,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:47:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2022-11-02 20:47:58,522 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8490338164251208 [2022-11-02 20:47:58,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 703 transitions. [2022-11-02 20:47:58,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 703 transitions. [2022-11-02 20:47:58,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:58,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 703 transitions. [2022-11-02 20:47:58,526 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-02 20:47:58,527 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-02 20:47:58,528 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-02 20:47:58,528 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 441 flow. Second operand 3 states and 703 transitions. [2022-11-02 20:47:58,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 214 transitions, 469 flow [2022-11-02 20:47:58,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:47:58,533 INFO L231 Difference]: Finished difference. Result has 218 places, 214 transitions, 437 flow [2022-11-02 20:47:58,534 INFO L270 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-02 20:47:58,534 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -37 predicate places. [2022-11-02 20:47:58,535 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 214 transitions, 437 flow [2022-11-02 20:47:58,535 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-02 20:47:58,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:58,535 INFO L208 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-02 20:47:58,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:47:58,536 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-02 20:47:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -685495310, now seen corresponding path program 1 times [2022-11-02 20:47:58,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:58,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498843132] [2022-11-02 20:47:58,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:58,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498843132] [2022-11-02 20:47:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498843132] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:58,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:58,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571651225] [2022-11-02 20:47:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:58,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:58,631 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 276 [2022-11-02 20:47:58,632 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-02 20:47:58,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:58,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 276 [2022-11-02 20:47:58,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:47:58,847 INFO L130 PetriNetUnfolder]: 215/951 cut-off events. [2022-11-02 20:47:58,847 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-02 20:47:58,852 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 45. Compared 5281 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-02 20:47:58,857 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 20 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2022-11-02 20:47:58,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 479 flow [2022-11-02 20:47:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:47:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 692 transitions. [2022-11-02 20:47:58,860 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8357487922705314 [2022-11-02 20:47:58,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 692 transitions. [2022-11-02 20:47:58,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 692 transitions. [2022-11-02 20:47:58,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:47:58,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 692 transitions. [2022-11-02 20:47:58,863 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-02 20:47:58,864 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-02 20:47:58,865 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-02 20:47:58,865 INFO L175 Difference]: Start difference. First operand has 218 places, 214 transitions, 437 flow. Second operand 3 states and 692 transitions. [2022-11-02 20:47:58,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 479 flow [2022-11-02 20:47:58,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:47:58,870 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 438 flow [2022-11-02 20:47:58,870 INFO L270 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-02 20:47:58,871 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -37 predicate places. [2022-11-02 20:47:58,871 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 438 flow [2022-11-02 20:47:58,872 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-02 20:47:58,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:47:58,872 INFO L208 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-02 20:47:58,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:47:58,873 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-02 20:47:58,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:58,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1258613492, now seen corresponding path program 1 times [2022-11-02 20:47:58,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:58,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839869291] [2022-11-02 20:47:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:58,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:59,401 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-02 20:47:59,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:59,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839869291] [2022-11-02 20:47:59,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839869291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:59,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:59,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628585833] [2022-11-02 20:47:59,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:59,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:59,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:59,405 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2022-11-02 20:47:59,406 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-02 20:47:59,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:47:59,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2022-11-02 20:47:59,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:01,050 INFO L130 PetriNetUnfolder]: 3233/6048 cut-off events. [2022-11-02 20:48:01,050 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-11-02 20:48:01,070 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 43036 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-02 20:48:01,106 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 52 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2022-11-02 20:48:01,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 212 transitions, 550 flow [2022-11-02 20:48:01,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2022-11-02 20:48:01,109 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.716183574879227 [2022-11-02 20:48:01,110 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1186 transitions. [2022-11-02 20:48:01,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1186 transitions. [2022-11-02 20:48:01,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:01,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1186 transitions. [2022-11-02 20:48:01,113 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-02 20:48:01,116 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-02 20:48:01,117 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-02 20:48:01,117 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 438 flow. Second operand 6 states and 1186 transitions. [2022-11-02 20:48:01,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 212 transitions, 550 flow [2022-11-02 20:48:01,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 212 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:48:01,122 INFO L231 Difference]: Finished difference. Result has 220 places, 212 transitions, 442 flow [2022-11-02 20:48:01,123 INFO L270 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-02 20:48:01,123 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -35 predicate places. [2022-11-02 20:48:01,123 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 212 transitions, 442 flow [2022-11-02 20:48:01,124 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-02 20:48:01,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:01,124 INFO L208 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-02 20:48:01,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:48:01,125 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-02 20:48:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 515061523, now seen corresponding path program 1 times [2022-11-02 20:48:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:01,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716662516] [2022-11-02 20:48:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:01,167 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-02 20:48:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:01,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716662516] [2022-11-02 20:48:01,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716662516] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:01,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:01,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676220715] [2022-11-02 20:48:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:01,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:01,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:01,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:01,171 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-02 20:48:01,171 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-02 20:48:01,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:01,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-02 20:48:01,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:01,291 INFO L130 PetriNetUnfolder]: 148/591 cut-off events. [2022-11-02 20:48:01,291 INFO L131 PetriNetUnfolder]: For 13/37 co-relation queries the response was YES. [2022-11-02 20:48:01,294 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 2765 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-02 20:48:01,297 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 20 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-02 20:48:01,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 215 transitions, 494 flow [2022-11-02 20:48:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:01,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:48:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-11-02 20:48:01,300 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-11-02 20:48:01,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-11-02 20:48:01,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-11-02 20:48:01,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:01,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-11-02 20:48:01,302 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-02 20:48:01,304 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-02 20:48:01,305 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-02 20:48:01,305 INFO L175 Difference]: Start difference. First operand has 220 places, 212 transitions, 442 flow. Second operand 3 states and 702 transitions. [2022-11-02 20:48:01,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 215 transitions, 494 flow [2022-11-02 20:48:01,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 484 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:48:01,310 INFO L231 Difference]: Finished difference. Result has 216 places, 212 transitions, 442 flow [2022-11-02 20:48:01,312 INFO L270 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-02 20:48:01,313 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -39 predicate places. [2022-11-02 20:48:01,313 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 212 transitions, 442 flow [2022-11-02 20:48:01,314 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-02 20:48:01,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:01,314 INFO L208 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-02 20:48:01,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:48:01,315 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-02 20:48:01,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1453097214, now seen corresponding path program 1 times [2022-11-02 20:48:01,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:01,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631766979] [2022-11-02 20:48:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:01,373 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-02 20:48:01,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:01,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631766979] [2022-11-02 20:48:01,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631766979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:01,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:01,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:01,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933667871] [2022-11-02 20:48:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:01,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:01,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:01,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:01,377 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 276 [2022-11-02 20:48:01,378 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-02 20:48:01,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:01,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 276 [2022-11-02 20:48:01,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:01,624 INFO L130 PetriNetUnfolder]: 191/1000 cut-off events. [2022-11-02 20:48:01,624 INFO L131 PetriNetUnfolder]: For 25/37 co-relation queries the response was YES. [2022-11-02 20:48:01,628 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 5949 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-02 20:48:01,631 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 22 selfloop transitions, 3 changer transitions 0/218 dead transitions. [2022-11-02 20:48:01,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 506 flow [2022-11-02 20:48:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:48:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-02 20:48:01,634 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2022-11-02 20:48:01,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-02 20:48:01,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-02 20:48:01,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:01,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-02 20:48:01,636 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-02 20:48:01,638 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-02 20:48:01,638 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-02 20:48:01,639 INFO L175 Difference]: Start difference. First operand has 216 places, 212 transitions, 442 flow. Second operand 3 states and 705 transitions. [2022-11-02 20:48:01,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 506 flow [2022-11-02 20:48:01,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 218 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:48:01,643 INFO L231 Difference]: Finished difference. Result has 217 places, 213 transitions, 459 flow [2022-11-02 20:48:01,644 INFO L270 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-02 20:48:01,644 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -38 predicate places. [2022-11-02 20:48:01,644 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 459 flow [2022-11-02 20:48:01,645 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-02 20:48:01,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:01,645 INFO L208 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-02 20:48:01,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:48:01,646 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-02 20:48:01,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:01,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1543022137, now seen corresponding path program 1 times [2022-11-02 20:48:01,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:01,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208760566] [2022-11-02 20:48:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,068 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-02 20:48:02,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:02,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208760566] [2022-11-02 20:48:02,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208760566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:02,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:02,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:02,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112388765] [2022-11-02 20:48:02,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:02,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:48:02,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:02,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:48:02,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:48:02,072 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-02 20:48:02,073 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-02 20:48:02,073 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:02,073 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-02 20:48:02,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:02,863 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][173], [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, 264#L105-3true, 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:02,864 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-02 20:48:02,864 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-02 20:48:02,864 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-02 20:48:02,864 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-02 20:48:02,866 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][164], [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, 331#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:02,867 INFO L383 tUnfolder$Statistics]: this new event has 129 ancestors and is cut-off event [2022-11-02 20:48:02,867 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:48:02,867 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:48:02,867 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:48:02,868 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), 170#L105-4true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 321#(= |#race~A~0| 0), 215#L76true, 125#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-02 20:48:02,869 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-02 20:48:02,869 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:48:02,869 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:48:02,869 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:48:02,887 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][192], [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, 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:02,888 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-02 20:48:02,888 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:48:02,888 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:02,888 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:48:02,947 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][192], [326#(= |#race~queue~0| 0), 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, 125#L60true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:02,947 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-02 20:48:02,947 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:48:02,948 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:02,948 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:48:03,165 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][192], [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), 252#L105-7true, 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:03,166 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-02 20:48:03,166 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:48:03,166 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:03,166 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:48:03,391 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][192], [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-02 20:48:03,391 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-02 20:48:03,391 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:48:03,391 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:03,391 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:03,453 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][192], [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-02 20:48:03,453 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-02 20:48:03,453 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:03,454 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:03,454 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:48:03,518 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][192], [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, 123#L106-4true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:03,518 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-02 20:48:03,519 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:48:03,519 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-02 20:48:03,519 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:48:03,664 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][192], [326#(= |#race~queue~0| 0), 130#L106-5true, 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-02 20:48:03,665 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-02 20:48:03,665 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:48:03,665 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:48:03,665 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-02 20:48:03,704 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][192], [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, 50#L106-6true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:03,704 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:48:03,704 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:48:03,705 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:03,705 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:03,706 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][192], [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, 159#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:03,706 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:48:03,707 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:03,707 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:48:03,707 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:04,148 INFO L130 PetriNetUnfolder]: 3989/6364 cut-off events. [2022-11-02 20:48:04,148 INFO L131 PetriNetUnfolder]: For 1397/1438 co-relation queries the response was YES. [2022-11-02 20:48:04,182 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 42828 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-02 20:48:04,218 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 123 selfloop transitions, 4 changer transitions 0/288 dead transitions. [2022-11-02 20:48:04,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 288 transitions, 903 flow [2022-11-02 20:48:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:04,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1276 transitions. [2022-11-02 20:48:04,222 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7705314009661836 [2022-11-02 20:48:04,222 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1276 transitions. [2022-11-02 20:48:04,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1276 transitions. [2022-11-02 20:48:04,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:04,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1276 transitions. [2022-11-02 20:48:04,226 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-02 20:48:04,229 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-02 20:48:04,230 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-02 20:48:04,230 INFO L175 Difference]: Start difference. First operand has 217 places, 213 transitions, 459 flow. Second operand 6 states and 1276 transitions. [2022-11-02 20:48:04,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 288 transitions, 903 flow [2022-11-02 20:48:04,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 288 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:48:04,238 INFO L231 Difference]: Finished difference. Result has 221 places, 212 transitions, 465 flow [2022-11-02 20:48:04,238 INFO L270 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-02 20:48:04,240 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-02 20:48:04,241 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 212 transitions, 465 flow [2022-11-02 20:48:04,241 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-02 20:48:04,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:04,242 INFO L208 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-02 20:48:04,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:48:04,242 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-02 20:48:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1630701092, now seen corresponding path program 1 times [2022-11-02 20:48:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:04,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576702119] [2022-11-02 20:48:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:04,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:04,754 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-02 20:48:04,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:04,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576702119] [2022-11-02 20:48:04,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576702119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:04,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:04,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:04,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115065069] [2022-11-02 20:48:04,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:04,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:48:04,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:04,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:48:04,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:48:04,764 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 276 [2022-11-02 20:48:04,770 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-02 20:48:04,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:04,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 276 [2022-11-02 20:48:04,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:05,384 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][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 170#L105-4true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 215#L76true, 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 125#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-02 20:48:05,384 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-02 20:48:05,385 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:48:05,385 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:48:05,385 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:48:05,388 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][151], [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, 215#L76true, 321#(= |#race~A~0| 0), 223#L105-5true, 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-02 20:48:05,388 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-02 20:48:05,388 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:48:05,389 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:48:05,389 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:05,390 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][151], [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, 264#L105-3true, 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-02 20:48:05,390 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-02 20:48:05,390 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-02 20:48:05,390 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-02 20:48:05,390 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-02 20:48:05,404 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 215#L76true, 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-02 20:48:05,404 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-02 20:48:05,405 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:48:05,405 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:48:05,405 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:05,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][151], [326#(= |#race~queue~0| 0), 336#true, 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), 252#L105-7true, 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:05,535 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-02 20:48:05,535 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:05,535 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:48:05,535 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:48:05,693 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 54#L106-2true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:05,694 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-02 20:48:05,694 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:05,694 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:48:05,694 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:05,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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 7#L106-3true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:05,746 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-02 20:48:05,747 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:48:05,747 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:05,747 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:05,812 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 123#L106-4true, 321#(= |#race~A~0| 0), 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:05,813 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-02 20:48:05,813 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:48:05,813 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-02 20:48:05,813 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:48:05,870 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][151], [130#L106-5true, 326#(= |#race~queue~0| 0), 336#true, 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, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:05,870 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-02 20:48:05,871 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:48:05,871 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:48:05,871 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-02 20:48:05,919 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 50#L106-6true, 215#L76true, 321#(= |#race~A~0| 0), 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:05,919 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:48:05,919 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:48:05,919 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:05,920 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:05,921 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][151], [326#(= |#race~queue~0| 0), 336#true, 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), 159#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 215#L76true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:05,921 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:48:05,921 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:05,921 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:48:05,922 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:06,564 INFO L130 PetriNetUnfolder]: 3758/6946 cut-off events. [2022-11-02 20:48:06,564 INFO L131 PetriNetUnfolder]: For 1955/1991 co-relation queries the response was YES. [2022-11-02 20:48:06,599 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 51088 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-02 20:48:06,634 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 141 selfloop transitions, 4 changer transitions 0/303 dead transitions. [2022-11-02 20:48:06,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 303 transitions, 993 flow [2022-11-02 20:48:06,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1296 transitions. [2022-11-02 20:48:06,638 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2022-11-02 20:48:06,638 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1296 transitions. [2022-11-02 20:48:06,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1296 transitions. [2022-11-02 20:48:06,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:06,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1296 transitions. [2022-11-02 20:48:06,642 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-02 20:48:06,645 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-02 20:48:06,647 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-02 20:48:06,647 INFO L175 Difference]: Start difference. First operand has 221 places, 212 transitions, 465 flow. Second operand 6 states and 1296 transitions. [2022-11-02 20:48:06,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 303 transitions, 993 flow [2022-11-02 20:48:06,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 303 transitions, 958 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:48:06,657 INFO L231 Difference]: Finished difference. Result has 221 places, 211 transitions, 464 flow [2022-11-02 20:48:06,657 INFO L270 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-02 20:48:06,658 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-02 20:48:06,659 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 211 transitions, 464 flow [2022-11-02 20:48:06,659 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-02 20:48:06,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:06,660 INFO L208 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-02 20:48:06,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:48:06,660 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-02 20:48:06,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1959845868, now seen corresponding path program 1 times [2022-11-02 20:48:06,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:06,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168051334] [2022-11-02 20:48:06,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:06,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:07,189 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-02 20:48:07,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:07,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168051334] [2022-11-02 20:48:07,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168051334] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:07,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:07,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:07,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859676791] [2022-11-02 20:48:07,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:07,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:48:07,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:07,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:48:07,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:48:07,192 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 276 [2022-11-02 20:48:07,194 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-02 20:48:07,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:07,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 276 [2022-11-02 20:48:07,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:07,778 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][151], [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), 125#L60true, 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]) [2022-11-02 20:48:07,778 INFO L383 tUnfolder$Statistics]: this new event has 132 ancestors and is cut-off event [2022-11-02 20:48:07,779 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:48:07,779 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:07,779 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:48:07,780 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][151], [326#(= |#race~queue~0| 0), 336#true, Black: 319#true, 298#(= |#race~start~0| 0), 231#L86true, Black: 324#true, 215#L76true, 321#(= |#race~A~0| 0), 343#true, 306#(= |#race~n~0| 0), 125#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-02 20:48:07,781 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-02 20:48:07,781 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:48:07,781 INFO L386 tUnfolder$Statistics]: existing Event has 124 ancestors and is cut-off event [2022-11-02 20:48:07,781 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-02 20:48:07,782 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][151], [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, 264#L105-3true, 306#(= |#race~n~0| 0), 125#L60true]) [2022-11-02 20:48:07,783 INFO L383 tUnfolder$Statistics]: this new event has 130 ancestors and is cut-off event [2022-11-02 20:48:07,783 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-02 20:48:07,783 INFO L386 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-11-02 20:48:07,783 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-02 20:48:07,795 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][151], [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), 125#L60true, 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]) [2022-11-02 20:48:07,795 INFO L383 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-11-02 20:48:07,795 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:48:07,796 INFO L386 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-11-02 20:48:07,796 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:07,941 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][151], [326#(= |#race~queue~0| 0), 336#true, 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), 252#L105-7true, 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:07,941 INFO L383 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-11-02 20:48:07,942 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:48:07,942 INFO L386 tUnfolder$Statistics]: existing Event has 129 ancestors and is cut-off event [2022-11-02 20:48:07,942 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:08,087 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 54#L106-2true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:08,088 INFO L383 tUnfolder$Statistics]: this new event has 139 ancestors and is cut-off event [2022-11-02 20:48:08,088 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:08,088 INFO L386 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-11-02 20:48:08,088 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:48:08,131 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 7#L106-3true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:08,131 INFO L383 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-11-02 20:48:08,131 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:08,132 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:48:08,132 INFO L386 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-11-02 20:48:08,175 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 123#L106-4true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:08,175 INFO L383 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2022-11-02 20:48:08,176 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:48:08,176 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-02 20:48:08,176 INFO L386 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-11-02 20:48:08,217 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][151], [130#L106-5true, 326#(= |#race~queue~0| 0), 336#true, 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, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:08,217 INFO L383 tUnfolder$Statistics]: this new event has 142 ancestors and is cut-off event [2022-11-02 20:48:08,218 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:48:08,218 INFO L386 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-11-02 20:48:08,218 INFO L386 tUnfolder$Statistics]: existing Event has 135 ancestors and is cut-off event [2022-11-02 20:48:08,256 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 159#ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACEtrue, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:08,256 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:48:08,257 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:08,257 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:08,257 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:48:08,258 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][151], [326#(= |#race~queue~0| 0), 336#true, 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, 50#L106-6true, 321#(= |#race~A~0| 0), 215#L76true, 343#true, 306#(= |#race~n~0| 0)]) [2022-11-02 20:48:08,258 INFO L383 tUnfolder$Statistics]: this new event has 143 ancestors and is cut-off event [2022-11-02 20:48:08,259 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:08,259 INFO L386 tUnfolder$Statistics]: existing Event has 136 ancestors and is cut-off event [2022-11-02 20:48:08,259 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:48:08,975 INFO L130 PetriNetUnfolder]: 3515/6545 cut-off events. [2022-11-02 20:48:08,975 INFO L131 PetriNetUnfolder]: For 1432/1468 co-relation queries the response was YES. [2022-11-02 20:48:09,013 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 47270 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-02 20:48:09,052 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 140 selfloop transitions, 4 changer transitions 0/302 dead transitions. [2022-11-02 20:48:09,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 302 transitions, 962 flow [2022-11-02 20:48:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1295 transitions. [2022-11-02 20:48:09,056 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7820048309178744 [2022-11-02 20:48:09,057 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1295 transitions. [2022-11-02 20:48:09,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1295 transitions. [2022-11-02 20:48:09,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:09,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1295 transitions. [2022-11-02 20:48:09,062 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-02 20:48:09,066 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-02 20:48:09,067 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-02 20:48:09,067 INFO L175 Difference]: Start difference. First operand has 221 places, 211 transitions, 464 flow. Second operand 6 states and 1295 transitions. [2022-11-02 20:48:09,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 302 transitions, 962 flow [2022-11-02 20:48:09,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 302 transitions, 955 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:48:09,077 INFO L231 Difference]: Finished difference. Result has 221 places, 210 transitions, 463 flow [2022-11-02 20:48:09,077 INFO L270 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-02 20:48:09,078 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-02 20:48:09,078 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 210 transitions, 463 flow [2022-11-02 20:48:09,079 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-02 20:48:09,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:09,080 INFO L208 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-02 20:48:09,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:48:09,080 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-02 20:48:09,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash 866151855, now seen corresponding path program 1 times [2022-11-02 20:48:09,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:09,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922142060] [2022-11-02 20:48:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:09,401 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-02 20:48:09,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:09,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922142060] [2022-11-02 20:48:09,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922142060] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:09,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:09,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:48:09,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460683302] [2022-11-02 20:48:09,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:09,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:48:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:09,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:48:09,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:48:09,406 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 276 [2022-11-02 20:48:09,408 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-02 20:48:09,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:09,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 276 [2022-11-02 20:48:09,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:09,713 INFO L130 PetriNetUnfolder]: 103/966 cut-off events. [2022-11-02 20:48:09,714 INFO L131 PetriNetUnfolder]: For 68/74 co-relation queries the response was YES. [2022-11-02 20:48:09,720 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 5258 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-02 20:48:09,723 INFO L137 encePairwiseOnDemand]: 266/276 looper letters, 35 selfloop transitions, 6 changer transitions 6/225 dead transitions. [2022-11-02 20:48:09,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 225 transitions, 590 flow [2022-11-02 20:48:09,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:48:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-02 20:48:09,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1553 transitions. [2022-11-02 20:48:09,729 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8038302277432712 [2022-11-02 20:48:09,730 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1553 transitions. [2022-11-02 20:48:09,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1553 transitions. [2022-11-02 20:48:09,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:09,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1553 transitions. [2022-11-02 20:48:09,735 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-02 20:48:09,739 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-02 20:48:09,740 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-02 20:48:09,741 INFO L175 Difference]: Start difference. First operand has 221 places, 210 transitions, 463 flow. Second operand 7 states and 1553 transitions. [2022-11-02 20:48:09,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 225 transitions, 590 flow [2022-11-02 20:48:09,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 225 transitions, 583 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:48:09,747 INFO L231 Difference]: Finished difference. Result has 225 places, 211 transitions, 482 flow [2022-11-02 20:48:09,748 INFO L270 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-02 20:48:09,749 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -30 predicate places. [2022-11-02 20:48:09,750 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 211 transitions, 482 flow [2022-11-02 20:48:09,750 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-02 20:48:09,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:09,751 INFO L208 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-02 20:48:09,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:48:09,751 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-02 20:48:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash -376159072, now seen corresponding path program 1 times [2022-11-02 20:48:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:09,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798601293] [2022-11-02 20:48:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:10,410 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-02 20:48:10,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:10,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798601293] [2022-11-02 20:48:10,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798601293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:10,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:10,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021909604] [2022-11-02 20:48:10,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:10,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:48:10,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:10,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:48:10,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:48:10,420 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-02 20:48:10,422 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-02 20:48:10,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:10,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-02 20:48:10,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:10,970 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][151], [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), 125#L60true, 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|)), 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-02 20:48:10,971 INFO L383 tUnfolder$Statistics]: this new event has 145 ancestors and is cut-off event [2022-11-02 20:48:10,971 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:48:10,971 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:48:10,971 INFO L386 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-11-02 20:48:10,972 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][151], [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), 125#L60true, 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|)), 223#L105-5true]) [2022-11-02 20:48:10,972 INFO L383 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-11-02 20:48:10,972 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:48:10,973 INFO L386 tUnfolder$Statistics]: existing Event has 139 ancestors and is cut-off event [2022-11-02 20:48:10,973 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:48:10,975 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][151], [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), 125#L60true, 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|)), 264#L105-3true]) [2022-11-02 20:48:10,975 INFO L383 tUnfolder$Statistics]: this new event has 144 ancestors and is cut-off event [2022-11-02 20:48:10,975 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:48:10,975 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:48:10,975 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-02 20:48:10,989 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][151], [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|)), 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), 125#L60true, 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-02 20:48:10,990 INFO L383 tUnfolder$Statistics]: this new event has 147 ancestors and is cut-off event [2022-11-02 20:48:10,990 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:48:10,990 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:48:10,990 INFO L386 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-11-02 20:48:11,138 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][151], [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, 252#L105-7true, 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), 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-02 20:48:11,139 INFO L383 tUnfolder$Statistics]: this new event has 150 ancestors and is cut-off event [2022-11-02 20:48:11,139 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:48:11,139 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-02 20:48:11,139 INFO L386 tUnfolder$Statistics]: existing Event has 143 ancestors and is cut-off event [2022-11-02 20:48:11,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][151], [326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), Black: 324#true, 102#L106-1true, 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), 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-02 20:48:11,205 INFO L383 tUnfolder$Statistics]: this new event has 152 ancestors and is cut-off event [2022-11-02 20:48:11,205 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:48:11,205 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:48:11,205 INFO L386 tUnfolder$Statistics]: existing Event has 145 ancestors and is cut-off event [2022-11-02 20:48:11,243 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), 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-02 20:48:11,243 INFO L383 tUnfolder$Statistics]: this new event has 153 ancestors and is cut-off event [2022-11-02 20:48:11,244 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:48:11,244 INFO L386 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-11-02 20:48:11,244 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:48:11,292 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][188], [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|)), 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, 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-02 20:48:11,293 INFO L383 tUnfolder$Statistics]: this new event has 154 ancestors and is cut-off event [2022-11-02 20:48:11,293 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:48:11,293 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:48:11,293 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-02 20:48:11,347 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][194], [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)), 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|)), 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, 123#L106-4true, 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-02 20:48:11,348 INFO L383 tUnfolder$Statistics]: this new event has 155 ancestors and is cut-off event [2022-11-02 20:48:11,348 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-02 20:48:11,348 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:48:11,348 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-02 20:48:11,390 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], [130#L106-5true, 326#(= |#race~queue~0| 0), Black: 319#true, 298#(= |#race~start~0| 0), 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|)))), 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, 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-02 20:48:11,390 INFO L383 tUnfolder$Statistics]: this new event has 156 ancestors and is cut-off event [2022-11-02 20:48:11,391 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-02 20:48:11,391 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-02 20:48:11,391 INFO L386 tUnfolder$Statistics]: existing Event has 149 ancestors and is cut-off event [2022-11-02 20:48:11,431 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-02 20:48:11,432 INFO L383 tUnfolder$Statistics]: this new event has 157 ancestors and is cut-off event [2022-11-02 20:48:11,432 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-02 20:48:11,432 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-02 20:48:11,432 INFO L386 tUnfolder$Statistics]: existing Event has 150 ancestors and is cut-off event [2022-11-02 20:48:11,808 INFO L130 PetriNetUnfolder]: 3031/5729 cut-off events. [2022-11-02 20:48:11,808 INFO L131 PetriNetUnfolder]: For 1369/1445 co-relation queries the response was YES. [2022-11-02 20:48:11,841 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 41173 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-02 20:48:11,873 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 96 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2022-11-02 20:48:11,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 262 transitions, 808 flow [2022-11-02 20:48:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-11-02 20:48:11,877 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7590579710144928 [2022-11-02 20:48:11,877 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-11-02 20:48:11,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-11-02 20:48:11,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:11,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-11-02 20:48:11,881 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-02 20:48:11,884 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-02 20:48:11,885 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-02 20:48:11,885 INFO L175 Difference]: Start difference. First operand has 225 places, 211 transitions, 482 flow. Second operand 6 states and 1257 transitions. [2022-11-02 20:48:11,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 262 transitions, 808 flow [2022-11-02 20:48:11,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 262 transitions, 798 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:48:11,892 INFO L231 Difference]: Finished difference. Result has 224 places, 210 transitions, 478 flow [2022-11-02 20:48:11,892 INFO L270 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-02 20:48:11,893 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -31 predicate places. [2022-11-02 20:48:11,893 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 210 transitions, 478 flow [2022-11-02 20:48:11,893 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-02 20:48:11,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:11,894 INFO L208 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-02 20:48:11,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:48:11,894 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-02 20:48:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:11,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2132503650, now seen corresponding path program 1 times [2022-11-02 20:48:11,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:11,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997852267] [2022-11-02 20:48:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:11,964 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-02 20:48:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:11,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997852267] [2022-11-02 20:48:11,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997852267] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:11,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:11,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155616471] [2022-11-02 20:48:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:11,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:11,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:11,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:11,968 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 276 [2022-11-02 20:48:11,969 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-02 20:48:11,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:11,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 276 [2022-11-02 20:48:11,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:12,166 INFO L130 PetriNetUnfolder]: 205/965 cut-off events. [2022-11-02 20:48:12,166 INFO L131 PetriNetUnfolder]: For 167/181 co-relation queries the response was YES. [2022-11-02 20:48:12,172 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 5351 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-02 20:48:12,175 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 23 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2022-11-02 20:48:12,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 215 transitions, 544 flow [2022-11-02 20:48:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:48:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2022-11-02 20:48:12,178 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8514492753623188 [2022-11-02 20:48:12,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 705 transitions. [2022-11-02 20:48:12,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 705 transitions. [2022-11-02 20:48:12,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:12,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 705 transitions. [2022-11-02 20:48:12,180 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-02 20:48:12,182 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-02 20:48:12,182 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-02 20:48:12,182 INFO L175 Difference]: Start difference. First operand has 224 places, 210 transitions, 478 flow. Second operand 3 states and 705 transitions. [2022-11-02 20:48:12,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 215 transitions, 544 flow [2022-11-02 20:48:12,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 215 transitions, 537 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:48:12,188 INFO L231 Difference]: Finished difference. Result has 221 places, 209 transitions, 473 flow [2022-11-02 20:48:12,189 INFO L270 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-02 20:48:12,189 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -34 predicate places. [2022-11-02 20:48:12,189 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 209 transitions, 473 flow [2022-11-02 20:48:12,190 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-02 20:48:12,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:12,190 INFO L208 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-02 20:48:12,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:48:12,190 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-02 20:48:12,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1214767471, now seen corresponding path program 1 times [2022-11-02 20:48:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:12,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579060549] [2022-11-02 20:48:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:12,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:12,741 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-02 20:48:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:12,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579060549] [2022-11-02 20:48:12,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579060549] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:12,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910712263] [2022-11-02 20:48:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:12,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:12,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:12,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:12,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:48:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:12,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:48:12,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:13,538 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-02 20:48:13,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:13,948 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-02 20:48:13,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910712263] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:13,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:13,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-11-02 20:48:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126543289] [2022-11-02 20:48:13,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:48:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:48:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:48:13,954 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 276 [2022-11-02 20:48:13,958 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-02 20:48:13,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:13,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 276 [2022-11-02 20:48:13,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:14,511 INFO L130 PetriNetUnfolder]: 119/1030 cut-off events. [2022-11-02 20:48:14,511 INFO L131 PetriNetUnfolder]: For 155/183 co-relation queries the response was YES. [2022-11-02 20:48:14,517 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 5652 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-02 20:48:14,520 INFO L137 encePairwiseOnDemand]: 262/276 looper letters, 46 selfloop transitions, 12 changer transitions 13/240 dead transitions. [2022-11-02 20:48:14,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 240 transitions, 697 flow [2022-11-02 20:48:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:48:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:48:14,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2751 transitions. [2022-11-02 20:48:14,527 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7667224080267558 [2022-11-02 20:48:14,528 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2751 transitions. [2022-11-02 20:48:14,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2751 transitions. [2022-11-02 20:48:14,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:14,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2751 transitions. [2022-11-02 20:48:14,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 211.6153846153846) internal successors, (2751), 13 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,543 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:14,543 INFO L175 Difference]: Start difference. First operand has 221 places, 209 transitions, 473 flow. Second operand 13 states and 2751 transitions. [2022-11-02 20:48:14,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 240 transitions, 697 flow [2022-11-02 20:48:14,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 240 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:48:14,548 INFO L231 Difference]: Finished difference. Result has 237 places, 213 transitions, 534 flow [2022-11-02 20:48:14,549 INFO L270 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=534, PETRI_PLACES=237, PETRI_TRANSITIONS=213} [2022-11-02 20:48:14,549 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -18 predicate places. [2022-11-02 20:48:14,550 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 213 transitions, 534 flow [2022-11-02 20:48:14,551 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-02 20:48:14,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:14,552 INFO L208 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-02 20:48:14,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:14,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:48:14,777 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-02 20:48:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 380357526, now seen corresponding path program 2 times [2022-11-02 20:48:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:14,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926111903] [2022-11-02 20:48:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:14,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:15,455 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-02 20:48:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:15,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926111903] [2022-11-02 20:48:15,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926111903] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:15,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:15,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:48:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022751604] [2022-11-02 20:48:15,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:15,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:48:15,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:15,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:48:15,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:48:15,460 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 276 [2022-11-02 20:48:15,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 213 transitions, 534 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-02 20:48:15,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:15,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 276 [2022-11-02 20:48:15,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:16,774 INFO L130 PetriNetUnfolder]: 2179/4775 cut-off events. [2022-11-02 20:48:16,774 INFO L131 PetriNetUnfolder]: For 2594/2602 co-relation queries the response was YES. [2022-11-02 20:48:16,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10312 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 38629 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-02 20:48:16,953 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 87 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-02 20:48:16,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 256 transitions, 834 flow [2022-11-02 20:48:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:48:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:48:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1248 transitions. [2022-11-02 20:48:16,957 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2022-11-02 20:48:16,958 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1248 transitions. [2022-11-02 20:48:16,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1248 transitions. [2022-11-02 20:48:16,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:16,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1248 transitions. [2022-11-02 20:48:16,962 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-02 20:48:16,965 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-02 20:48:16,966 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-02 20:48:16,966 INFO L175 Difference]: Start difference. First operand has 237 places, 213 transitions, 534 flow. Second operand 6 states and 1248 transitions. [2022-11-02 20:48:16,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 256 transitions, 834 flow [2022-11-02 20:48:16,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 256 transitions, 805 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-11-02 20:48:16,973 INFO L231 Difference]: Finished difference. Result has 233 places, 212 transitions, 519 flow [2022-11-02 20:48:16,975 INFO L270 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-02 20:48:16,976 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -22 predicate places. [2022-11-02 20:48:16,976 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 212 transitions, 519 flow [2022-11-02 20:48:16,976 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-02 20:48:16,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:48:16,977 INFO L208 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-02 20:48:16,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:48:16,978 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-02 20:48:16,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:16,978 INFO L85 PathProgramCache]: Analyzing trace with hash -515209570, now seen corresponding path program 1 times [2022-11-02 20:48:16,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:16,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306468967] [2022-11-02 20:48:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:17,084 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-02 20:48:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306468967] [2022-11-02 20:48:17,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306468967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:17,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:48:17,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:48:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666667104] [2022-11-02 20:48:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:17,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:48:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:48:17,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:48:17,087 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 276 [2022-11-02 20:48:17,088 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-02 20:48:17,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:48:17,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 276 [2022-11-02 20:48:17,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:48:17,312 INFO L130 PetriNetUnfolder]: 145/910 cut-off events. [2022-11-02 20:48:17,312 INFO L131 PetriNetUnfolder]: For 251/275 co-relation queries the response was YES. [2022-11-02 20:48:17,318 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 4894 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-02 20:48:17,319 INFO L137 encePairwiseOnDemand]: 274/276 looper letters, 0 selfloop transitions, 0 changer transitions 211/211 dead transitions. [2022-11-02 20:48:17,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 211 transitions, 549 flow [2022-11-02 20:48:17,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:48:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:48:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2022-11-02 20:48:17,322 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2022-11-02 20:48:17,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 702 transitions. [2022-11-02 20:48:17,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 702 transitions. [2022-11-02 20:48:17,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:48:17,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 702 transitions. [2022-11-02 20:48:17,325 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-02 20:48:17,326 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-02 20:48:17,327 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-02 20:48:17,327 INFO L175 Difference]: Start difference. First operand has 233 places, 212 transitions, 519 flow. Second operand 3 states and 702 transitions. [2022-11-02 20:48:17,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 211 transitions, 549 flow [2022-11-02 20:48:17,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 211 transitions, 542 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:48:17,332 INFO L231 Difference]: Finished difference. Result has 230 places, 0 transitions, 0 flow [2022-11-02 20:48:17,333 INFO L270 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-02 20:48:17,333 INFO L287 CegarLoopForPetriNet]: 255 programPoint places, -25 predicate places. [2022-11-02 20:48:17,333 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 0 transitions, 0 flow [2022-11-02 20:48:17,334 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-02 20:48:17,336 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2022-11-02 20:48:17,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2022-11-02 20:48:17,337 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2022-11-02 20:48:17,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2022-11-02 20:48:17,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2022-11-02 20:48:17,338 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2022-11-02 20:48:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2022-11-02 20:48:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2022-11-02 20:48:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2022-11-02 20:48:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2022-11-02 20:48:17,339 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2022-11-02 20:48:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2022-11-02 20:48:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2022-11-02 20:48:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2022-11-02 20:48:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2022-11-02 20:48:17,340 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2022-11-02 20:48:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2022-11-02 20:48:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2022-11-02 20:48:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2022-11-02 20:48:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2022-11-02 20:48:17,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2022-11-02 20:48:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2022-11-02 20:48:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2022-11-02 20:48:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2022-11-02 20:48:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2022-11-02 20:48:17,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2022-11-02 20:48:17,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2022-11-02 20:48:17,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2022-11-02 20:48:17,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2022-11-02 20:48:17,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2022-11-02 20:48:17,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2022-11-02 20:48:17,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2022-11-02 20:48:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2022-11-02 20:48:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2022-11-02 20:48:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2022-11-02 20:48:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2022-11-02 20:48:17,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2022-11-02 20:48:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2022-11-02 20:48:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2022-11-02 20:48:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2022-11-02 20:48:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2022-11-02 20:48:17,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2022-11-02 20:48:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2022-11-02 20:48:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2022-11-02 20:48:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (35 of 80 remaining) [2022-11-02 20:48:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2022-11-02 20:48:17,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2022-11-02 20:48:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 80 remaining) [2022-11-02 20:48:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2022-11-02 20:48:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2022-11-02 20:48:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2022-11-02 20:48:17,349 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2022-11-02 20:48:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2022-11-02 20:48:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2022-11-02 20:48:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2022-11-02 20:48:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2022-11-02 20:48:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2022-11-02 20:48:17,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2022-11-02 20:48:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2022-11-02 20:48:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2022-11-02 20:48:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2022-11-02 20:48:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2022-11-02 20:48:17,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2022-11-02 20:48:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2022-11-02 20:48:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2022-11-02 20:48:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2022-11-02 20:48:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2022-11-02 20:48:17,352 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2022-11-02 20:48:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2022-11-02 20:48:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2022-11-02 20:48:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2022-11-02 20:48:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2022-11-02 20:48:17,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2022-11-02 20:48:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2022-11-02 20:48:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2022-11-02 20:48:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2022-11-02 20:48:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2022-11-02 20:48:17,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2022-11-02 20:48:17,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2022-11-02 20:48:17,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2022-11-02 20:48:17,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:48:17,355 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-02 20:48:17,362 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:48:17,362 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:48:17,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:48:17 BasicIcfg [2022-11-02 20:48:17,368 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:48:17,369 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:48:17,369 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:48:17,370 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:48:17,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:55" (3/4) ... [2022-11-02 20:48:17,373 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:48:17,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:48:17,378 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:48:17,379 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:48:17,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-02 20:48:17,386 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:48:17,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:48:17,387 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:48:17,439 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:48:17,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:48:17,440 INFO L158 Benchmark]: Toolchain (without parser) took 24010.13ms. Allocated memory was 98.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 63.6MB in the beginning and 953.1MB in the end (delta: -889.5MB). Peak memory consumption was 272.5MB. Max. memory is 16.1GB. [2022-11-02 20:48:17,441 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 98.6MB. Free memory was 72.2MB in the beginning and 72.2MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:48:17,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.46ms. Allocated memory is still 98.6MB. Free memory was 63.4MB in the beginning and 71.4MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:48:17,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.21ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 68.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:48:17,442 INFO L158 Benchmark]: Boogie Preprocessor took 55.23ms. Allocated memory is still 98.6MB. Free memory was 68.5MB in the beginning and 65.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:48:17,442 INFO L158 Benchmark]: RCFGBuilder took 1223.99ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 49.4MB in the end (delta: 16.5MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2022-11-02 20:48:17,442 INFO L158 Benchmark]: TraceAbstraction took 22220.84ms. Allocated memory was 98.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.9MB in the beginning and 957.3MB in the end (delta: -908.4MB). Peak memory consumption was 254.4MB. Max. memory is 16.1GB. [2022-11-02 20:48:17,443 INFO L158 Benchmark]: Witness Printer took 70.49ms. Allocated memory is still 1.3GB. Free memory was 956.3MB in the beginning and 953.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-02 20:48:17,444 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 98.6MB. Free memory was 72.2MB in the beginning and 72.2MB in the end (delta: 27.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.46ms. Allocated memory is still 98.6MB. Free memory was 63.4MB in the beginning and 71.4MB in the end (delta: -8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.21ms. Allocated memory is still 98.6MB. Free memory was 71.4MB in the beginning and 68.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.23ms. Allocated memory is still 98.6MB. Free memory was 68.5MB in the beginning and 65.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1223.99ms. Allocated memory is still 98.6MB. Free memory was 65.9MB in the beginning and 49.4MB in the end (delta: 16.5MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22220.84ms. Allocated memory was 98.6MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.9MB in the beginning and 957.3MB in the end (delta: -908.4MB). Peak memory consumption was 254.4MB. Max. memory is 16.1GB. * Witness Printer took 70.49ms. Allocated memory is still 1.3GB. Free memory was 956.3MB in the beginning and 953.1MB in the end (delta: 3.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: 22.0s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 497 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 411 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2058 IncrementalHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 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=534occurred in iteration=18, InterpolantAutomatonStates: 92, 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.4s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2139 NumberOfCodeBlocks, 2139 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2275 ConstructedInterpolants, 0 QuantifiedInterpolants, 4327 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-02 20:48:17,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83e6bc5f-de3f-4418-85a3-401f920fb766/bin/uautomizer-Dbtcem3rbc/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