./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6b4ec56b 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_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN --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 eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --- 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-6b4ec56 [2022-11-20 11:14:14,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:14:14,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:14:14,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:14:14,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:14:14,767 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:14:14,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:14:14,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:14:14,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:14:14,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:14:14,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:14:14,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:14:14,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:14:14,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:14:14,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:14:14,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:14:14,799 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:14:14,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:14:14,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:14:14,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:14:14,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:14:14,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:14:14,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:14:14,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:14:14,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:14:14,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:14:14,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:14:14,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:14:14,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:14:14,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:14:14,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:14:14,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:14:14,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:14:14,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:14:14,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:14:14,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:14:14,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:14:14,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:14:14,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:14:14,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:14:14,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:14:14,843 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-20 11:14:14,888 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:14:14,889 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:14:14,893 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:14:14,893 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:14:14,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:14:14,894 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:14:14,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:14:14,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:14:14,896 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:14:14,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:14:14,897 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 11:14:14,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 11:14:14,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:14:14,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 11:14:14,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:14:14,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:14:14,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:14:14,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:14:14,899 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-20 11:14:14,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 11:14:14,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:14:14,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:14:14,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:14:14,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:14:14,901 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:14:14,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:14:14,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:14:14,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:14:14,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:14:14,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:14:14,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:14:14,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:14:14,904 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:14:14,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:14:14,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:14:14,905 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_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/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_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN 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 -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc [2022-11-20 11:14:15,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:14:15,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:14:15,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:14:15,229 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:14:15,229 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:14:15,231 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2022-11-20 11:14:18,451 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:14:18,749 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:14:18,750 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2022-11-20 11:14:18,758 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/data/0623fdb64/d3d13e0d001841fda920db6f18c4aaaa/FLAG201eb9901 [2022-11-20 11:14:18,785 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/data/0623fdb64/d3d13e0d001841fda920db6f18c4aaaa [2022-11-20 11:14:18,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:14:18,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:14:18,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:14:18,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:14:18,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:14:18,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:14:18" (1/1) ... [2022-11-20 11:14:18,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a481b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:18, skipping insertion in model container [2022-11-20 11:14:18,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:14:18" (1/1) ... [2022-11-20 11:14:18,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:14:18,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:14:19,126 WARN L237 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_d307b403-c563-4f9c-879d-1bcebd3448b1/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-11-20 11:14:19,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:14:19,150 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:14:19,186 WARN L237 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_d307b403-c563-4f9c-879d-1bcebd3448b1/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-11-20 11:14:19,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:14:19,211 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:14:19,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19 WrapperNode [2022-11-20 11:14:19,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:14:19,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:14:19,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:14:19,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:14:19,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,310 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 172 [2022-11-20 11:14:19,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:14:19,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:14:19,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:14:19,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:14:19,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,390 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:14:19,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:14:19,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:14:19,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:14:19,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (1/1) ... [2022-11-20 11:14:19,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:14:19,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:14:19,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:14:19,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d307b403-c563-4f9c-879d-1bcebd3448b1/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:14:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:14:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:14:19,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:14:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:14:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 11:14:19,505 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 11:14:19,505 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 11:14:19,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 11:14:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 11:14:19,506 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 11:14:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:14:19,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 11:14:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 11:14:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:14:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:14:19,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:14:19,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:14:19,509 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 11:14:19,682 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:14:19,684 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:14:20,335 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:14:20,594 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:14:20,594 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 11:14:20,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:14:20 BoogieIcfgContainer [2022-11-20 11:14:20,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:14:20,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:14:20,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:14:20,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:14:20,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:14:18" (1/3) ... [2022-11-20 11:14:20,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3395d3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:14:20, skipping insertion in model container [2022-11-20 11:14:20,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:14:19" (2/3) ... [2022-11-20 11:14:20,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3395d3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:14:20, skipping insertion in model container [2022-11-20 11:14:20,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:14:20" (3/3) ... [2022-11-20 11:14:20,609 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-11-20 11:14:20,620 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 11:14:20,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:14:20,633 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-20 11:14:20,633 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 11:14:20,727 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 11:14:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 285 transitions, 594 flow [2022-11-20 11:14:20,894 INFO L130 PetriNetUnfolder]: 16/282 cut-off events. [2022-11-20 11:14:20,895 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 11:14:20,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 282 events. 16/282 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2022-11-20 11:14:20,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 285 transitions, 594 flow [2022-11-20 11:14:20,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 257 places, 262 transitions, 542 flow [2022-11-20 11:14:20,927 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:14:20,934 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;@28dbe9fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:14:20,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-20 11:14:20,942 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-20 11:14:20,943 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 11:14:20,943 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:20,944 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:20,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:20,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:20,951 INFO L85 PathProgramCache]: Analyzing trace with hash -956837861, now seen corresponding path program 1 times [2022-11-20 11:14:20,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:20,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283492014] [2022-11-20 11:14:20,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:20,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:21,274 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-20 11:14:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:21,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283492014] [2022-11-20 11:14:21,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283492014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:21,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:21,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:14:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784702084] [2022-11-20 11:14:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:21,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:14:21,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:14:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:14:21,357 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 285 [2022-11-20 11:14:21,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 262 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:21,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:21,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 285 [2022-11-20 11:14:21,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:22,023 INFO L130 PetriNetUnfolder]: 452/1339 cut-off events. [2022-11-20 11:14:22,024 INFO L131 PetriNetUnfolder]: For 218/381 co-relation queries the response was YES. [2022-11-20 11:14:22,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2089 conditions, 1339 events. 452/1339 cut-off events. For 218/381 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8160 event pairs, 311 based on Foata normal form. 6/1038 useless extension candidates. Maximal degree in co-relation 1813. Up to 643 conditions per place. [2022-11-20 11:14:22,054 INFO L137 encePairwiseOnDemand]: 263/285 looper letters, 30 selfloop transitions, 2 changer transitions 4/242 dead transitions. [2022-11-20 11:14:22,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 566 flow [2022-11-20 11:14:22,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:14:22,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:14:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2022-11-20 11:14:22,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8678362573099415 [2022-11-20 11:14:22,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 742 transitions. [2022-11-20 11:14:22,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 742 transitions. [2022-11-20 11:14:22,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:22,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 742 transitions. [2022-11-20 11:14:22,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,115 INFO L175 Difference]: Start difference. First operand has 257 places, 262 transitions, 542 flow. Second operand 3 states and 742 transitions. [2022-11-20 11:14:22,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 566 flow [2022-11-20 11:14:22,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 242 transitions, 554 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 11:14:22,132 INFO L231 Difference]: Finished difference. Result has 242 places, 238 transitions, 486 flow [2022-11-20 11:14:22,135 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=242, PETRI_TRANSITIONS=238} [2022-11-20 11:14:22,140 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -15 predicate places. [2022-11-20 11:14:22,141 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 238 transitions, 486 flow [2022-11-20 11:14:22,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,142 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:22,143 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:22,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:14:22,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:22,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:22,145 INFO L85 PathProgramCache]: Analyzing trace with hash -379582126, now seen corresponding path program 1 times [2022-11-20 11:14:22,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:22,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805145105] [2022-11-20 11:14:22,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:22,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:22,264 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-20 11:14:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:22,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805145105] [2022-11-20 11:14:22,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805145105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:22,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:22,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:14:22,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096877152] [2022-11-20 11:14:22,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:22,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:14:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:14:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:14:22,281 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 285 [2022-11-20 11:14:22,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 238 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,283 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:22,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 285 [2022-11-20 11:14:22,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:22,595 INFO L130 PetriNetUnfolder]: 262/950 cut-off events. [2022-11-20 11:14:22,595 INFO L131 PetriNetUnfolder]: For 32/121 co-relation queries the response was YES. [2022-11-20 11:14:22,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 950 events. 262/950 cut-off events. For 32/121 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5220 event pairs, 164 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 1306. Up to 365 conditions per place. [2022-11-20 11:14:22,605 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 21 selfloop transitions, 1 changer transitions 2/232 dead transitions. [2022-11-20 11:14:22,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 232 transitions, 520 flow [2022-11-20 11:14:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:14:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:14:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2022-11-20 11:14:22,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8514619883040936 [2022-11-20 11:14:22,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 728 transitions. [2022-11-20 11:14:22,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 728 transitions. [2022-11-20 11:14:22,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:22,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 728 transitions. [2022-11-20 11:14:22,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 242.66666666666666) internal successors, (728), 3 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,615 INFO L175 Difference]: Start difference. First operand has 242 places, 238 transitions, 486 flow. Second operand 3 states and 728 transitions. [2022-11-20 11:14:22,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 232 transitions, 520 flow [2022-11-20 11:14:22,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 232 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:14:22,629 INFO L231 Difference]: Finished difference. Result has 232 places, 230 transitions, 468 flow [2022-11-20 11:14:22,629 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=232, PETRI_TRANSITIONS=230} [2022-11-20 11:14:22,631 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -25 predicate places. [2022-11-20 11:14:22,632 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 468 flow [2022-11-20 11:14:22,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,633 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:22,633 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:22,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:14:22,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:22,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash -633740637, now seen corresponding path program 1 times [2022-11-20 11:14:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:22,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613771578] [2022-11-20 11:14:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:22,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:22,790 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-20 11:14:22,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:22,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613771578] [2022-11-20 11:14:22,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613771578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:22,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:22,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:14:22,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093582496] [2022-11-20 11:14:22,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:22,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:14:22,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:22,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:14:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:14:22,795 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 285 [2022-11-20 11:14:22,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 230 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:22,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:22,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 285 [2022-11-20 11:14:22,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:23,060 INFO L130 PetriNetUnfolder]: 133/746 cut-off events. [2022-11-20 11:14:23,060 INFO L131 PetriNetUnfolder]: For 26/30 co-relation queries the response was YES. [2022-11-20 11:14:23,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 746 events. 133/746 cut-off events. For 26/30 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3884 event pairs, 74 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 923. Up to 189 conditions per place. [2022-11-20 11:14:23,069 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 16 selfloop transitions, 2 changer transitions 0/229 dead transitions. [2022-11-20 11:14:23,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 502 flow [2022-11-20 11:14:23,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:14:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:14:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2022-11-20 11:14:23,072 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8818713450292398 [2022-11-20 11:14:23,072 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 754 transitions. [2022-11-20 11:14:23,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 754 transitions. [2022-11-20 11:14:23,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:23,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 754 transitions. [2022-11-20 11:14:23,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:23,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:23,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:23,079 INFO L175 Difference]: Start difference. First operand has 232 places, 230 transitions, 468 flow. Second operand 3 states and 754 transitions. [2022-11-20 11:14:23,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 502 flow [2022-11-20 11:14:23,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 229 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 11:14:23,092 INFO L231 Difference]: Finished difference. Result has 230 places, 229 transitions, 469 flow [2022-11-20 11:14:23,093 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=230, PETRI_TRANSITIONS=229} [2022-11-20 11:14:23,094 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -27 predicate places. [2022-11-20 11:14:23,094 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 229 transitions, 469 flow [2022-11-20 11:14:23,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:23,095 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:23,095 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:23,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:14:23,096 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1223527727, now seen corresponding path program 1 times [2022-11-20 11:14:23,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:23,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988694147] [2022-11-20 11:14:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:23,762 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-20 11:14:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:23,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988694147] [2022-11-20 11:14:23,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988694147] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:23,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:23,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:14:23,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431280858] [2022-11-20 11:14:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:23,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:14:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:23,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:14:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:14:23,776 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 285 [2022-11-20 11:14:23,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 229 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:23,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:23,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 285 [2022-11-20 11:14:23,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:24,742 INFO L130 PetriNetUnfolder]: 1300/2595 cut-off events. [2022-11-20 11:14:24,742 INFO L131 PetriNetUnfolder]: For 9/60 co-relation queries the response was YES. [2022-11-20 11:14:24,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 2595 events. 1300/2595 cut-off events. For 9/60 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16660 event pairs, 1040 based on Foata normal form. 0/2224 useless extension candidates. Maximal degree in co-relation 4474. Up to 1868 conditions per place. [2022-11-20 11:14:24,775 INFO L137 encePairwiseOnDemand]: 273/285 looper letters, 56 selfloop transitions, 10 changer transitions 0/227 dead transitions. [2022-11-20 11:14:24,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 597 flow [2022-11-20 11:14:24,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:14:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:14:24,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2022-11-20 11:14:24,784 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7274853801169591 [2022-11-20 11:14:24,785 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2022-11-20 11:14:24,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2022-11-20 11:14:24,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:24,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2022-11-20 11:14:24,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:24,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:24,794 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:24,794 INFO L175 Difference]: Start difference. First operand has 230 places, 229 transitions, 469 flow. Second operand 6 states and 1244 transitions. [2022-11-20 11:14:24,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 597 flow [2022-11-20 11:14:24,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 227 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:14:24,801 INFO L231 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2022-11-20 11:14:24,802 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=227} [2022-11-20 11:14:24,803 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -26 predicate places. [2022-11-20 11:14:24,803 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2022-11-20 11:14:24,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:24,804 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:24,805 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:24,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:14:24,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:24,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:24,807 INFO L85 PathProgramCache]: Analyzing trace with hash 65499299, now seen corresponding path program 1 times [2022-11-20 11:14:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:24,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334366531] [2022-11-20 11:14:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:24,895 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-20 11:14:24,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:24,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334366531] [2022-11-20 11:14:24,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334366531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:24,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:24,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:14:24,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191894453] [2022-11-20 11:14:24,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:24,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:14:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:24,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:14:24,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:14:24,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 285 [2022-11-20 11:14:24,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:24,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:24,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 285 [2022-11-20 11:14:24,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:25,046 INFO L130 PetriNetUnfolder]: 44/356 cut-off events. [2022-11-20 11:14:25,046 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-11-20 11:14:25,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 356 events. 44/356 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 984 event pairs, 20 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 407. Up to 64 conditions per place. [2022-11-20 11:14:25,049 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 13 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2022-11-20 11:14:25,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 226 transitions, 509 flow [2022-11-20 11:14:25,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:14:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:14:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2022-11-20 11:14:25,052 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-11-20 11:14:25,052 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2022-11-20 11:14:25,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2022-11-20 11:14:25,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:25,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2022-11-20 11:14:25,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,058 INFO L175 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 760 transitions. [2022-11-20 11:14:25,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 226 transitions, 509 flow [2022-11-20 11:14:25,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 489 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 11:14:25,063 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 463 flow [2022-11-20 11:14:25,064 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2022-11-20 11:14:25,065 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -30 predicate places. [2022-11-20 11:14:25,065 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 463 flow [2022-11-20 11:14:25,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:25,066 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:25,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:14:25,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:25,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:25,067 INFO L85 PathProgramCache]: Analyzing trace with hash 335773767, now seen corresponding path program 1 times [2022-11-20 11:14:25,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:25,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056033450] [2022-11-20 11:14:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:25,134 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-20 11:14:25,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:25,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056033450] [2022-11-20 11:14:25,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056033450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:25,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:25,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:14:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149624072] [2022-11-20 11:14:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:25,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:14:25,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:25,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:14:25,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:14:25,139 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 285 [2022-11-20 11:14:25,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:25,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 285 [2022-11-20 11:14:25,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:25,355 INFO L130 PetriNetUnfolder]: 173/855 cut-off events. [2022-11-20 11:14:25,356 INFO L131 PetriNetUnfolder]: For 26/32 co-relation queries the response was YES. [2022-11-20 11:14:25,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 855 events. 173/855 cut-off events. For 26/32 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4789 event pairs, 74 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 1108. Up to 175 conditions per place. [2022-11-20 11:14:25,364 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 19 selfloop transitions, 2 changer transitions 2/230 dead transitions. [2022-11-20 11:14:25,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 230 transitions, 517 flow [2022-11-20 11:14:25,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:14:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:14:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2022-11-20 11:14:25,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2022-11-20 11:14:25,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 759 transitions. [2022-11-20 11:14:25,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 759 transitions. [2022-11-20 11:14:25,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:25,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 759 transitions. [2022-11-20 11:14:25,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,373 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 463 flow. Second operand 3 states and 759 transitions. [2022-11-20 11:14:25,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 230 transitions, 517 flow [2022-11-20 11:14:25,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 230 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:14:25,378 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 455 flow [2022-11-20 11:14:25,378 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2022-11-20 11:14:25,379 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -32 predicate places. [2022-11-20 11:14:25,379 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 455 flow [2022-11-20 11:14:25,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,380 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:25,380 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:25,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:14:25,381 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:25,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash 556067529, now seen corresponding path program 1 times [2022-11-20 11:14:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:25,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154309268] [2022-11-20 11:14:25,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:25,471 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-20 11:14:25,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:25,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154309268] [2022-11-20 11:14:25,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154309268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:25,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:25,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:14:25,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659650740] [2022-11-20 11:14:25,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:25,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:14:25,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:25,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:14:25,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:14:25,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 285 [2022-11-20 11:14:25,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:25,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 285 [2022-11-20 11:14:25,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:25,640 INFO L130 PetriNetUnfolder]: 113/713 cut-off events. [2022-11-20 11:14:25,640 INFO L131 PetriNetUnfolder]: For 31/37 co-relation queries the response was YES. [2022-11-20 11:14:25,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 713 events. 113/713 cut-off events. For 31/37 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3504 event pairs, 12 based on Foata normal form. 1/644 useless extension candidates. Maximal degree in co-relation 878. Up to 147 conditions per place. [2022-11-20 11:14:25,647 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 21 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-20 11:14:25,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 230 transitions, 522 flow [2022-11-20 11:14:25,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:14:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:14:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2022-11-20 11:14:25,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8982456140350877 [2022-11-20 11:14:25,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 768 transitions. [2022-11-20 11:14:25,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 768 transitions. [2022-11-20 11:14:25,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:25,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 768 transitions. [2022-11-20 11:14:25,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,657 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 455 flow. Second operand 3 states and 768 transitions. [2022-11-20 11:14:25,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 230 transitions, 522 flow [2022-11-20 11:14:25,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 230 transitions, 518 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:14:25,662 INFO L231 Difference]: Finished difference. Result has 223 places, 223 transitions, 463 flow [2022-11-20 11:14:25,663 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=223, PETRI_TRANSITIONS=223} [2022-11-20 11:14:25,664 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -34 predicate places. [2022-11-20 11:14:25,664 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 223 transitions, 463 flow [2022-11-20 11:14:25,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.66666666666666) internal successors, (749), 3 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,665 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:25,665 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:25,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:14:25,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:25,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash 69936621, now seen corresponding path program 1 times [2022-11-20 11:14:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:25,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378947704] [2022-11-20 11:14:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:25,877 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-20 11:14:25,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:25,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378947704] [2022-11-20 11:14:25,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378947704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:25,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:25,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:14:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639480630] [2022-11-20 11:14:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:25,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:14:25,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:14:25,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:14:25,882 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 285 [2022-11-20 11:14:25,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 223 transitions, 463 flow. Second operand has 7 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:25,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:25,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 285 [2022-11-20 11:14:25,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:27,344 INFO L130 PetriNetUnfolder]: 1939/5317 cut-off events. [2022-11-20 11:14:27,348 INFO L131 PetriNetUnfolder]: For 280/386 co-relation queries the response was YES. [2022-11-20 11:14:27,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8549 conditions, 5317 events. 1939/5317 cut-off events. For 280/386 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 43567 event pairs, 1024 based on Foata normal form. 1/4346 useless extension candidates. Maximal degree in co-relation 8514. Up to 1732 conditions per place. [2022-11-20 11:14:27,400 INFO L137 encePairwiseOnDemand]: 271/285 looper letters, 148 selfloop transitions, 18 changer transitions 0/326 dead transitions. [2022-11-20 11:14:27,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 326 transitions, 1037 flow [2022-11-20 11:14:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:14:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 11:14:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2352 transitions. [2022-11-20 11:14:27,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7502392344497608 [2022-11-20 11:14:27,407 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2352 transitions. [2022-11-20 11:14:27,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2352 transitions. [2022-11-20 11:14:27,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:27,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2352 transitions. [2022-11-20 11:14:27,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 213.8181818181818) internal successors, (2352), 11 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:27,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:27,421 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:27,421 INFO L175 Difference]: Start difference. First operand has 223 places, 223 transitions, 463 flow. Second operand 11 states and 2352 transitions. [2022-11-20 11:14:27,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 326 transitions, 1037 flow [2022-11-20 11:14:27,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 326 transitions, 1037 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:14:27,428 INFO L231 Difference]: Finished difference. Result has 237 places, 233 transitions, 549 flow [2022-11-20 11:14:27,428 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=549, PETRI_PLACES=237, PETRI_TRANSITIONS=233} [2022-11-20 11:14:27,429 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -20 predicate places. [2022-11-20 11:14:27,429 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 233 transitions, 549 flow [2022-11-20 11:14:27,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:27,430 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:27,430 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:27,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:14:27,431 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1505767668, now seen corresponding path program 1 times [2022-11-20 11:14:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:27,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980519904] [2022-11-20 11:14:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:27,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:27,979 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-20 11:14:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:27,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980519904] [2022-11-20 11:14:27,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980519904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:27,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:27,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:14:27,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870455991] [2022-11-20 11:14:27,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:27,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:14:27,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:27,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:14:27,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:14:27,983 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-20 11:14:27,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 233 transitions, 549 flow. Second operand has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:27,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:27,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-20 11:14:27,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:30,251 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,252 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-20 11:14:30,252 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 11:14:30,252 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 11:14:30,253 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-20 11:14:30,388 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 66#L97-4true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,389 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-20 11:14:30,389 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-20 11:14:30,389 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-20 11:14:30,389 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-20 11:14:30,444 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 182#L98-5true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,445 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-20 11:14:30,445 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-20 11:14:30,445 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-20 11:14:30,446 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-20 11:14:30,446 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,447 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-20 11:14:30,447 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-20 11:14:30,447 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-20 11:14:30,447 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-20 11:14:30,448 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 58#L61true, 340#true]) [2022-11-20 11:14:30,448 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-20 11:14:30,449 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 11:14:30,449 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 11:14:30,449 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 11:14:30,450 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 145#L98-1true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,450 INFO L383 tUnfolder$Statistics]: this new event has 178 ancestors and is cut-off event [2022-11-20 11:14:30,450 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 11:14:30,450 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-20 11:14:30,451 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 11:14:30,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(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|)), 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,452 INFO L383 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-11-20 11:14:30,452 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 11:14:30,452 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 11:14:30,452 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-11-20 11:14:30,453 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 311#(= |#race~A~0| 0), Black: 326#(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|)), 211#L98-2true, 265#L51-3true, Black: 324#(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|)), 271#L75true, Black: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,453 INFO L383 tUnfolder$Statistics]: this new event has 179 ancestors and is cut-off event [2022-11-20 11:14:30,454 INFO L386 tUnfolder$Statistics]: existing Event has 157 ancestors and is cut-off event [2022-11-20 11:14:30,454 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-20 11:14:30,454 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-20 11:14:30,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 182#L98-5true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,475 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-20 11:14:30,476 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-20 11:14:30,476 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-20 11:14:30,476 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 11:14:30,477 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 86#L98-6true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,477 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-20 11:14:30,477 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 11:14:30,478 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-20 11:14:30,478 INFO L386 tUnfolder$Statistics]: existing Event has 178 ancestors and is cut-off event [2022-11-20 11:14:30,478 INFO L386 tUnfolder$Statistics]: existing Event has 156 ancestors and is cut-off event [2022-11-20 11:14:30,479 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 58#L61true, 340#true]) [2022-11-20 11:14:30,479 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-20 11:14:30,479 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-20 11:14:30,480 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-20 11:14:30,480 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-20 11:14:30,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 145#L98-1true, 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,481 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-20 11:14:30,481 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-20 11:14:30,481 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 11:14:30,482 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-20 11:14:30,482 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,483 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-20 11:14:30,483 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 11:14:30,483 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-20 11:14:30,483 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-20 11:14:30,484 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 173#thread3ENTRYtrue, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 211#L98-2true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,484 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-20 11:14:30,485 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-20 11:14:30,578 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-20 11:14:30,579 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-20 11:14:30,603 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 86#L98-6true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,603 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-20 11:14:30,603 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-20 11:14:30,604 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-20 11:14:30,604 INFO L386 tUnfolder$Statistics]: existing Event has 171 ancestors and is cut-off event [2022-11-20 11:14:30,605 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][211], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, 182#L98-5true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,605 INFO L383 tUnfolder$Statistics]: this new event has 184 ancestors and is cut-off event [2022-11-20 11:14:30,605 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-20 11:14:30,605 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-20 11:14:30,605 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-20 11:14:30,606 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][212], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 207#L98-4true, 58#L61true, 340#true]) [2022-11-20 11:14:30,607 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-20 11:14:30,607 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-20 11:14:30,607 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-20 11:14:30,607 INFO L386 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-11-20 11:14:30,608 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 145#L98-1true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,608 INFO L383 tUnfolder$Statistics]: this new event has 180 ancestors and is cut-off event [2022-11-20 11:14:30,609 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 11:14:30,609 INFO L386 tUnfolder$Statistics]: existing Event has 158 ancestors and is cut-off event [2022-11-20 11:14:30,609 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-20 11:14:30,610 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][213], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), 94#L98-3true, Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,610 INFO L383 tUnfolder$Statistics]: this new event has 182 ancestors and is cut-off event [2022-11-20 11:14:30,610 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-20 11:14:30,611 INFO L386 tUnfolder$Statistics]: existing Event has 168 ancestors and is cut-off event [2022-11-20 11:14:30,611 INFO L386 tUnfolder$Statistics]: existing Event has 160 ancestors and is cut-off event [2022-11-20 11:14:30,612 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][214], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 211#L98-2true, 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,612 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-20 11:14:30,612 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 11:14:30,612 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-20 11:14:30,613 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-20 11:14:30,630 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 66#L97-4true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), 271#L75true, Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,630 INFO L383 tUnfolder$Statistics]: this new event has 183 ancestors and is cut-off event [2022-11-20 11:14:30,631 INFO L386 tUnfolder$Statistics]: existing Event has 161 ancestors and is cut-off event [2022-11-20 11:14:30,631 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-20 11:14:30,631 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-20 11:14:30,666 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([773] L59-->L61: Formula: (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_11 4))) (let ((.cse1 (select |v_#race_205| v_~C~0.base_57)) (.cse7 (+ .cse8 v_~C~0.offset_57 1))) (let ((.cse2 (+ .cse8 v_~C~0.offset_57)) (.cse4 (+ 2 .cse8 v_~C~0.offset_57)) (.cse3 (+ 3 .cse8 v_~C~0.offset_57)) (.cse0 (select .cse1 .cse7)) (.cse5 (+ .cse8 v_~A~0.offset_49))) (and (= |v_#race~A~0_30| 0) (= .cse0 (select .cse1 .cse2)) (= .cse0 (select .cse1 .cse3)) (= .cse0 (select .cse1 .cse4)) (= |v_#race~C~0_40| 0) (= |v_#memory_int_75| (store |v_#memory_int_76| v_~C~0.base_57 (store (select |v_#memory_int_76| v_~C~0.base_57) .cse2 (+ (select (select |v_#memory_int_76| v_~A~0.base_49) .cse5) 1)))) (= (let ((.cse6 (store |v_#race_207| v_~A~0.base_49 (store (store (store (store (select |v_#race_207| v_~A~0.base_49) .cse5 0) (+ .cse8 v_~A~0.offset_49 1) 0) (+ 2 .cse8 v_~A~0.offset_49) 0) (+ 3 .cse8 v_~A~0.offset_49) 0)))) (store .cse6 v_~C~0.base_57 (store (store (store (store (select .cse6 v_~C~0.base_57) .cse2 .cse0) .cse7 .cse0) .cse4 .cse0) .cse3 .cse0))) |v_#race_205|))))) InVars {#race=|v_#race_207|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_76|} OutVars{#race=|v_#race_205|, thread2Thread1of1ForFork0_~i~1=v_thread2Thread1of1ForFork0_~i~1_11, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, ~C~0.base=v_~C~0.base_57, thread2Thread1of1ForFork0_#t~nondet6=|v_thread2Thread1of1ForFork0_#t~nondet6_3|, ~C~0.offset=v_~C~0.offset_57, #memory_int=|v_#memory_int_75|, thread2Thread1of1ForFork0_#t~mem5=|v_thread2Thread1of1ForFork0_#t~mem5_5|, #race~C~0=|v_#race~C~0_40|, #race~A~0=|v_#race~A~0_30|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~nondet6, #memory_int, thread2Thread1of1ForFork0_#t~mem5, #race~C~0, #race~A~0][183], [322#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), 288#(= |#race~N~0| 0), 162#L79true, 66#L97-4true, 311#(= |#race~A~0| 0), Black: 326#(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|)), 265#L51-3true, Black: 324#(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: 334#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 332#(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|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 309#true, 58#L61true, 340#true]) [2022-11-20 11:14:30,667 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-20 11:14:30,667 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-20 11:14:30,667 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-20 11:14:30,667 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-20 11:14:30,749 INFO L130 PetriNetUnfolder]: 3007/7208 cut-off events. [2022-11-20 11:14:30,749 INFO L131 PetriNetUnfolder]: For 994/1039 co-relation queries the response was YES. [2022-11-20 11:14:30,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12995 conditions, 7208 events. 3007/7208 cut-off events. For 994/1039 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 59212 event pairs, 899 based on Foata normal form. 36/6530 useless extension candidates. Maximal degree in co-relation 12953. Up to 2638 conditions per place. [2022-11-20 11:14:30,844 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 99 selfloop transitions, 13 changer transitions 0/296 dead transitions. [2022-11-20 11:14:30,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 296 transitions, 922 flow [2022-11-20 11:14:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:14:30,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:14:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1380 transitions. [2022-11-20 11:14:30,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8070175438596491 [2022-11-20 11:14:30,850 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1380 transitions. [2022-11-20 11:14:30,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1380 transitions. [2022-11-20 11:14:30,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:30,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1380 transitions. [2022-11-20 11:14:30,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:30,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:30,861 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:30,861 INFO L175 Difference]: Start difference. First operand has 237 places, 233 transitions, 549 flow. Second operand 6 states and 1380 transitions. [2022-11-20 11:14:30,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 296 transitions, 922 flow [2022-11-20 11:14:30,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 296 transitions, 917 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:14:30,873 INFO L231 Difference]: Finished difference. Result has 245 places, 245 transitions, 654 flow [2022-11-20 11:14:30,874 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=654, PETRI_PLACES=245, PETRI_TRANSITIONS=245} [2022-11-20 11:14:30,875 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, -12 predicate places. [2022-11-20 11:14:30,875 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 245 transitions, 654 flow [2022-11-20 11:14:30,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:30,876 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:30,877 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:30,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:14:30,877 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:30,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash -254816675, now seen corresponding path program 1 times [2022-11-20 11:14:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:30,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402277363] [2022-11-20 11:14:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:31,083 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-20 11:14:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:31,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402277363] [2022-11-20 11:14:31,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402277363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:31,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:31,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 11:14:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752688401] [2022-11-20 11:14:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:31,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 11:14:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:31,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 11:14:31,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 11:14:31,088 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 285 [2022-11-20 11:14:31,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 245 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:31,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:31,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 285 [2022-11-20 11:14:31,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:32,827 INFO L130 PetriNetUnfolder]: 2622/5781 cut-off events. [2022-11-20 11:14:32,828 INFO L131 PetriNetUnfolder]: For 3467/4069 co-relation queries the response was YES. [2022-11-20 11:14:32,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 5781 events. 2622/5781 cut-off events. For 3467/4069 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 44406 event pairs, 1283 based on Foata normal form. 40/4693 useless extension candidates. Maximal degree in co-relation 11632. Up to 3250 conditions per place. [2022-11-20 11:14:32,895 INFO L137 encePairwiseOnDemand]: 271/285 looper letters, 133 selfloop transitions, 18 changer transitions 0/324 dead transitions. [2022-11-20 11:14:32,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 324 transitions, 1138 flow [2022-11-20 11:14:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 11:14:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 11:14:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2410 transitions. [2022-11-20 11:14:32,902 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7687400318979266 [2022-11-20 11:14:32,902 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2410 transitions. [2022-11-20 11:14:32,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2410 transitions. [2022-11-20 11:14:32,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:32,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2410 transitions. [2022-11-20 11:14:32,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 219.0909090909091) internal successors, (2410), 11 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:32,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:32,919 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 285.0) internal successors, (3420), 12 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:32,919 INFO L175 Difference]: Start difference. First operand has 245 places, 245 transitions, 654 flow. Second operand 11 states and 2410 transitions. [2022-11-20 11:14:32,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 324 transitions, 1138 flow [2022-11-20 11:14:32,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 324 transitions, 1138 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:14:32,930 INFO L231 Difference]: Finished difference. Result has 257 places, 247 transitions, 702 flow [2022-11-20 11:14:32,930 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=702, PETRI_PLACES=257, PETRI_TRANSITIONS=247} [2022-11-20 11:14:32,931 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 0 predicate places. [2022-11-20 11:14:32,931 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 247 transitions, 702 flow [2022-11-20 11:14:32,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 209.42857142857142) internal successors, (1466), 7 states have internal predecessors, (1466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:32,933 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:32,933 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:32,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:14:32,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:32,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash -334268178, now seen corresponding path program 1 times [2022-11-20 11:14:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:32,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053318838] [2022-11-20 11:14:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:32,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:33,571 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-20 11:14:33,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:33,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053318838] [2022-11-20 11:14:33,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053318838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:33,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:33,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:14:33,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747572424] [2022-11-20 11:14:33,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:33,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:14:33,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:33,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:14:33,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:14:33,577 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-20 11:14:33,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 247 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:33,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:33,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-20 11:14:33,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:35,606 INFO L130 PetriNetUnfolder]: 2201/6871 cut-off events. [2022-11-20 11:14:35,606 INFO L131 PetriNetUnfolder]: For 3758/3788 co-relation queries the response was YES. [2022-11-20 11:14:35,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13361 conditions, 6871 events. 2201/6871 cut-off events. For 3758/3788 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 66751 event pairs, 1289 based on Foata normal form. 24/6560 useless extension candidates. Maximal degree in co-relation 13312. Up to 2846 conditions per place. [2022-11-20 11:14:35,694 INFO L137 encePairwiseOnDemand]: 278/285 looper letters, 80 selfloop transitions, 17 changer transitions 0/283 dead transitions. [2022-11-20 11:14:35,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 283 transitions, 1038 flow [2022-11-20 11:14:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:14:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:14:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1349 transitions. [2022-11-20 11:14:35,699 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2022-11-20 11:14:35,700 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1349 transitions. [2022-11-20 11:14:35,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1349 transitions. [2022-11-20 11:14:35,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:35,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1349 transitions. [2022-11-20 11:14:35,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 224.83333333333334) internal successors, (1349), 6 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:35,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:35,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:35,711 INFO L175 Difference]: Start difference. First operand has 257 places, 247 transitions, 702 flow. Second operand 6 states and 1349 transitions. [2022-11-20 11:14:35,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 283 transitions, 1038 flow [2022-11-20 11:14:35,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 283 transitions, 1021 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 11:14:35,755 INFO L231 Difference]: Finished difference. Result has 262 places, 263 transitions, 869 flow [2022-11-20 11:14:35,756 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=262, PETRI_TRANSITIONS=263} [2022-11-20 11:14:35,757 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 5 predicate places. [2022-11-20 11:14:35,758 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 263 transitions, 869 flow [2022-11-20 11:14:35,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.0) internal successors, (1290), 6 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:35,759 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:35,759 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:35,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:14:35,759 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:35,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:35,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2126054492, now seen corresponding path program 1 times [2022-11-20 11:14:35,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:35,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63866192] [2022-11-20 11:14:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:14:36,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:36,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63866192] [2022-11-20 11:14:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63866192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:36,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:36,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:14:36,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30613677] [2022-11-20 11:14:36,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:36,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:14:36,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:14:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:14:36,340 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 285 [2022-11-20 11:14:36,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 263 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:36,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:36,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 285 [2022-11-20 11:14:36,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:39,401 INFO L130 PetriNetUnfolder]: 4882/12923 cut-off events. [2022-11-20 11:14:39,402 INFO L131 PetriNetUnfolder]: For 11447/11447 co-relation queries the response was YES. [2022-11-20 11:14:39,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28061 conditions, 12923 events. 4882/12923 cut-off events. For 11447/11447 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 131861 event pairs, 1972 based on Foata normal form. 0/12545 useless extension candidates. Maximal degree in co-relation 28011. Up to 5365 conditions per place. [2022-11-20 11:14:39,547 INFO L137 encePairwiseOnDemand]: 277/285 looper letters, 143 selfloop transitions, 26 changer transitions 0/349 dead transitions. [2022-11-20 11:14:39,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 349 transitions, 1635 flow [2022-11-20 11:14:39,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:14:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:14:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1367 transitions. [2022-11-20 11:14:39,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7994152046783626 [2022-11-20 11:14:39,552 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1367 transitions. [2022-11-20 11:14:39,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1367 transitions. [2022-11-20 11:14:39,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:39,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1367 transitions. [2022-11-20 11:14:39,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 227.83333333333334) internal successors, (1367), 6 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:39,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:39,561 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:39,561 INFO L175 Difference]: Start difference. First operand has 262 places, 263 transitions, 869 flow. Second operand 6 states and 1367 transitions. [2022-11-20 11:14:39,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 349 transitions, 1635 flow [2022-11-20 11:14:39,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 349 transitions, 1635 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 11:14:39,663 INFO L231 Difference]: Finished difference. Result has 272 places, 288 transitions, 1173 flow [2022-11-20 11:14:39,664 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1173, PETRI_PLACES=272, PETRI_TRANSITIONS=288} [2022-11-20 11:14:39,666 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 15 predicate places. [2022-11-20 11:14:39,666 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 288 transitions, 1173 flow [2022-11-20 11:14:39,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.5) internal successors, (1281), 6 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:39,667 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:39,667 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:39,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:14:39,667 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:39,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1237774503, now seen corresponding path program 1 times [2022-11-20 11:14:39,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:39,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366634777] [2022-11-20 11:14:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:14:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:39,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366634777] [2022-11-20 11:14:39,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366634777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:39,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:39,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 11:14:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739216786] [2022-11-20 11:14:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:39,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 11:14:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:39,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 11:14:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 11:14:39,736 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 285 [2022-11-20 11:14:39,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 288 transitions, 1173 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:39,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:39,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 285 [2022-11-20 11:14:39,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:41,519 INFO L130 PetriNetUnfolder]: 2145/6631 cut-off events. [2022-11-20 11:14:41,520 INFO L131 PetriNetUnfolder]: For 17835/18181 co-relation queries the response was YES. [2022-11-20 11:14:41,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 6631 events. 2145/6631 cut-off events. For 17835/18181 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 63859 event pairs, 664 based on Foata normal form. 0/6368 useless extension candidates. Maximal degree in co-relation 16488. Up to 2137 conditions per place. [2022-11-20 11:14:41,615 INFO L137 encePairwiseOnDemand]: 282/285 looper letters, 70 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-11-20 11:14:41,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 302 transitions, 1441 flow [2022-11-20 11:14:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 11:14:41,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 11:14:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2022-11-20 11:14:41,619 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.87953216374269 [2022-11-20 11:14:41,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2022-11-20 11:14:41,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2022-11-20 11:14:41,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:41,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2022-11-20 11:14:41,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:41,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:41,626 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:41,627 INFO L175 Difference]: Start difference. First operand has 272 places, 288 transitions, 1173 flow. Second operand 3 states and 752 transitions. [2022-11-20 11:14:41,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 302 transitions, 1441 flow [2022-11-20 11:14:41,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 302 transitions, 1371 flow, removed 35 selfloop flow, removed 0 redundant places. [2022-11-20 11:14:41,693 INFO L231 Difference]: Finished difference. Result has 273 places, 287 transitions, 1119 flow [2022-11-20 11:14:41,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1119, PETRI_PLACES=273, PETRI_TRANSITIONS=287} [2022-11-20 11:14:41,695 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 16 predicate places. [2022-11-20 11:14:41,695 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 287 transitions, 1119 flow [2022-11-20 11:14:41,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:41,696 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:41,696 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:41,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:14:41,697 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1866306840, now seen corresponding path program 1 times [2022-11-20 11:14:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:41,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072321471] [2022-11-20 11:14:41,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:42,411 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-20 11:14:42,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:42,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072321471] [2022-11-20 11:14:42,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072321471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:42,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:42,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-20 11:14:42,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896949633] [2022-11-20 11:14:42,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:42,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:14:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:14:42,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:14:42,418 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 285 [2022-11-20 11:14:42,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 287 transitions, 1119 flow. Second operand has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:42,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:42,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 285 [2022-11-20 11:14:42,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:14:45,161 INFO L130 PetriNetUnfolder]: 3208/9688 cut-off events. [2022-11-20 11:14:45,162 INFO L131 PetriNetUnfolder]: For 11422/12194 co-relation queries the response was YES. [2022-11-20 11:14:45,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22046 conditions, 9688 events. 3208/9688 cut-off events. For 11422/12194 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 101141 event pairs, 1752 based on Foata normal form. 0/9526 useless extension candidates. Maximal degree in co-relation 21989. Up to 4485 conditions per place. [2022-11-20 11:14:45,304 INFO L137 encePairwiseOnDemand]: 280/285 looper letters, 104 selfloop transitions, 4 changer transitions 0/294 dead transitions. [2022-11-20 11:14:45,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 294 transitions, 1349 flow [2022-11-20 11:14:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 11:14:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-20 11:14:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1328 transitions. [2022-11-20 11:14:45,311 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.776608187134503 [2022-11-20 11:14:45,312 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1328 transitions. [2022-11-20 11:14:45,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1328 transitions. [2022-11-20 11:14:45,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:14:45,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1328 transitions. [2022-11-20 11:14:45,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 221.33333333333334) internal successors, (1328), 6 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:45,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:45,323 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 285.0) internal successors, (1995), 7 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:45,323 INFO L175 Difference]: Start difference. First operand has 273 places, 287 transitions, 1119 flow. Second operand 6 states and 1328 transitions. [2022-11-20 11:14:45,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 294 transitions, 1349 flow [2022-11-20 11:14:45,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 294 transitions, 1345 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 11:14:45,390 INFO L231 Difference]: Finished difference. Result has 275 places, 286 transitions, 1121 flow [2022-11-20 11:14:45,391 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1121, PETRI_PLACES=275, PETRI_TRANSITIONS=286} [2022-11-20 11:14:45,392 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 18 predicate places. [2022-11-20 11:14:45,393 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 286 transitions, 1121 flow [2022-11-20 11:14:45,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:45,394 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:14:45,394 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:14:45,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:14:45,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:14:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:14:45,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1761316457, now seen corresponding path program 1 times [2022-11-20 11:14:45,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:14:45,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054844640] [2022-11-20 11:14:45,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:14:45,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:14:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:14:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:14:47,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:14:47,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054844640] [2022-11-20 11:14:47,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054844640] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:14:47,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:14:47,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 11:14:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268376390] [2022-11-20 11:14:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:14:47,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:14:47,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:14:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:14:47,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:14:47,217 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 285 [2022-11-20 11:14:47,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 286 transitions, 1121 flow. Second operand has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:14:47,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:14:47,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 285 [2022-11-20 11:14:47,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 11:15:05,571 INFO L130 PetriNetUnfolder]: 40337/70492 cut-off events. [2022-11-20 11:15:05,571 INFO L131 PetriNetUnfolder]: For 59806/59845 co-relation queries the response was YES. [2022-11-20 11:15:06,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180425 conditions, 70492 events. 40337/70492 cut-off events. For 59806/59845 co-relation queries the response was YES. Maximal size of possible extension queue 2339. Compared 669503 event pairs, 11295 based on Foata normal form. 333/69584 useless extension candidates. Maximal degree in co-relation 180361. Up to 15605 conditions per place. [2022-11-20 11:15:06,485 INFO L137 encePairwiseOnDemand]: 262/285 looper letters, 393 selfloop transitions, 70 changer transitions 0/607 dead transitions. [2022-11-20 11:15:06,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 607 transitions, 4099 flow [2022-11-20 11:15:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 11:15:06,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-11-20 11:15:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4272 transitions. [2022-11-20 11:15:06,501 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6517162471395881 [2022-11-20 11:15:06,501 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4272 transitions. [2022-11-20 11:15:06,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4272 transitions. [2022-11-20 11:15:06,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 11:15:06,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4272 transitions. [2022-11-20 11:15:06,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 185.7391304347826) internal successors, (4272), 23 states have internal predecessors, (4272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:06,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:06,536 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 285.0) internal successors, (6840), 24 states have internal predecessors, (6840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:06,536 INFO L175 Difference]: Start difference. First operand has 275 places, 286 transitions, 1121 flow. Second operand 23 states and 4272 transitions. [2022-11-20 11:15:06,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 607 transitions, 4099 flow [2022-11-20 11:15:07,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 607 transitions, 4071 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 11:15:07,571 INFO L231 Difference]: Finished difference. Result has 298 places, 335 transitions, 1856 flow [2022-11-20 11:15:07,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1856, PETRI_PLACES=298, PETRI_TRANSITIONS=335} [2022-11-20 11:15:07,573 INFO L288 CegarLoopForPetriNet]: 257 programPoint places, 41 predicate places. [2022-11-20 11:15:07,573 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 335 transitions, 1856 flow [2022-11-20 11:15:07,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:07,574 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 11:15:07,575 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:15:07,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 11:15:07,575 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-20 11:15:07,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:15:07,576 INFO L85 PathProgramCache]: Analyzing trace with hash 212905121, now seen corresponding path program 2 times [2022-11-20 11:15:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:15:07,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741746019] [2022-11-20 11:15:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:15:07,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:15:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:15:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 11:15:09,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:15:09,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741746019] [2022-11-20 11:15:09,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741746019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:15:09,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:15:09,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-20 11:15:09,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168144113] [2022-11-20 11:15:09,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:15:09,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-20 11:15:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:15:09,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-20 11:15:09,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-20 11:15:09,088 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 285 [2022-11-20 11:15:09,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 335 transitions, 1856 flow. Second operand has 15 states, 15 states have (on average 178.46666666666667) internal successors, (2677), 15 states have internal predecessors, (2677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 11:15:09,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 11:15:09,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 285 [2022-11-20 11:15:09,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand