./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/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_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/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_3c85281d-0b67-4a6e-83d4-dcafe497a750/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 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:49:35,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:49:35,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:49:35,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:49:35,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:49:35,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:49:35,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:49:35,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:49:35,237 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:49:35,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:49:35,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:49:35,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:49:35,241 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:49:35,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:49:35,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:49:35,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:49:35,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:49:35,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:49:35,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:49:35,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:49:35,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:49:35,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:49:35,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:49:35,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:49:35,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:49:35,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:49:35,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:49:35,263 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:49:35,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:49:35,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:49:35,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:49:35,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:49:35,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:49:35,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:49:35,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:49:35,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:49:35,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:49:35,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:49:35,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:49:35,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:49:35,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:49:35,274 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:49:35,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:49:35,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:49:35,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:49:35,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:49:35,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:49:35,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:49:35,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:49:35,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:49:35,304 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:49:35,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:49:35,304 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:49:35,304 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:49:35,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:49:35,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:49:35,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:49:35,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:49:35,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:49:35,305 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:49:35,306 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:49:35,306 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:49:35,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:49:35,306 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:49:35,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:49:35,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:49:35,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:49:35,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:49:35,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:49:35,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:49:35,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:49:35,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:49:35,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:49:35,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:49:35,309 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:49:35,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:49:35,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:49:35,309 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_3c85281d-0b67-4a6e-83d4-dcafe497a750/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_3c85281d-0b67-4a6e-83d4-dcafe497a750/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 -> 4b8273370cd4ec5730806cf9b8f54c915e93daab6c48b9546d3920e402afdc55 [2022-11-02 20:49:35,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:49:35,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:49:35,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:49:35,587 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:49:35,588 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:49:35,589 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2022-11-02 20:49:35,649 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/data/ba3f67491/6f79f6e341f944daa7ae69488514ede4/FLAGcc9edfec9 [2022-11-02 20:49:36,114 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:49:36,114 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2022-11-02 20:49:36,123 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/data/ba3f67491/6f79f6e341f944daa7ae69488514ede4/FLAGcc9edfec9 [2022-11-02 20:49:36,493 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/data/ba3f67491/6f79f6e341f944daa7ae69488514ede4 [2022-11-02 20:49:36,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:49:36,498 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:49:36,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:49:36,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:49:36,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:49:36,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd256c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36, skipping insertion in model container [2022-11-02 20:49:36,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:49:36,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:49:36,752 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_3c85281d-0b67-4a6e-83d4-dcafe497a750/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-11-02 20:49:36,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:49:36,771 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:49:36,828 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_3c85281d-0b67-4a6e-83d4-dcafe497a750/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2691,2704] [2022-11-02 20:49:36,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:49:36,863 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:49:36,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36 WrapperNode [2022-11-02 20:49:36,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:49:36,871 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:49:36,871 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:49:36,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:49:36,880 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:49:36" (1/1) ... [2022-11-02 20:49:36,908 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:49:36" (1/1) ... [2022-11-02 20:49:36,940 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 214 [2022-11-02 20:49:36,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:49:36,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:49:36,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:49:36,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:49:36,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,957 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,987 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:36,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:49:36,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:49:36,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:49:36,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:49:36,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (1/1) ... [2022-11-02 20:49:37,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:49:37,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:37,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:49:37,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:49:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:49:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:49:37,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:49:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:49:37,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:49:37,091 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:49:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:49:37,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:49:37,092 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:49:37,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:49:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:49:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:49:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:49:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:49:37,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:49:37,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:49:37,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:49:37,096 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:49:37,289 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:49:37,291 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:49:38,104 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:49:38,309 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:49:38,310 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:49:38,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:38 BoogieIcfgContainer [2022-11-02 20:49:38,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:49:38,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:49:38,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:49:38,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:49:38,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:49:36" (1/3) ... [2022-11-02 20:49:38,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe77260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:38, skipping insertion in model container [2022-11-02 20:49:38,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:49:36" (2/3) ... [2022-11-02 20:49:38,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe77260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:49:38, skipping insertion in model container [2022-11-02 20:49:38,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:49:38" (3/3) ... [2022-11-02 20:49:38,329 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2022-11-02 20:49:38,342 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:49:38,370 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:49:38,370 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-11-02 20:49:38,371 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:49:38,477 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:49:38,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 352 places, 362 transitions, 748 flow [2022-11-02 20:49:38,646 INFO L130 PetriNetUnfolder]: 20/359 cut-off events. [2022-11-02 20:49:38,646 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:49:38,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 359 events. 20/359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 439 event pairs, 0 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 284. Up to 3 conditions per place. [2022-11-02 20:49:38,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 352 places, 362 transitions, 748 flow [2022-11-02 20:49:38,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 339 transitions, 696 flow [2022-11-02 20:49:38,673 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:49:38,680 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;@26550379, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:49:38,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-02 20:49:38,686 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-11-02 20:49:38,686 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:49:38,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:38,687 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] [2022-11-02 20:49:38,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1303378583, now seen corresponding path program 1 times [2022-11-02 20:49:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:38,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45999411] [2022-11-02 20:49:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:38,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:38,929 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:49:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:38,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45999411] [2022-11-02 20:49:38,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45999411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:38,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:38,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:38,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99431267] [2022-11-02 20:49:38,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:38,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:38,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:38,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:38,983 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 362 [2022-11-02 20:49:38,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 339 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:38,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:38,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 362 [2022-11-02 20:49:38,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:39,612 INFO L130 PetriNetUnfolder]: 380/1345 cut-off events. [2022-11-02 20:49:39,612 INFO L131 PetriNetUnfolder]: For 161/314 co-relation queries the response was YES. [2022-11-02 20:49:39,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1345 events. 380/1345 cut-off events. For 161/314 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7878 event pairs, 255 based on Foata normal form. 9/1050 useless extension candidates. Maximal degree in co-relation 1630. Up to 542 conditions per place. [2022-11-02 20:49:39,634 INFO L137 encePairwiseOnDemand]: 335/362 looper letters, 30 selfloop transitions, 2 changer transitions 6/314 dead transitions. [2022-11-02 20:49:39,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 710 flow [2022-11-02 20:49:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:49:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2022-11-02 20:49:39,661 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8895027624309392 [2022-11-02 20:49:39,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 966 transitions. [2022-11-02 20:49:39,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 966 transitions. [2022-11-02 20:49:39,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:39,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 966 transitions. [2022-11-02 20:49:39,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.0) internal successors, (966), 3 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,691 INFO L175 Difference]: Start difference. First operand has 330 places, 339 transitions, 696 flow. Second operand 3 states and 966 transitions. [2022-11-02 20:49:39,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 710 flow [2022-11-02 20:49:39,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 314 transitions, 698 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:49:39,709 INFO L231 Difference]: Finished difference. Result has 313 places, 308 transitions, 626 flow [2022-11-02 20:49:39,712 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=313, PETRI_TRANSITIONS=308} [2022-11-02 20:49:39,719 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -17 predicate places. [2022-11-02 20:49:39,720 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 308 transitions, 626 flow [2022-11-02 20:49:39,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.3333333333333) internal successors, (913), 3 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:39,721 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:49:39,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:49:39,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:39,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:39,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1481128444, now seen corresponding path program 1 times [2022-11-02 20:49:39,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:39,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940616165] [2022-11-02 20:49:39,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:39,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940616165] [2022-11-02 20:49:39,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940616165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:39,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:39,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:39,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048758409] [2022-11-02 20:49:39,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:39,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:39,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:39,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:39,823 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 362 [2022-11-02 20:49:39,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 308 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:39,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:39,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 362 [2022-11-02 20:49:39,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:40,171 INFO L130 PetriNetUnfolder]: 213/996 cut-off events. [2022-11-02 20:49:40,171 INFO L131 PetriNetUnfolder]: For 27/107 co-relation queries the response was YES. [2022-11-02 20:49:40,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 996 events. 213/996 cut-off events. For 27/107 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5244 event pairs, 128 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1279. Up to 297 conditions per place. [2022-11-02 20:49:40,182 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 22 selfloop transitions, 1 changer transitions 0/302 dead transitions. [2022-11-02 20:49:40,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 660 flow [2022-11-02 20:49:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:49:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2022-11-02 20:49:40,186 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8720073664825047 [2022-11-02 20:49:40,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 947 transitions. [2022-11-02 20:49:40,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 947 transitions. [2022-11-02 20:49:40,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:40,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 947 transitions. [2022-11-02 20:49:40,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,194 INFO L175 Difference]: Start difference. First operand has 313 places, 308 transitions, 626 flow. Second operand 3 states and 947 transitions. [2022-11-02 20:49:40,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 660 flow [2022-11-02 20:49:40,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:49:40,204 INFO L231 Difference]: Finished difference. Result has 301 places, 302 transitions, 612 flow [2022-11-02 20:49:40,205 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=301, PETRI_TRANSITIONS=302} [2022-11-02 20:49:40,206 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-02 20:49:40,206 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 302 transitions, 612 flow [2022-11-02 20:49:40,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 307.3333333333333) internal successors, (922), 3 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:40,208 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] [2022-11-02 20:49:40,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:49:40,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:40,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1973439662, now seen corresponding path program 1 times [2022-11-02 20:49:40,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:40,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402192391] [2022-11-02 20:49:40,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:40,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:40,354 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:49:40,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:40,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402192391] [2022-11-02 20:49:40,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402192391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:40,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:40,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:40,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693913766] [2022-11-02 20:49:40,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:40,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:40,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:40,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:40,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:40,362 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-02 20:49:40,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:40,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-02 20:49:40,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:40,626 INFO L130 PetriNetUnfolder]: 94/832 cut-off events. [2022-11-02 20:49:40,626 INFO L131 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2022-11-02 20:49:40,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 832 events. 94/832 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4078 event pairs, 45 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 945. Up to 131 conditions per place. [2022-11-02 20:49:40,636 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 15 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2022-11-02 20:49:40,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 301 transitions, 644 flow [2022-11-02 20:49:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:49:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2022-11-02 20:49:40,642 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8950276243093923 [2022-11-02 20:49:40,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2022-11-02 20:49:40,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2022-11-02 20:49:40,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:40,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2022-11-02 20:49:40,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,650 INFO L175 Difference]: Start difference. First operand has 301 places, 302 transitions, 612 flow. Second operand 3 states and 972 transitions. [2022-11-02 20:49:40,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 301 transitions, 644 flow [2022-11-02 20:49:40,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 301 transitions, 643 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:49:40,657 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 613 flow [2022-11-02 20:49:40,658 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2022-11-02 20:49:40,660 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-02 20:49:40,661 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 613 flow [2022-11-02 20:49:40,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:40,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:40,662 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] [2022-11-02 20:49:40,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:49:40,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 245285443, now seen corresponding path program 1 times [2022-11-02 20:49:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:40,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153470981] [2022-11-02 20:49:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:41,332 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:49:41,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:41,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153470981] [2022-11-02 20:49:41,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153470981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:41,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:41,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:49:41,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048812209] [2022-11-02 20:49:41,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:41,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:41,343 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 362 [2022-11-02 20:49:41,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:41,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:41,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 362 [2022-11-02 20:49:41,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:42,590 INFO L130 PetriNetUnfolder]: 1533/3735 cut-off events. [2022-11-02 20:49:42,590 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:49:42,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6001 conditions, 3735 events. 1533/3735 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 25981 event pairs, 1176 based on Foata normal form. 0/3209 useless extension candidates. Maximal degree in co-relation 5966. Up to 2206 conditions per place. [2022-11-02 20:49:42,666 INFO L137 encePairwiseOnDemand]: 344/362 looper letters, 72 selfloop transitions, 15 changer transitions 0/298 dead transitions. [2022-11-02 20:49:42,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 298 transitions, 781 flow [2022-11-02 20:49:42,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:49:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:49:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1566 transitions. [2022-11-02 20:49:42,671 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7209944751381215 [2022-11-02 20:49:42,672 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1566 transitions. [2022-11-02 20:49:42,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1566 transitions. [2022-11-02 20:49:42,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:42,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1566 transitions. [2022-11-02 20:49:42,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 261.0) internal successors, (1566), 6 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:42,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:42,685 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:42,685 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 613 flow. Second operand 6 states and 1566 transitions. [2022-11-02 20:49:42,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 298 transitions, 781 flow [2022-11-02 20:49:42,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 777 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:49:42,693 INFO L231 Difference]: Finished difference. Result has 301 places, 298 transitions, 633 flow [2022-11-02 20:49:42,694 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=633, PETRI_PLACES=301, PETRI_TRANSITIONS=298} [2022-11-02 20:49:42,695 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -29 predicate places. [2022-11-02 20:49:42,695 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 298 transitions, 633 flow [2022-11-02 20:49:42,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:42,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:42,697 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] [2022-11-02 20:49:42,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:49:42,698 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash 928307443, now seen corresponding path program 1 times [2022-11-02 20:49:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:42,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526197298] [2022-11-02 20:49:42,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:42,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:49:42,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:42,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526197298] [2022-11-02 20:49:42,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526197298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:42,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:42,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:42,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355309537] [2022-11-02 20:49:42,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:42,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:42,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:42,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:42,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:42,765 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-02 20:49:42,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 298 transitions, 633 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:42,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:42,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-02 20:49:42,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:43,105 INFO L130 PetriNetUnfolder]: 94/912 cut-off events. [2022-11-02 20:49:43,106 INFO L131 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2022-11-02 20:49:43,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 912 events. 94/912 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4369 event pairs, 45 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 1040. Up to 131 conditions per place. [2022-11-02 20:49:43,116 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 15 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2022-11-02 20:49:43,116 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 297 transitions, 665 flow [2022-11-02 20:49:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:49:43,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2022-11-02 20:49:43,119 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8950276243093923 [2022-11-02 20:49:43,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 972 transitions. [2022-11-02 20:49:43,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 972 transitions. [2022-11-02 20:49:43,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:43,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 972 transitions. [2022-11-02 20:49:43,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,127 INFO L175 Difference]: Start difference. First operand has 301 places, 298 transitions, 633 flow. Second operand 3 states and 972 transitions. [2022-11-02 20:49:43,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 297 transitions, 665 flow [2022-11-02 20:49:43,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 297 transitions, 635 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:49:43,134 INFO L231 Difference]: Finished difference. Result has 297 places, 297 transitions, 605 flow [2022-11-02 20:49:43,135 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=297, PETRI_TRANSITIONS=297} [2022-11-02 20:49:43,135 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -33 predicate places. [2022-11-02 20:49:43,136 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 297 transitions, 605 flow [2022-11-02 20:49:43,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:43,137 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] [2022-11-02 20:49:43,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:49:43,138 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash -986290866, now seen corresponding path program 1 times [2022-11-02 20:49:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:43,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568387789] [2022-11-02 20:49:43,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:43,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:43,244 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:49:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:43,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568387789] [2022-11-02 20:49:43,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568387789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:43,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:43,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768977538] [2022-11-02 20:49:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:43,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:43,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:43,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:43,249 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-02 20:49:43,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 297 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:43,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-02 20:49:43,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:43,414 INFO L130 PetriNetUnfolder]: 35/400 cut-off events. [2022-11-02 20:49:43,415 INFO L131 PetriNetUnfolder]: For 14/17 co-relation queries the response was YES. [2022-11-02 20:49:43,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 400 events. 35/400 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 933 event pairs, 12 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 423. Up to 48 conditions per place. [2022-11-02 20:49:43,419 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-11-02 20:49:43,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 296 transitions, 631 flow [2022-11-02 20:49:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:49:43,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 978 transitions. [2022-11-02 20:49:43,422 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9005524861878453 [2022-11-02 20:49:43,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 978 transitions. [2022-11-02 20:49:43,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 978 transitions. [2022-11-02 20:49:43,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:43,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 978 transitions. [2022-11-02 20:49:43,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,428 INFO L175 Difference]: Start difference. First operand has 297 places, 297 transitions, 605 flow. Second operand 3 states and 978 transitions. [2022-11-02 20:49:43,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 296 transitions, 631 flow [2022-11-02 20:49:43,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:49:43,434 INFO L231 Difference]: Finished difference. Result has 296 places, 296 transitions, 603 flow [2022-11-02 20:49:43,435 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=296, PETRI_TRANSITIONS=296} [2022-11-02 20:49:43,435 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -34 predicate places. [2022-11-02 20:49:43,435 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 296 transitions, 603 flow [2022-11-02 20:49:43,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:43,437 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] [2022-11-02 20:49:43,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:49:43,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash -390066838, now seen corresponding path program 1 times [2022-11-02 20:49:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:43,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411476067] [2022-11-02 20:49:43,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:43,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:43,500 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:49:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:43,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411476067] [2022-11-02 20:49:43,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411476067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:43,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:43,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:43,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743426551] [2022-11-02 20:49:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:43,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:43,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:43,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:43,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:43,504 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-02 20:49:43,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 296 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:43,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-02 20:49:43,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:43,837 INFO L130 PetriNetUnfolder]: 119/893 cut-off events. [2022-11-02 20:49:43,837 INFO L131 PetriNetUnfolder]: For 20/25 co-relation queries the response was YES. [2022-11-02 20:49:43,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1093 conditions, 893 events. 119/893 cut-off events. For 20/25 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4446 event pairs, 45 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 1058. Up to 120 conditions per place. [2022-11-02 20:49:43,845 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 18 selfloop transitions, 3 changer transitions 0/299 dead transitions. [2022-11-02 20:49:43,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 299 transitions, 653 flow [2022-11-02 20:49:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:43,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:49:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2022-11-02 20:49:43,848 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8996316758747698 [2022-11-02 20:49:43,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 977 transitions. [2022-11-02 20:49:43,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 977 transitions. [2022-11-02 20:49:43,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:43,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 977 transitions. [2022-11-02 20:49:43,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,855 INFO L175 Difference]: Start difference. First operand has 296 places, 296 transitions, 603 flow. Second operand 3 states and 977 transitions. [2022-11-02 20:49:43,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 299 transitions, 653 flow [2022-11-02 20:49:43,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 299 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:49:43,861 INFO L231 Difference]: Finished difference. Result has 294 places, 294 transitions, 601 flow [2022-11-02 20:49:43,862 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=294} [2022-11-02 20:49:43,863 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -36 predicate places. [2022-11-02 20:49:43,863 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 294 transitions, 601 flow [2022-11-02 20:49:43,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:43,864 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] [2022-11-02 20:49:43,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:49:43,865 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1192045716, now seen corresponding path program 1 times [2022-11-02 20:49:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:43,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600976014] [2022-11-02 20:49:43,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:43,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:43,928 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:49:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:43,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600976014] [2022-11-02 20:49:43,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600976014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:43,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:43,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:49:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940681917] [2022-11-02 20:49:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:49:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:49:43,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:49:43,932 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-02 20:49:43,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 294 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:43,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:43,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-02 20:49:43,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:44,178 INFO L130 PetriNetUnfolder]: 84/837 cut-off events. [2022-11-02 20:49:44,178 INFO L131 PetriNetUnfolder]: For 25/30 co-relation queries the response was YES. [2022-11-02 20:49:44,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 837 events. 84/837 cut-off events. For 25/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3968 event pairs, 8 based on Foata normal form. 1/749 useless extension candidates. Maximal degree in co-relation 954. Up to 102 conditions per place. [2022-11-02 20:49:44,186 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 20 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-02 20:49:44,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 302 transitions, 666 flow [2022-11-02 20:49:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:49:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:49:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 986 transitions. [2022-11-02 20:49:44,189 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9079189686924494 [2022-11-02 20:49:44,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 986 transitions. [2022-11-02 20:49:44,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 986 transitions. [2022-11-02 20:49:44,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:44,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 986 transitions. [2022-11-02 20:49:44,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.6666666666667) internal successors, (986), 3 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:44,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:44,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:44,196 INFO L175 Difference]: Start difference. First operand has 294 places, 294 transitions, 601 flow. Second operand 3 states and 986 transitions. [2022-11-02 20:49:44,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 302 transitions, 666 flow [2022-11-02 20:49:44,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 302 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:49:44,202 INFO L231 Difference]: Finished difference. Result has 294 places, 295 transitions, 607 flow [2022-11-02 20:49:44,203 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2022-11-02 20:49:44,204 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -36 predicate places. [2022-11-02 20:49:44,204 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 607 flow [2022-11-02 20:49:44,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:44,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:44,205 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] [2022-11-02 20:49:44,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:49:44,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:44,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:44,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2023219472, now seen corresponding path program 1 times [2022-11-02 20:49:44,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:44,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861109786] [2022-11-02 20:49:44,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:44,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:44,417 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:49:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861109786] [2022-11-02 20:49:44,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861109786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:44,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:44,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:49:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934098944] [2022-11-02 20:49:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:44,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:49:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:44,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:49:44,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:44,421 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 362 [2022-11-02 20:49:44,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:44,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:44,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 362 [2022-11-02 20:49:44,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:46,414 INFO L130 PetriNetUnfolder]: 2045/5891 cut-off events. [2022-11-02 20:49:46,414 INFO L131 PetriNetUnfolder]: For 328/417 co-relation queries the response was YES. [2022-11-02 20:49:46,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9416 conditions, 5891 events. 2045/5891 cut-off events. For 328/417 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 45896 event pairs, 968 based on Foata normal form. 2/4763 useless extension candidates. Maximal degree in co-relation 9379. Up to 2066 conditions per place. [2022-11-02 20:49:46,464 INFO L137 encePairwiseOnDemand]: 343/362 looper letters, 196 selfloop transitions, 28 changer transitions 0/433 dead transitions. [2022-11-02 20:49:46,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 433 transitions, 1367 flow [2022-11-02 20:49:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:49:46,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:49:46,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2949 transitions. [2022-11-02 20:49:46,471 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7405826217980914 [2022-11-02 20:49:46,472 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2949 transitions. [2022-11-02 20:49:46,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2949 transitions. [2022-11-02 20:49:46,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:46,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2949 transitions. [2022-11-02 20:49:46,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 268.09090909090907) internal successors, (2949), 11 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:46,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:46,490 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:46,491 INFO L175 Difference]: Start difference. First operand has 294 places, 295 transitions, 607 flow. Second operand 11 states and 2949 transitions. [2022-11-02 20:49:46,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 433 transitions, 1367 flow [2022-11-02 20:49:46,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 433 transitions, 1367 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:49:46,576 INFO L231 Difference]: Finished difference. Result has 308 places, 312 transitions, 740 flow [2022-11-02 20:49:46,576 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=740, PETRI_PLACES=308, PETRI_TRANSITIONS=312} [2022-11-02 20:49:46,577 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -22 predicate places. [2022-11-02 20:49:46,577 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 312 transitions, 740 flow [2022-11-02 20:49:46,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:46,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:46,578 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] [2022-11-02 20:49:46,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:49:46,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:46,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:46,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1104760021, now seen corresponding path program 1 times [2022-11-02 20:49:46,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:46,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214755887] [2022-11-02 20:49:46,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:46,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:46,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:47,196 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:49:47,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:47,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214755887] [2022-11-02 20:49:47,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214755887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:47,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:47,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:49:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406729346] [2022-11-02 20:49:47,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:47,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:47,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:47,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:47,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:47,200 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-02 20:49:47,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 312 transitions, 740 flow. Second operand has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:47,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:47,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-02 20:49:47,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:49,988 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][230], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 273#L97-1true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:49,988 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-02 20:49:49,989 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-02 20:49:49,989 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-02 20:49:49,989 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 20:49:49,990 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][259], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 73#L97-3true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:49,990 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-02 20:49:49,990 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-02 20:49:49,990 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-02 20:49:49,990 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-02 20:49:49,991 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][260], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 90#L97-4true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:49,991 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-02 20:49:49,991 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-02 20:49:49,992 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-02 20:49:49,992 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-02 20:49:49,993 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][261], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 155#L97-2true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:49,993 INFO L383 tUnfolder$Statistics]: this new event has 243 ancestors and is cut-off event [2022-11-02 20:49:49,993 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-02 20:49:49,993 INFO L386 tUnfolder$Statistics]: existing Event has 212 ancestors and is cut-off event [2022-11-02 20:49:49,993 INFO L386 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-11-02 20:49:49,994 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 417#true, 7#L97-6true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:49,994 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:49:49,994 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 20:49:49,994 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-02 20:49:49,994 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-02 20:49:49,995 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 47#L73true, 36#L97-5true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:49,995 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-02 20:49:49,995 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-02 20:49:49,996 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-02 20:49:49,996 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-02 20:49:50,010 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][230], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 273#L97-1true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:50,011 INFO L383 tUnfolder$Statistics]: this new event has 244 ancestors and is cut-off event [2022-11-02 20:49:50,011 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-02 20:49:50,011 INFO L386 tUnfolder$Statistics]: existing Event has 206 ancestors and is cut-off event [2022-11-02 20:49:50,011 INFO L386 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-11-02 20:49:50,012 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][259], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 73#L97-3true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:50,012 INFO L383 tUnfolder$Statistics]: this new event has 246 ancestors and is cut-off event [2022-11-02 20:49:50,012 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-02 20:49:50,012 INFO L386 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-11-02 20:49:50,012 INFO L386 tUnfolder$Statistics]: existing Event has 215 ancestors and is cut-off event [2022-11-02 20:49:50,013 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][260], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 90#L97-4true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:50,013 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:49:50,013 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-02 20:49:50,014 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 20:49:50,014 INFO L386 tUnfolder$Statistics]: existing Event has 216 ancestors and is cut-off event [2022-11-02 20:49:50,014 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][261], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 155#L97-2true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:50,015 INFO L383 tUnfolder$Statistics]: this new event has 245 ancestors and is cut-off event [2022-11-02 20:49:50,015 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-02 20:49:50,015 INFO L386 tUnfolder$Statistics]: existing Event has 214 ancestors and is cut-off event [2022-11-02 20:49:50,015 INFO L386 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-11-02 20:49:50,016 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 36#L97-5true, 417#true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:50,016 INFO L383 tUnfolder$Statistics]: this new event has 248 ancestors and is cut-off event [2022-11-02 20:49:50,016 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-02 20:49:50,016 INFO L386 tUnfolder$Statistics]: existing Event has 217 ancestors and is cut-off event [2022-11-02 20:49:50,016 INFO L386 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-11-02 20:49:50,017 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][262], [Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 361#(= |#race~N~0| 0), 224#L62true, Black: 386#true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 417#true, 7#L97-6true, 46#L50-3true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, 388#(= |#race~A~0| 0), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0))]) [2022-11-02 20:49:50,017 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:49:50,017 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-02 20:49:50,017 INFO L386 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-11-02 20:49:50,018 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-02 20:49:50,066 INFO L130 PetriNetUnfolder]: 2820/7139 cut-off events. [2022-11-02 20:49:50,067 INFO L131 PetriNetUnfolder]: For 1311/1341 co-relation queries the response was YES. [2022-11-02 20:49:50,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12944 conditions, 7139 events. 2820/7139 cut-off events. For 1311/1341 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 54944 event pairs, 537 based on Foata normal form. 24/6584 useless extension candidates. Maximal degree in co-relation 12900. Up to 2540 conditions per place. [2022-11-02 20:49:50,142 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 129 selfloop transitions, 13 changer transitions 0/395 dead transitions. [2022-11-02 20:49:50,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 395 transitions, 1213 flow [2022-11-02 20:49:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:49:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:49:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1776 transitions. [2022-11-02 20:49:50,147 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8176795580110497 [2022-11-02 20:49:50,148 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1776 transitions. [2022-11-02 20:49:50,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1776 transitions. [2022-11-02 20:49:50,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:50,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1776 transitions. [2022-11-02 20:49:50,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,166 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,167 INFO L175 Difference]: Start difference. First operand has 308 places, 312 transitions, 740 flow. Second operand 6 states and 1776 transitions. [2022-11-02 20:49:50,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 395 transitions, 1213 flow [2022-11-02 20:49:50,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 395 transitions, 1208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:49:50,179 INFO L231 Difference]: Finished difference. Result has 316 places, 324 transitions, 845 flow [2022-11-02 20:49:50,180 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=845, PETRI_PLACES=316, PETRI_TRANSITIONS=324} [2022-11-02 20:49:50,182 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -14 predicate places. [2022-11-02 20:49:50,182 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 324 transitions, 845 flow [2022-11-02 20:49:50,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:50,184 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:49:50,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:49:50,185 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425965, now seen corresponding path program 1 times [2022-11-02 20:49:50,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:50,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276832392] [2022-11-02 20:49:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:50,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:50,436 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:49:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:50,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276832392] [2022-11-02 20:49:50,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276832392] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:50,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:50,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:49:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851215217] [2022-11-02 20:49:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:50,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:49:50,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:50,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:49:50,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:49:50,441 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 362 [2022-11-02 20:49:50,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 324 transitions, 845 flow. Second operand has 7 states, 7 states have (on average 266.57142857142856) internal successors, (1866), 7 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:50,443 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:50,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 362 [2022-11-02 20:49:50,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:52,400 INFO L130 PetriNetUnfolder]: 2324/5495 cut-off events. [2022-11-02 20:49:52,400 INFO L131 PetriNetUnfolder]: For 3502/4137 co-relation queries the response was YES. [2022-11-02 20:49:52,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10935 conditions, 5495 events. 2324/5495 cut-off events. For 3502/4137 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 39820 event pairs, 1130 based on Foata normal form. 37/4428 useless extension candidates. Maximal degree in co-relation 10889. Up to 2836 conditions per place. [2022-11-02 20:49:52,485 INFO L137 encePairwiseOnDemand]: 343/362 looper letters, 178 selfloop transitions, 28 changer transitions 0/435 dead transitions. [2022-11-02 20:49:52,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 435 transitions, 1511 flow [2022-11-02 20:49:52,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:49:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-02 20:49:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3081 transitions. [2022-11-02 20:49:52,495 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7737317930688097 [2022-11-02 20:49:52,495 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3081 transitions. [2022-11-02 20:49:52,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3081 transitions. [2022-11-02 20:49:52,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:52,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3081 transitions. [2022-11-02 20:49:52,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 280.09090909090907) internal successors, (3081), 11 states have internal predecessors, (3081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:52,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:52,516 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 362.0) internal successors, (4344), 12 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:52,516 INFO L175 Difference]: Start difference. First operand has 316 places, 324 transitions, 845 flow. Second operand 11 states and 3081 transitions. [2022-11-02 20:49:52,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 435 transitions, 1511 flow [2022-11-02 20:49:52,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 435 transitions, 1511 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:49:52,533 INFO L231 Difference]: Finished difference. Result has 328 places, 326 transitions, 913 flow [2022-11-02 20:49:52,534 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=913, PETRI_PLACES=328, PETRI_TRANSITIONS=326} [2022-11-02 20:49:52,535 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -2 predicate places. [2022-11-02 20:49:52,535 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 326 transitions, 913 flow [2022-11-02 20:49:52,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 266.57142857142856) internal successors, (1866), 7 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:52,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:52,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:49:52,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:49:52,537 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1050914677, now seen corresponding path program 1 times [2022-11-02 20:49:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:52,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287333789] [2022-11-02 20:49:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:53,316 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:49:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:53,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287333789] [2022-11-02 20:49:53,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287333789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:53,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:53,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:49:53,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708903420] [2022-11-02 20:49:53,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:53,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:53,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:53,321 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-02 20:49:53,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 326 transitions, 913 flow. Second operand has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:53,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:53,324 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-02 20:49:53,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:55,658 INFO L130 PetriNetUnfolder]: 2259/7129 cut-off events. [2022-11-02 20:49:55,658 INFO L131 PetriNetUnfolder]: For 5284/5389 co-relation queries the response was YES. [2022-11-02 20:49:55,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14516 conditions, 7129 events. 2259/7129 cut-off events. For 5284/5389 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 63377 event pairs, 1240 based on Foata normal form. 12/6638 useless extension candidates. Maximal degree in co-relation 14465. Up to 3011 conditions per place. [2022-11-02 20:49:55,737 INFO L137 encePairwiseOnDemand]: 355/362 looper letters, 86 selfloop transitions, 17 changer transitions 0/358 dead transitions. [2022-11-02 20:49:55,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 358 transitions, 1253 flow [2022-11-02 20:49:55,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:49:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:49:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2022-11-02 20:49:55,742 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7923572744014733 [2022-11-02 20:49:55,743 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2022-11-02 20:49:55,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2022-11-02 20:49:55,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:55,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2022-11-02 20:49:55,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:55,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:55,752 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:55,752 INFO L175 Difference]: Start difference. First operand has 328 places, 326 transitions, 913 flow. Second operand 6 states and 1721 transitions. [2022-11-02 20:49:55,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 358 transitions, 1253 flow [2022-11-02 20:49:55,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 358 transitions, 1228 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:49:55,771 INFO L231 Difference]: Finished difference. Result has 333 places, 342 transitions, 1072 flow [2022-11-02 20:49:55,772 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1072, PETRI_PLACES=333, PETRI_TRANSITIONS=342} [2022-11-02 20:49:55,775 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, 3 predicate places. [2022-11-02 20:49:55,775 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 342 transitions, 1072 flow [2022-11-02 20:49:55,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:55,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:55,776 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, 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:49:55,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:49:55,777 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:55,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1654158590, now seen corresponding path program 1 times [2022-11-02 20:49:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:55,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996394407] [2022-11-02 20:49:55,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:55,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:56,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:56,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996394407] [2022-11-02 20:49:56,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996394407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:56,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:56,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:49:56,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799440775] [2022-11-02 20:49:56,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:56,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:56,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:56,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:56,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:56,437 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 362 [2022-11-02 20:49:56,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 342 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:56,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:56,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 362 [2022-11-02 20:49:56,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:49:58,455 INFO L130 PetriNetUnfolder]: 2278/7172 cut-off events. [2022-11-02 20:49:58,455 INFO L131 PetriNetUnfolder]: For 7573/7714 co-relation queries the response was YES. [2022-11-02 20:49:58,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15476 conditions, 7172 events. 2278/7172 cut-off events. For 7573/7714 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 63727 event pairs, 1321 based on Foata normal form. 0/6685 useless extension candidates. Maximal degree in co-relation 15423. Up to 3204 conditions per place. [2022-11-02 20:49:58,628 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 90 selfloop transitions, 4 changer transitions 0/349 dead transitions. [2022-11-02 20:49:58,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 349 transitions, 1274 flow [2022-11-02 20:49:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:49:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:49:58,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1704 transitions. [2022-11-02 20:49:58,632 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7845303867403315 [2022-11-02 20:49:58,632 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1704 transitions. [2022-11-02 20:49:58,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1704 transitions. [2022-11-02 20:49:58,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:49:58,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1704 transitions. [2022-11-02 20:49:58,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.0) internal successors, (1704), 6 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:58,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:58,640 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:58,641 INFO L175 Difference]: Start difference. First operand has 333 places, 342 transitions, 1072 flow. Second operand 6 states and 1704 transitions. [2022-11-02 20:49:58,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 349 transitions, 1274 flow [2022-11-02 20:49:58,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 349 transitions, 1274 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:49:58,661 INFO L231 Difference]: Finished difference. Result has 337 places, 341 transitions, 1078 flow [2022-11-02 20:49:58,661 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1078, PETRI_PLACES=337, PETRI_TRANSITIONS=341} [2022-11-02 20:49:58,662 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, 7 predicate places. [2022-11-02 20:49:58,663 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 341 transitions, 1078 flow [2022-11-02 20:49:58,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:58,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:49:58,664 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, 1, 1, 1, 1, 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:49:58,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:49:58,664 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:49:58,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:58,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1497435077, now seen corresponding path program 1 times [2022-11-02 20:49:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:58,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607083773] [2022-11-02 20:49:58,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:49:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:59,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607083773] [2022-11-02 20:49:59,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607083773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:59,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:59,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:49:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096296574] [2022-11-02 20:49:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:59,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:49:59,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:49:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:49:59,275 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 362 [2022-11-02 20:49:59,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 341 transitions, 1078 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:49:59,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:49:59,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 362 [2022-11-02 20:49:59,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:02,636 INFO L130 PetriNetUnfolder]: 4571/12219 cut-off events. [2022-11-02 20:50:02,636 INFO L131 PetriNetUnfolder]: For 14795/15254 co-relation queries the response was YES. [2022-11-02 20:50:02,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28561 conditions, 12219 events. 4571/12219 cut-off events. For 14795/15254 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 113968 event pairs, 1236 based on Foata normal form. 21/11704 useless extension candidates. Maximal degree in co-relation 28508. Up to 4740 conditions per place. [2022-11-02 20:50:02,766 INFO L137 encePairwiseOnDemand]: 354/362 looper letters, 156 selfloop transitions, 26 changer transitions 0/430 dead transitions. [2022-11-02 20:50:02,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 430 transitions, 1876 flow [2022-11-02 20:50:02,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:50:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:50:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1740 transitions. [2022-11-02 20:50:02,771 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8011049723756906 [2022-11-02 20:50:02,771 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1740 transitions. [2022-11-02 20:50:02,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1740 transitions. [2022-11-02 20:50:02,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:02,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1740 transitions. [2022-11-02 20:50:02,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:02,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:02,780 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:02,780 INFO L175 Difference]: Start difference. First operand has 337 places, 341 transitions, 1078 flow. Second operand 6 states and 1740 transitions. [2022-11-02 20:50:02,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 430 transitions, 1876 flow [2022-11-02 20:50:02,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 430 transitions, 1869 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:50:02,906 INFO L231 Difference]: Finished difference. Result has 343 places, 366 transitions, 1375 flow [2022-11-02 20:50:02,906 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1375, PETRI_PLACES=343, PETRI_TRANSITIONS=366} [2022-11-02 20:50:02,907 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2022-11-02 20:50:02,907 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 366 transitions, 1375 flow [2022-11-02 20:50:02,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:02,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:02,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:50:02,908 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:02,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2019895496, now seen corresponding path program 1 times [2022-11-02 20:50:02,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:02,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654740465] [2022-11-02 20:50:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:02,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:50:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:02,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654740465] [2022-11-02 20:50:02,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654740465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:02,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:02,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:02,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262328940] [2022-11-02 20:50:02,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:02,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:02,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:02,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:02,990 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 362 [2022-11-02 20:50:02,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 366 transitions, 1375 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:02,991 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:02,991 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 362 [2022-11-02 20:50:02,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:04,330 INFO L130 PetriNetUnfolder]: 1650/5708 cut-off events. [2022-11-02 20:50:04,331 INFO L131 PetriNetUnfolder]: For 15727/15919 co-relation queries the response was YES. [2022-11-02 20:50:04,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14626 conditions, 5708 events. 1650/5708 cut-off events. For 15727/15919 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 49913 event pairs, 335 based on Foata normal form. 0/5409 useless extension candidates. Maximal degree in co-relation 14570. Up to 1509 conditions per place. [2022-11-02 20:50:04,387 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 70 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2022-11-02 20:50:04,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 379 transitions, 1641 flow [2022-11-02 20:50:04,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2022-11-02 20:50:04,390 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8941068139963168 [2022-11-02 20:50:04,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2022-11-02 20:50:04,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2022-11-02 20:50:04,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:04,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2022-11-02 20:50:04,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:04,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:04,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:04,396 INFO L175 Difference]: Start difference. First operand has 343 places, 366 transitions, 1375 flow. Second operand 3 states and 971 transitions. [2022-11-02 20:50:04,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 379 transitions, 1641 flow [2022-11-02 20:50:04,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 379 transitions, 1571 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:04,440 INFO L231 Difference]: Finished difference. Result has 344 places, 365 transitions, 1321 flow [2022-11-02 20:50:04,442 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=344, PETRI_TRANSITIONS=365} [2022-11-02 20:50:04,442 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, 14 predicate places. [2022-11-02 20:50:04,442 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 365 transitions, 1321 flow [2022-11-02 20:50:04,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:04,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:04,443 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:04,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:50:04,444 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:04,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:04,444 INFO L85 PathProgramCache]: Analyzing trace with hash -639229830, now seen corresponding path program 1 times [2022-11-02 20:50:04,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:04,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138629414] [2022-11-02 20:50:04,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:04,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:04,517 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:50:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:04,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138629414] [2022-11-02 20:50:04,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138629414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:04,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:04,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:04,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607827761] [2022-11-02 20:50:04,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:04,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:04,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:04,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:04,524 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 362 [2022-11-02 20:50:04,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 365 transitions, 1321 flow. Second operand has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:04,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:04,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 362 [2022-11-02 20:50:04,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:05,632 INFO L130 PetriNetUnfolder]: 850/3428 cut-off events. [2022-11-02 20:50:05,633 INFO L131 PetriNetUnfolder]: For 6586/6690 co-relation queries the response was YES. [2022-11-02 20:50:05,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7721 conditions, 3428 events. 850/3428 cut-off events. For 6586/6690 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 27297 event pairs, 133 based on Foata normal form. 0/3101 useless extension candidates. Maximal degree in co-relation 7664. Up to 883 conditions per place. [2022-11-02 20:50:05,673 INFO L137 encePairwiseOnDemand]: 360/362 looper letters, 51 selfloop transitions, 1 changer transitions 0/364 dead transitions. [2022-11-02 20:50:05,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 364 transitions, 1423 flow [2022-11-02 20:50:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-11-02 20:50:05,677 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9060773480662984 [2022-11-02 20:50:05,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-11-02 20:50:05,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-11-02 20:50:05,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:05,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-11-02 20:50:05,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:05,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:05,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:05,685 INFO L175 Difference]: Start difference. First operand has 344 places, 365 transitions, 1321 flow. Second operand 3 states and 984 transitions. [2022-11-02 20:50:05,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 364 transitions, 1423 flow [2022-11-02 20:50:05,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 364 transitions, 1419 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:50:05,705 INFO L231 Difference]: Finished difference. Result has 343 places, 364 transitions, 1317 flow [2022-11-02 20:50:05,705 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=343, PETRI_TRANSITIONS=364} [2022-11-02 20:50:05,706 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2022-11-02 20:50:05,706 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 364 transitions, 1317 flow [2022-11-02 20:50:05,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.6666666666667) internal successors, (980), 3 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:05,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:05,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:50:05,708 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -27302517, now seen corresponding path program 1 times [2022-11-02 20:50:05,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:05,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85799744] [2022-11-02 20:50:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:50:05,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:05,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85799744] [2022-11-02 20:50:05,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85799744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:05,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:05,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:05,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72778570] [2022-11-02 20:50:05,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:05,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:05,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:05,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:05,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:05,807 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 362 [2022-11-02 20:50:05,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 364 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:05,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:05,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 362 [2022-11-02 20:50:05,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:07,027 INFO L130 PetriNetUnfolder]: 1684/5304 cut-off events. [2022-11-02 20:50:07,027 INFO L131 PetriNetUnfolder]: For 12171/12404 co-relation queries the response was YES. [2022-11-02 20:50:07,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13120 conditions, 5304 events. 1684/5304 cut-off events. For 12171/12404 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 43214 event pairs, 302 based on Foata normal form. 6/4752 useless extension candidates. Maximal degree in co-relation 13063. Up to 1546 conditions per place. [2022-11-02 20:50:07,084 INFO L137 encePairwiseOnDemand]: 357/362 looper letters, 66 selfloop transitions, 2 changer transitions 23/376 dead transitions. [2022-11-02 20:50:07,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 376 transitions, 1563 flow [2022-11-02 20:50:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:07,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 976 transitions. [2022-11-02 20:50:07,087 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8987108655616943 [2022-11-02 20:50:07,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 976 transitions. [2022-11-02 20:50:07,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 976 transitions. [2022-11-02 20:50:07,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:07,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 976 transitions. [2022-11-02 20:50:07,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:07,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:07,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:07,093 INFO L175 Difference]: Start difference. First operand has 343 places, 364 transitions, 1317 flow. Second operand 3 states and 976 transitions. [2022-11-02 20:50:07,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 376 transitions, 1563 flow [2022-11-02 20:50:07,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 376 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:50:07,114 INFO L231 Difference]: Finished difference. Result has 342 places, 339 transitions, 1203 flow [2022-11-02 20:50:07,115 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=342, PETRI_TRANSITIONS=339} [2022-11-02 20:50:07,115 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, 12 predicate places. [2022-11-02 20:50:07,115 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 339 transitions, 1203 flow [2022-11-02 20:50:07,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.0) internal successors, (957), 3 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:07,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:07,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:07,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:50:07,116 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:07,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash -467883571, now seen corresponding path program 1 times [2022-11-02 20:50:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:07,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029658051] [2022-11-02 20:50:07,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:07,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:50:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:07,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029658051] [2022-11-02 20:50:07,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029658051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:07,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:07,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:07,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254801557] [2022-11-02 20:50:07,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:07,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:07,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:07,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:07,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:07,205 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 362 [2022-11-02 20:50:07,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 339 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:07,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:07,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 362 [2022-11-02 20:50:07,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:08,174 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][303], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, 47#L73true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 180#L97-7true, 472#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 388#(= |#race~A~0| 0), 453#true]) [2022-11-02 20:50:08,175 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:50:08,175 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 20:50:08,175 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 20:50:08,175 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:50:08,178 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][331], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, 47#L73true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 7#L97-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 417#true, 127#L50-10true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-02 20:50:08,178 INFO L383 tUnfolder$Statistics]: this new event has 254 ancestors and is cut-off event [2022-11-02 20:50:08,178 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-02 20:50:08,178 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-02 20:50:08,178 INFO L386 tUnfolder$Statistics]: existing Event has 223 ancestors and is cut-off event [2022-11-02 20:50:08,197 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][303], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 180#L97-7true, 472#true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 388#(= |#race~A~0| 0), 453#true]) [2022-11-02 20:50:08,197 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:50:08,198 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:50:08,198 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-02 20:50:08,198 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-02 20:50:08,201 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][331], [Black: 449#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 447#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread2Thread1of1ForFork2_~i~1 0)), 361#(= |#race~N~0| 0), Black: 386#true, 492#true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 472#true, 7#L97-6true, Black: 411#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 403#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 285#L77true, Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 409#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 437#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, 399#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 417#true, 127#L50-10true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-02 20:50:08,201 INFO L383 tUnfolder$Statistics]: this new event has 256 ancestors and is cut-off event [2022-11-02 20:50:08,201 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-02 20:50:08,201 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-02 20:50:08,201 INFO L386 tUnfolder$Statistics]: existing Event has 225 ancestors and is cut-off event [2022-11-02 20:50:08,238 INFO L130 PetriNetUnfolder]: 1119/3771 cut-off events. [2022-11-02 20:50:08,238 INFO L131 PetriNetUnfolder]: For 9155/9334 co-relation queries the response was YES. [2022-11-02 20:50:08,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9554 conditions, 3771 events. 1119/3771 cut-off events. For 9155/9334 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 30273 event pairs, 70 based on Foata normal form. 0/3431 useless extension candidates. Maximal degree in co-relation 9523. Up to 1145 conditions per place. [2022-11-02 20:50:08,315 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 50 selfloop transitions, 35 changer transitions 0/370 dead transitions. [2022-11-02 20:50:08,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 370 transitions, 1633 flow [2022-11-02 20:50:08,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:08,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2022-11-02 20:50:08,319 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9060773480662984 [2022-11-02 20:50:08,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 984 transitions. [2022-11-02 20:50:08,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 984 transitions. [2022-11-02 20:50:08,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:08,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 984 transitions. [2022-11-02 20:50:08,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:08,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:08,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:08,326 INFO L175 Difference]: Start difference. First operand has 342 places, 339 transitions, 1203 flow. Second operand 3 states and 984 transitions. [2022-11-02 20:50:08,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 370 transitions, 1633 flow [2022-11-02 20:50:08,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 370 transitions, 1585 flow, removed 8 selfloop flow, removed 10 redundant places. [2022-11-02 20:50:08,358 INFO L231 Difference]: Finished difference. Result has 317 places, 364 transitions, 1556 flow [2022-11-02 20:50:08,358 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=317, PETRI_TRANSITIONS=364} [2022-11-02 20:50:08,360 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -13 predicate places. [2022-11-02 20:50:08,360 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 364 transitions, 1556 flow [2022-11-02 20:50:08,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:08,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:08,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:08,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:50:08,361 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1431523047, now seen corresponding path program 1 times [2022-11-02 20:50:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021564578] [2022-11-02 20:50:08,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:08,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:50:11,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:11,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021564578] [2022-11-02 20:50:11,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021564578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:11,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:11,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-02 20:50:11,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497884500] [2022-11-02 20:50:11,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:11,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:50:11,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:11,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:50:11,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:50:11,143 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 362 [2022-11-02 20:50:11,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 364 transitions, 1556 flow. Second operand has 23 states, 23 states have (on average 226.95652173913044) internal successors, (5220), 23 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states 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:50:11,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:11,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 362 [2022-11-02 20:50:11,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:22,168 INFO L130 PetriNetUnfolder]: 19612/34825 cut-off events. [2022-11-02 20:50:22,168 INFO L131 PetriNetUnfolder]: For 27275/27275 co-relation queries the response was YES. [2022-11-02 20:50:22,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85635 conditions, 34825 events. 19612/34825 cut-off events. For 27275/27275 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 311950 event pairs, 6257 based on Foata normal form. 185/31996 useless extension candidates. Maximal degree in co-relation 85573. Up to 15459 conditions per place. [2022-11-02 20:50:22,637 INFO L137 encePairwiseOnDemand]: 331/362 looper letters, 244 selfloop transitions, 34 changer transitions 0/459 dead transitions. [2022-11-02 20:50:22,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 459 transitions, 2636 flow [2022-11-02 20:50:22,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:50:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-11-02 20:50:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 6664 transitions. [2022-11-02 20:50:22,659 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6347875785863974 [2022-11-02 20:50:22,659 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 6664 transitions. [2022-11-02 20:50:22,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 6664 transitions. [2022-11-02 20:50:22,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:22,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 6664 transitions. [2022-11-02 20:50:22,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 229.79310344827587) internal successors, (6664), 29 states have internal predecessors, (6664), 0 states have call successors, (0), 0 states 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:50:22,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 362.0) internal successors, (10860), 30 states have internal predecessors, (10860), 0 states have call successors, (0), 0 states 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:50:22,712 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 362.0) internal successors, (10860), 30 states have internal predecessors, (10860), 0 states have call successors, (0), 0 states 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:50:22,713 INFO L175 Difference]: Start difference. First operand has 317 places, 364 transitions, 1556 flow. Second operand 29 states and 6664 transitions. [2022-11-02 20:50:22,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 459 transitions, 2636 flow [2022-11-02 20:50:23,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 459 transitions, 2636 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:23,210 INFO L231 Difference]: Finished difference. Result has 344 places, 363 transitions, 1620 flow [2022-11-02 20:50:23,210 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1620, PETRI_PLACES=344, PETRI_TRANSITIONS=363} [2022-11-02 20:50:23,210 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, 14 predicate places. [2022-11-02 20:50:23,211 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 363 transitions, 1620 flow [2022-11-02 20:50:23,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 226.95652173913044) internal successors, (5220), 23 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states 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:50:23,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:23,214 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:23,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:50:23,214 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash -47869416, now seen corresponding path program 1 times [2022-11-02 20:50:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:23,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263268761] [2022-11-02 20:50:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:50:26,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:26,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263268761] [2022-11-02 20:50:26,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263268761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:26,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:26,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-02 20:50:26,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845362379] [2022-11-02 20:50:26,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:26,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-02 20:50:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:26,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:50:26,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:50:26,286 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 362 [2022-11-02 20:50:26,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 363 transitions, 1620 flow. Second operand has 23 states, 23 states have (on average 237.7826086956522) internal successors, (5469), 23 states have internal predecessors, (5469), 0 states have call successors, (0), 0 states 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:50:26,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:26,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 362 [2022-11-02 20:50:26,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:31,046 INFO L130 PetriNetUnfolder]: 4020/9353 cut-off events. [2022-11-02 20:50:31,046 INFO L131 PetriNetUnfolder]: For 26732/30968 co-relation queries the response was YES. [2022-11-02 20:50:31,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27258 conditions, 9353 events. 4020/9353 cut-off events. For 26732/30968 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 80030 event pairs, 399 based on Foata normal form. 1064/9865 useless extension candidates. Maximal degree in co-relation 27197. Up to 2056 conditions per place. [2022-11-02 20:50:31,161 INFO L137 encePairwiseOnDemand]: 331/362 looper letters, 233 selfloop transitions, 33 changer transitions 0/458 dead transitions. [2022-11-02 20:50:31,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 458 transitions, 2676 flow [2022-11-02 20:50:31,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:50:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-11-02 20:50:31,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6737 transitions. [2022-11-02 20:50:31,170 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6646606156274665 [2022-11-02 20:50:31,170 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 6737 transitions. [2022-11-02 20:50:31,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 6737 transitions. [2022-11-02 20:50:31,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:31,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 6737 transitions. [2022-11-02 20:50:31,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 240.60714285714286) internal successors, (6737), 28 states have internal predecessors, (6737), 0 states have call successors, (0), 0 states 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:50:31,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 362.0) internal successors, (10498), 29 states have internal predecessors, (10498), 0 states have call successors, (0), 0 states 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:50:31,201 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 362.0) internal successors, (10498), 29 states have internal predecessors, (10498), 0 states have call successors, (0), 0 states 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:50:31,202 INFO L175 Difference]: Start difference. First operand has 344 places, 363 transitions, 1620 flow. Second operand 28 states and 6737 transitions. [2022-11-02 20:50:31,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 458 transitions, 2676 flow [2022-11-02 20:50:31,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 458 transitions, 2531 flow, removed 0 selfloop flow, removed 29 redundant places. [2022-11-02 20:50:31,291 INFO L231 Difference]: Finished difference. Result has 341 places, 362 transitions, 1593 flow [2022-11-02 20:50:31,292 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1527, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1593, PETRI_PLACES=341, PETRI_TRANSITIONS=362} [2022-11-02 20:50:31,293 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, 11 predicate places. [2022-11-02 20:50:31,293 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 362 transitions, 1593 flow [2022-11-02 20:50:31,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 237.7826086956522) internal successors, (5469), 23 states have internal predecessors, (5469), 0 states have call successors, (0), 0 states 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:50:31,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:31,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:31,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:50:31,295 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2062953935, now seen corresponding path program 1 times [2022-11-02 20:50:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:31,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083397293] [2022-11-02 20:50:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:50:31,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:31,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083397293] [2022-11-02 20:50:31,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083397293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:31,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:31,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:50:31,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314618694] [2022-11-02 20:50:31,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:31,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:50:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:31,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:50:31,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:50:31,875 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 362 [2022-11-02 20:50:31,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 362 transitions, 1593 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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:50:31,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:31,877 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 362 [2022-11-02 20:50:31,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:35,528 INFO L130 PetriNetUnfolder]: 4804/11497 cut-off events. [2022-11-02 20:50:35,528 INFO L131 PetriNetUnfolder]: For 32230/33956 co-relation queries the response was YES. [2022-11-02 20:50:35,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32874 conditions, 11497 events. 4804/11497 cut-off events. For 32230/33956 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 102369 event pairs, 1568 based on Foata normal form. 21/10784 useless extension candidates. Maximal degree in co-relation 32820. Up to 5435 conditions per place. [2022-11-02 20:50:35,669 INFO L137 encePairwiseOnDemand]: 354/362 looper letters, 189 selfloop transitions, 47 changer transitions 0/460 dead transitions. [2022-11-02 20:50:35,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 460 transitions, 2823 flow [2022-11-02 20:50:35,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:50:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:50:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1726 transitions. [2022-11-02 20:50:35,672 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7946593001841621 [2022-11-02 20:50:35,672 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1726 transitions. [2022-11-02 20:50:35,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1726 transitions. [2022-11-02 20:50:35,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:35,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1726 transitions. [2022-11-02 20:50:35,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 287.6666666666667) internal successors, (1726), 6 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states 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:50:35,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:35,679 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 362.0) internal successors, (2534), 7 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:35,679 INFO L175 Difference]: Start difference. First operand has 341 places, 362 transitions, 1593 flow. Second operand 6 states and 1726 transitions. [2022-11-02 20:50:35,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 460 transitions, 2823 flow [2022-11-02 20:50:35,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 460 transitions, 2711 flow, removed 0 selfloop flow, removed 26 redundant places. [2022-11-02 20:50:35,743 INFO L231 Difference]: Finished difference. Result has 325 places, 407 transitions, 2233 flow [2022-11-02 20:50:35,744 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2233, PETRI_PLACES=325, PETRI_TRANSITIONS=407} [2022-11-02 20:50:35,744 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -5 predicate places. [2022-11-02 20:50:35,745 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 407 transitions, 2233 flow [2022-11-02 20:50:35,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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:50:35,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:35,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:35,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:50:35,746 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1817591348, now seen corresponding path program 1 times [2022-11-02 20:50:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:35,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772405975] [2022-11-02 20:50:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:50:35,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:35,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772405975] [2022-11-02 20:50:35,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772405975] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:50:35,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:50:35,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:50:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012450479] [2022-11-02 20:50:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:35,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:50:35,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:35,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:50:35,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:50:35,824 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 362 [2022-11-02 20:50:35,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 407 transitions, 2233 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:35,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:35,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 362 [2022-11-02 20:50:35,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:50:37,185 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][274], [130#thread3ENTRYtrue, Black: 638#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 637#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 636#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 635#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 361#(= |#race~N~0| 0), Black: 386#true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 633#true, 472#true, 180#L97-7true, Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 631#(and (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~C~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (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)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 496#true, 645#true, 388#(= |#race~A~0| 0), 453#true]) [2022-11-02 20:50:37,186 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-02 20:50:37,186 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-02 20:50:37,186 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-02 20:50:37,186 INFO L386 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2022-11-02 20:50:37,242 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][294], [130#thread3ENTRYtrue, Black: 638#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 637#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 636#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 635#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 361#(= |#race~N~0| 0), Black: 386#true, 498#(= |#race~B~0| 0), Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 633#true, 472#true, 7#L97-6true, 45#L49-6true, Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 631#(and (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~C~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (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)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 417#true, Black: 496#true, 645#true, 388#(= |#race~A~0| 0), 453#true]) [2022-11-02 20:50:37,242 INFO L383 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-11-02 20:50:37,242 INFO L386 tUnfolder$Statistics]: existing Event has 235 ancestors and is cut-off event [2022-11-02 20:50:37,242 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-02 20:50:37,243 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-02 20:50:37,274 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][274], [Black: 638#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 637#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 636#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 635#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 361#(= |#race~N~0| 0), Black: 386#true, 47#L73true, 498#(= |#race~B~0| 0), Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 633#true, 472#true, 180#L97-7true, Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 631#(and (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~C~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (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)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 645#true, Black: 496#true, 388#(= |#race~A~0| 0), 453#true]) [2022-11-02 20:50:37,275 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:50:37,275 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:50:37,275 INFO L386 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-11-02 20:50:37,275 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:50:37,294 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1021] thread1EXIT-->L97-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem28#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][274], [Black: 638#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 637#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 636#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 635#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 361#(= |#race~N~0| 0), Black: 386#true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 633#true, 180#L97-7true, 472#true, 285#L77true, Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, Black: 417#true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 631#(and (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~C~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (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)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 422#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 645#true, Black: 496#true, 388#(= |#race~A~0| 0), 453#true]) [2022-11-02 20:50:37,294 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:50:37,294 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:50:37,294 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:50:37,295 INFO L386 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2022-11-02 20:50:37,298 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][294], [Black: 638#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 637#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 636#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 635#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 361#(= |#race~N~0| 0), Black: 386#true, 47#L73true, Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 498#(= |#race~B~0| 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 633#true, 472#true, 7#L97-6true, 45#L49-6true, Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 631#(and (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~C~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (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)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 417#true, Black: 496#true, 645#true, 388#(= |#race~A~0| 0), 453#true]) [2022-11-02 20:50:37,298 INFO L383 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-11-02 20:50:37,298 INFO L386 tUnfolder$Statistics]: existing Event has 240 ancestors and is cut-off event [2022-11-02 20:50:37,298 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:50:37,298 INFO L386 tUnfolder$Statistics]: existing Event has 247 ancestors and is cut-off event [2022-11-02 20:50:37,307 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L59-->L62: Formula: (let ((.cse10 (* 4 v_thread2Thread1of1ForFork2_~i~1_13))) (let ((.cse0 (select |v_#race_307| v_~C~0.base_71)) (.cse8 (+ 2 v_~C~0.offset_71 .cse10))) (let ((.cse4 (+ v_~C~0.offset_71 .cse10)) (.cse1 (+ v_~C~0.offset_71 .cse10 1)) (.cse3 (+ 3 v_~C~0.offset_71 .cse10)) (.cse2 (select .cse0 .cse8)) (.cse6 (+ v_~B~0.offset_41 .cse10)) (.cse5 (+ v_~A~0.offset_47 .cse10))) (and (= (+ v_thread2Thread1of1ForFork2_~i~1_13 1) v_~p~0_22) (= (select .cse0 .cse1) .cse2) (= |v_#race~A~0_40| 0) (= .cse2 (select .cse0 .cse3)) (= |v_#memory_int_103| (store |v_#memory_int_104| v_~C~0.base_71 (store (select |v_#memory_int_104| v_~C~0.base_71) .cse4 (+ (select (select |v_#memory_int_104| v_~A~0.base_47) .cse5) (select (select |v_#memory_int_104| v_~B~0.base_41) .cse6))))) (= (select .cse0 .cse4) .cse2) (= |v_#race_307| (let ((.cse7 (let ((.cse9 (store |v_#race_308| v_~A~0.base_47 (store (store (store (store (select |v_#race_308| v_~A~0.base_47) .cse5 0) (+ v_~A~0.offset_47 .cse10 1) 0) (+ 2 v_~A~0.offset_47 .cse10) 0) (+ 3 v_~A~0.offset_47 .cse10) 0)))) (store .cse9 v_~B~0.base_41 (store (store (store (store (select .cse9 v_~B~0.base_41) .cse6 0) (+ v_~B~0.offset_41 .cse10 1) 0) (+ 2 v_~B~0.offset_41 .cse10) 0) (+ 3 v_~B~0.offset_41 .cse10) 0))))) (store .cse7 v_~C~0.base_71 (store (store (store (store (select .cse7 v_~C~0.base_71) .cse4 .cse2) .cse1 .cse2) .cse8 .cse2) .cse3 .cse2)))) (= |v_#race~C~0_54| 0) (= |v_#race~B~0_34| 0))))) InVars {#race=|v_#race_308|, ~A~0.base=v_~A~0.base_47, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~B~0.base=v_~B~0.base_41, ~A~0.offset=v_~A~0.offset_47, ~C~0.base=v_~C~0.base_71, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_104|, ~B~0.offset=v_~B~0.offset_41} OutVars{#race=|v_#race_307|, ~A~0.base=v_~A~0.base_47, ~B~0.base=v_~B~0.base_41, ~C~0.base=v_~C~0.base_71, #race~B~0=|v_#race~B~0_34|, thread2Thread1of1ForFork2_#t~mem7=|v_thread2Thread1of1ForFork2_#t~mem7_11|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_13, ~A~0.offset=v_~A~0.offset_47, #race~p~0=|v_#race~p~0_25|, thread2Thread1of1ForFork2_#t~nondet10=|v_thread2Thread1of1ForFork2_#t~nondet10_3|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_7|, thread2Thread1of1ForFork2_#t~nondet9=|v_thread2Thread1of1ForFork2_#t~nondet9_5|, ~C~0.offset=v_~C~0.offset_71, #memory_int=|v_#memory_int_103|, ~p~0=v_~p~0_22, ~B~0.offset=v_~B~0.offset_41, #race~C~0=|v_#race~C~0_54|, #race~A~0=|v_#race~A~0_40|} AuxVars[] AssignedVars[#race, #race~B~0, thread2Thread1of1ForFork2_#t~mem7, #race~p~0, thread2Thread1of1ForFork2_#t~nondet10, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~nondet9, #memory_int, ~p~0, #race~C~0, #race~A~0][294], [Black: 638#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ 3 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 637#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ 2 ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 636#(and (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0) (= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 635#(= (select (select |#race| ~B~0.base) (+ ~B~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), 361#(= |#race~N~0| 0), Black: 386#true, 498#(= |#race~B~0| 0), Black: 455#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), Black: 458#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 456#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 457#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 633#true, 472#true, 7#L97-6true, 45#L49-6true, 285#L77true, Black: 477#(and (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 474#(= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0), Black: 401#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 475#(and (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), Black: 476#(and (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1)) 0)), 224#L62true, Black: 420#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 631#(and (not (= |ULTIMATE.start_create_fresh_uint_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (not (= ~A~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~B~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~C~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (= (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)), Black: 421#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 419#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 417#true, 645#true, Black: 496#true, 453#true, 388#(= |#race~A~0| 0)]) [2022-11-02 20:50:37,308 INFO L383 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-11-02 20:50:37,308 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:50:37,308 INFO L386 tUnfolder$Statistics]: existing Event has 242 ancestors and is cut-off event [2022-11-02 20:50:37,308 INFO L386 tUnfolder$Statistics]: existing Event has 249 ancestors and is cut-off event [2022-11-02 20:50:37,323 INFO L130 PetriNetUnfolder]: 2540/6593 cut-off events. [2022-11-02 20:50:37,323 INFO L131 PetriNetUnfolder]: For 45613/46173 co-relation queries the response was YES. [2022-11-02 20:50:37,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23241 conditions, 6593 events. 2540/6593 cut-off events. For 45613/46173 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 55459 event pairs, 331 based on Foata normal form. 0/5977 useless extension candidates. Maximal degree in co-relation 23185. Up to 2303 conditions per place. [2022-11-02 20:50:37,410 INFO L137 encePairwiseOnDemand]: 359/362 looper letters, 137 selfloop transitions, 2 changer transitions 0/425 dead transitions. [2022-11-02 20:50:37,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 425 transitions, 2748 flow [2022-11-02 20:50:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:50:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:50:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2022-11-02 20:50:37,412 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8913443830570903 [2022-11-02 20:50:37,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 968 transitions. [2022-11-02 20:50:37,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 968 transitions. [2022-11-02 20:50:37,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:50:37,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 968 transitions. [2022-11-02 20:50:37,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:37,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:37,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:37,417 INFO L175 Difference]: Start difference. First operand has 325 places, 407 transitions, 2233 flow. Second operand 3 states and 968 transitions. [2022-11-02 20:50:37,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 425 transitions, 2748 flow [2022-11-02 20:50:37,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 425 transitions, 2578 flow, removed 85 selfloop flow, removed 0 redundant places. [2022-11-02 20:50:37,601 INFO L231 Difference]: Finished difference. Result has 326 places, 406 transitions, 2099 flow [2022-11-02 20:50:37,602 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2099, PETRI_PLACES=326, PETRI_TRANSITIONS=406} [2022-11-02 20:50:37,603 INFO L287 CegarLoopForPetriNet]: 330 programPoint places, -4 predicate places. [2022-11-02 20:50:37,603 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 406 transitions, 2099 flow [2022-11-02 20:50:37,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:50:37,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:50:37,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:37,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:50:37,604 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2022-11-02 20:50:37,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:50:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1642431570, now seen corresponding path program 1 times [2022-11-02 20:50:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:50:37,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528026350] [2022-11-02 20:50:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:37,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:50:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:37,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:50:37,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:50:37,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528026350] [2022-11-02 20:50:37,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528026350] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:37,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514476153] [2022-11-02 20:50:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:50:37,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:50:37,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:50:37,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:50:37,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c85281d-0b67-4a6e-83d4-dcafe497a750/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:50:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:50:38,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:50:38,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:50:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:50:38,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:50:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:50:38,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514476153] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-02 20:50:38,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:50:38,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-02 20:50:38,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792668718] [2022-11-02 20:50:38,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:50:38,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:50:38,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:50:38,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:50:38,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:50:38,945 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 362 [2022-11-02 20:50:38,947 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 406 transitions, 2099 flow. Second operand has 7 states, 7 states have (on average 256.7142857142857) internal successors, (1797), 7 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states 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:50:38,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:50:38,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 362 [2022-11-02 20:50:38,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand