./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8393723b 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_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro --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 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 --- 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-8393723 [2022-11-18 20:58:20,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:58:20,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:58:20,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:58:20,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:58:20,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:58:20,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:58:20,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:58:20,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:58:20,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:58:20,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:58:20,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:58:20,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:58:20,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:58:20,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:58:20,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:58:20,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:58:20,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:58:20,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:58:20,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:58:20,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:58:20,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:58:20,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:58:20,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:58:20,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:58:20,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:58:20,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:58:20,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:58:20,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:58:20,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:58:20,327 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:58:20,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:58:20,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:58:20,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:58:20,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:58:20,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:58:20,333 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:58:20,333 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:58:20,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:58:20,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:58:20,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:58:20,336 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-18 20:58:20,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:58:20,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:58:20,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:58:20,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:58:20,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:58:20,363 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:58:20,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:58:20,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:58:20,364 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:58:20,365 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:58:20,365 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:58:20,365 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:58:20,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:58:20,366 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:58:20,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:58:20,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:58:20,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:58:20,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:58:20,367 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-18 20:58:20,367 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:58:20,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:58:20,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:58:20,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:58:20,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:58:20,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:58:20,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:58:20,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:58:20,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:58:20,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:58:20,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:58:20,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:58:20,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:58:20,369 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:58:20,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:58:20,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:58:20,370 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_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/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_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro 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 -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 [2022-11-18 20:58:20,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:58:20,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:58:20,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:58:20,722 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:58:20,723 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:58:20,725 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-11-18 20:58:20,805 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/data/c98796ee2/08df440c9a7c49bbbaff1f97890ece80/FLAG59fbcc56e [2022-11-18 20:58:21,327 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:58:21,327 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-11-18 20:58:21,335 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/data/c98796ee2/08df440c9a7c49bbbaff1f97890ece80/FLAG59fbcc56e [2022-11-18 20:58:21,710 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/data/c98796ee2/08df440c9a7c49bbbaff1f97890ece80 [2022-11-18 20:58:21,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:58:21,719 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:58:21,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:58:21,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:58:21,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:58:21,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:58:21" (1/1) ... [2022-11-18 20:58:21,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653190e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:21, skipping insertion in model container [2022-11-18 20:58:21,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:58:21" (1/1) ... [2022-11-18 20:58:21,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:58:21,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:58:21,994 WARN L234 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_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-11-18 20:58:22,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:58:22,014 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:58:22,051 WARN L234 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_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-11-18 20:58:22,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:58:22,082 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:58:22,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22 WrapperNode [2022-11-18 20:58:22,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:58:22,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:58:22,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:58:22,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:58:22,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,134 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2022-11-18 20:58:22,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:58:22,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:58:22,136 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:58:22,136 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:58:22,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,176 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:58:22,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:58:22,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:58:22,182 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:58:22,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (1/1) ... [2022-11-18 20:58:22,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:58:22,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:58:22,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:58:22,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:58:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:58:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:58:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:58:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:58:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-18 20:58:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-18 20:58:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-18 20:58:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-18 20:58:22,278 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-18 20:58:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-18 20:58:22,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:58:22,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:58:22,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:58:22,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:58:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:58:22,280 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:58:22,417 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:58:22,420 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:58:23,074 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:58:23,087 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:58:23,088 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:58:23,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:58:23 BoogieIcfgContainer [2022-11-18 20:58:23,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:58:23,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:58:23,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:58:23,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:58:23,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:58:21" (1/3) ... [2022-11-18 20:58:23,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90a0c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:58:23, skipping insertion in model container [2022-11-18 20:58:23,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:58:22" (2/3) ... [2022-11-18 20:58:23,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90a0c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:58:23, skipping insertion in model container [2022-11-18 20:58:23,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:58:23" (3/3) ... [2022-11-18 20:58:23,123 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-11-18 20:58:23,133 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:58:23,144 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:58:23,145 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-18 20:58:23,145 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:58:23,327 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-18 20:58:23,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 289 transitions, 602 flow [2022-11-18 20:58:23,540 INFO L130 PetriNetUnfolder]: 13/286 cut-off events. [2022-11-18 20:58:23,544 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-18 20:58:23,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 286 events. 13/286 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 432 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2022-11-18 20:58:23,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 289 transitions, 602 flow [2022-11-18 20:58:23,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 266 transitions, 550 flow [2022-11-18 20:58:23,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:58:23,599 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;@9c162e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:58:23,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2022-11-18 20:58:23,607 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-18 20:58:23,607 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:58:23,607 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:23,608 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-18 20:58:23,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1529868481, now seen corresponding path program 1 times [2022-11-18 20:58:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:23,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259801306] [2022-11-18 20:58:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:23,944 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-18 20:58:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:23,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259801306] [2022-11-18 20:58:23,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259801306] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:23,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:23,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142587899] [2022-11-18 20:58:23,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:23,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:23,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:24,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:24,027 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 289 [2022-11-18 20:58:24,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 266 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:24,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 289 [2022-11-18 20:58:24,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:24,316 INFO L130 PetriNetUnfolder]: 60/637 cut-off events. [2022-11-18 20:58:24,316 INFO L131 PetriNetUnfolder]: For 81/93 co-relation queries the response was YES. [2022-11-18 20:58:24,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 637 events. 60/637 cut-off events. For 81/93 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2987 event pairs, 39 based on Foata normal form. 34/534 useless extension candidates. Maximal degree in co-relation 568. Up to 99 conditions per place. [2022-11-18 20:58:24,333 INFO L137 encePairwiseOnDemand]: 279/289 looper letters, 21 selfloop transitions, 2 changer transitions 3/258 dead transitions. [2022-11-18 20:58:24,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 258 transitions, 580 flow [2022-11-18 20:58:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2022-11-18 20:58:24,363 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2022-11-18 20:58:24,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 799 transitions. [2022-11-18 20:58:24,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 799 transitions. [2022-11-18 20:58:24,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:24,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 799 transitions. [2022-11-18 20:58:24,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,406 INFO L175 Difference]: Start difference. First operand has 264 places, 266 transitions, 550 flow. Second operand 3 states and 799 transitions. [2022-11-18 20:58:24,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 258 transitions, 580 flow [2022-11-18 20:58:24,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 568 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-18 20:58:24,422 INFO L231 Difference]: Finished difference. Result has 259 places, 255 transitions, 520 flow [2022-11-18 20:58:24,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=259, PETRI_TRANSITIONS=255} [2022-11-18 20:58:24,429 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -5 predicate places. [2022-11-18 20:58:24,430 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 520 flow [2022-11-18 20:58:24,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,432 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:24,432 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] [2022-11-18 20:58:24,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:58:24,433 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:24,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1306778244, now seen corresponding path program 1 times [2022-11-18 20:58:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:24,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743564346] [2022-11-18 20:58:24,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:24,553 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-18 20:58:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:24,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743564346] [2022-11-18 20:58:24,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743564346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:24,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:24,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627999497] [2022-11-18 20:58:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:24,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:24,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 289 [2022-11-18 20:58:24,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 255 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:24,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 289 [2022-11-18 20:58:24,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:24,762 INFO L130 PetriNetUnfolder]: 36/538 cut-off events. [2022-11-18 20:58:24,762 INFO L131 PetriNetUnfolder]: For 9/26 co-relation queries the response was YES. [2022-11-18 20:58:24,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 627 conditions, 538 events. 36/538 cut-off events. For 9/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2232 event pairs, 21 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 593. Up to 74 conditions per place. [2022-11-18 20:58:24,772 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2022-11-18 20:58:24,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 254 transitions, 564 flow [2022-11-18 20:58:24,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2022-11-18 20:58:24,776 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9134948096885813 [2022-11-18 20:58:24,776 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2022-11-18 20:58:24,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2022-11-18 20:58:24,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:24,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2022-11-18 20:58:24,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,785 INFO L175 Difference]: Start difference. First operand has 259 places, 255 transitions, 520 flow. Second operand 3 states and 792 transitions. [2022-11-18 20:58:24,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 254 transitions, 564 flow [2022-11-18 20:58:24,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 254 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:58:24,794 INFO L231 Difference]: Finished difference. Result has 255 places, 254 transitions, 518 flow [2022-11-18 20:58:24,795 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=255, PETRI_TRANSITIONS=254} [2022-11-18 20:58:24,796 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -9 predicate places. [2022-11-18 20:58:24,796 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 254 transitions, 518 flow [2022-11-18 20:58:24,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,798 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:24,798 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] [2022-11-18 20:58:24,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:58:24,799 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:24,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1395074073, now seen corresponding path program 1 times [2022-11-18 20:58:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:24,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544394116] [2022-11-18 20:58:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:24,936 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-18 20:58:24,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:24,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544394116] [2022-11-18 20:58:24,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544394116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:24,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:24,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:24,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241198663] [2022-11-18 20:58:24,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:24,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:24,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:24,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:24,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:24,942 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-18 20:58:24,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 254 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:24,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:24,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-18 20:58:24,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:25,104 INFO L130 PetriNetUnfolder]: 25/487 cut-off events. [2022-11-18 20:58:25,104 INFO L131 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2022-11-18 20:58:25,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 487 events. 25/487 cut-off events. For 8/17 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1854 event pairs, 12 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 505. Up to 46 conditions per place. [2022-11-18 20:58:25,111 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 15 selfloop transitions, 1 changer transitions 0/250 dead transitions. [2022-11-18 20:58:25,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 542 flow [2022-11-18 20:58:25,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-11-18 20:58:25,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9192618223760092 [2022-11-18 20:58:25,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-11-18 20:58:25,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-11-18 20:58:25,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:25,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-11-18 20:58:25,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,124 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,125 INFO L175 Difference]: Start difference. First operand has 255 places, 254 transitions, 518 flow. Second operand 3 states and 797 transitions. [2022-11-18 20:58:25,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 542 flow [2022-11-18 20:58:25,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 250 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:58:25,145 INFO L231 Difference]: Finished difference. Result has 251 places, 250 transitions, 508 flow [2022-11-18 20:58:25,145 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=508, PETRI_PLACES=251, PETRI_TRANSITIONS=250} [2022-11-18 20:58:25,148 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-18 20:58:25,149 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 250 transitions, 508 flow [2022-11-18 20:58:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:25,150 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] [2022-11-18 20:58:25,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:58:25,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1497090613, now seen corresponding path program 1 times [2022-11-18 20:58:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:25,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141681092] [2022-11-18 20:58:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:25,314 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-18 20:58:25,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:25,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141681092] [2022-11-18 20:58:25,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141681092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:25,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:25,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284113460] [2022-11-18 20:58:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:25,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:25,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:25,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-18 20:58:25,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 250 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:25,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-18 20:58:25,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:25,718 INFO L130 PetriNetUnfolder]: 224/1619 cut-off events. [2022-11-18 20:58:25,718 INFO L131 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2022-11-18 20:58:25,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1619 events. 224/1619 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12264 event pairs, 135 based on Foata normal form. 0/1296 useless extension candidates. Maximal degree in co-relation 1926. Up to 322 conditions per place. [2022-11-18 20:58:25,740 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 18 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2022-11-18 20:58:25,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 249 transitions, 546 flow [2022-11-18 20:58:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:25,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 798 transitions. [2022-11-18 20:58:25,743 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9204152249134948 [2022-11-18 20:58:25,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 798 transitions. [2022-11-18 20:58:25,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 798 transitions. [2022-11-18 20:58:25,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:25,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 798 transitions. [2022-11-18 20:58:25,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,756 INFO L175 Difference]: Start difference. First operand has 251 places, 250 transitions, 508 flow. Second operand 3 states and 798 transitions. [2022-11-18 20:58:25,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 249 transitions, 546 flow [2022-11-18 20:58:25,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:58:25,762 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 509 flow [2022-11-18 20:58:25,768 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2022-11-18 20:58:25,770 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-18 20:58:25,770 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 509 flow [2022-11-18 20:58:25,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:25,771 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:25,771 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] [2022-11-18 20:58:25,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:58:25,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:25,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1094194347, now seen corresponding path program 1 times [2022-11-18 20:58:25,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:25,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262044069] [2022-11-18 20:58:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:25,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:26,504 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-18 20:58:26,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:26,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262044069] [2022-11-18 20:58:26,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262044069] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:26,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:26,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:58:26,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606863695] [2022-11-18 20:58:26,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:26,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:58:26,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:58:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:58:26,513 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 289 [2022-11-18 20:58:26,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 509 flow. Second operand has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:26,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:26,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 289 [2022-11-18 20:58:26,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:31,038 INFO L130 PetriNetUnfolder]: 7760/21074 cut-off events. [2022-11-18 20:58:31,038 INFO L131 PetriNetUnfolder]: For 84/1596 co-relation queries the response was YES. [2022-11-18 20:58:31,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31753 conditions, 21074 events. 7760/21074 cut-off events. For 84/1596 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 232427 event pairs, 6552 based on Foata normal form. 0/16642 useless extension candidates. Maximal degree in co-relation 31713. Up to 10612 conditions per place. [2022-11-18 20:58:31,409 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 53 selfloop transitions, 5 changer transitions 0/248 dead transitions. [2022-11-18 20:58:31,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 623 flow [2022-11-18 20:58:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:58:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:58:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1385 transitions. [2022-11-18 20:58:31,415 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7987312572087658 [2022-11-18 20:58:31,415 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1385 transitions. [2022-11-18 20:58:31,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1385 transitions. [2022-11-18 20:58:31,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:31,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1385 transitions. [2022-11-18 20:58:31,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.83333333333334) internal successors, (1385), 6 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,427 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,427 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 509 flow. Second operand 6 states and 1385 transitions. [2022-11-18 20:58:31,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 623 flow [2022-11-18 20:58:31,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:58:31,436 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 513 flow [2022-11-18 20:58:31,437 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=513, PETRI_PLACES=253, PETRI_TRANSITIONS=248} [2022-11-18 20:58:31,441 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -11 predicate places. [2022-11-18 20:58:31,442 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 513 flow [2022-11-18 20:58:31,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.83333333333334) internal successors, (1337), 6 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,444 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:31,445 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] [2022-11-18 20:58:31,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:58:31,446 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1683284585, now seen corresponding path program 1 times [2022-11-18 20:58:31,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:31,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611622588] [2022-11-18 20:58:31,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:31,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:31,538 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-18 20:58:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611622588] [2022-11-18 20:58:31,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611622588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:31,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:31,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137892698] [2022-11-18 20:58:31,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:31,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:31,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:31,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:31,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:31,544 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-18 20:58:31,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 248 transitions, 513 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:31,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-18 20:58:31,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:31,670 INFO L130 PetriNetUnfolder]: 37/520 cut-off events. [2022-11-18 20:58:31,670 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-11-18 20:58:31,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 520 events. 37/520 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2098 event pairs, 20 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 574. Up to 56 conditions per place. [2022-11-18 20:58:31,676 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 15 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2022-11-18 20:58:31,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 537 flow [2022-11-18 20:58:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:31,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-11-18 20:58:31,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9192618223760092 [2022-11-18 20:58:31,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-11-18 20:58:31,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-11-18 20:58:31,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:31,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-11-18 20:58:31,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,687 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,687 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 513 flow. Second operand 3 states and 797 transitions. [2022-11-18 20:58:31,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 537 flow [2022-11-18 20:58:31,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 244 transitions, 527 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:58:31,692 INFO L231 Difference]: Finished difference. Result has 246 places, 244 transitions, 497 flow [2022-11-18 20:58:31,693 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=246, PETRI_TRANSITIONS=244} [2022-11-18 20:58:31,696 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-11-18 20:58:31,697 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 244 transitions, 497 flow [2022-11-18 20:58:31,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,698 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:31,698 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] [2022-11-18 20:58:31,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:58:31,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:31,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:31,699 INFO L85 PathProgramCache]: Analyzing trace with hash 456784832, now seen corresponding path program 1 times [2022-11-18 20:58:31,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:31,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687535677] [2022-11-18 20:58:31,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:31,770 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-18 20:58:31,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:31,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687535677] [2022-11-18 20:58:31,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687535677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:31,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:31,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:31,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883170726] [2022-11-18 20:58:31,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:31,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:31,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:31,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:31,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:31,782 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-18 20:58:31,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 244 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:31,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-18 20:58:31,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:31,847 INFO L130 PetriNetUnfolder]: 18/311 cut-off events. [2022-11-18 20:58:31,847 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-18 20:58:31,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 311 events. 18/311 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 865 event pairs, 6 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 325. Up to 23 conditions per place. [2022-11-18 20:58:31,850 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 12 selfloop transitions, 3 changer transitions 0/244 dead transitions. [2022-11-18 20:58:31,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 244 transitions, 529 flow [2022-11-18 20:58:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2022-11-18 20:58:31,854 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.936562860438293 [2022-11-18 20:58:31,854 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2022-11-18 20:58:31,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2022-11-18 20:58:31,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:31,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2022-11-18 20:58:31,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,862 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,862 INFO L175 Difference]: Start difference. First operand has 246 places, 244 transitions, 497 flow. Second operand 3 states and 812 transitions. [2022-11-18 20:58:31,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 244 transitions, 529 flow [2022-11-18 20:58:31,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 244 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:58:31,868 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 498 flow [2022-11-18 20:58:31,868 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2022-11-18 20:58:31,870 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -19 predicate places. [2022-11-18 20:58:31,870 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 498 flow [2022-11-18 20:58:31,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:31,871 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] [2022-11-18 20:58:31,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:58:31,872 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:31,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:31,873 INFO L85 PathProgramCache]: Analyzing trace with hash 883580898, now seen corresponding path program 1 times [2022-11-18 20:58:31,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:31,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070604536] [2022-11-18 20:58:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:31,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:31,924 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-18 20:58:31,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:31,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070604536] [2022-11-18 20:58:31,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070604536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:31,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:31,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:31,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057023923] [2022-11-18 20:58:31,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:31,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:31,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:31,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:31,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:31,928 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2022-11-18 20:58:31,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:31,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:31,930 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2022-11-18 20:58:31,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:32,120 INFO L130 PetriNetUnfolder]: 114/1130 cut-off events. [2022-11-18 20:58:32,121 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-11-18 20:58:32,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 1130 events. 114/1130 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7474 event pairs, 29 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1290. Up to 161 conditions per place. [2022-11-18 20:58:32,132 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 19 selfloop transitions, 3 changer transitions 0/247 dead transitions. [2022-11-18 20:58:32,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 247 transitions, 557 flow [2022-11-18 20:58:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-11-18 20:58:32,135 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9354094579008074 [2022-11-18 20:58:32,135 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-11-18 20:58:32,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-11-18 20:58:32,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:32,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-11-18 20:58:32,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,141 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 498 flow. Second operand 3 states and 811 transitions. [2022-11-18 20:58:32,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 247 transitions, 557 flow [2022-11-18 20:58:32,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 247 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:58:32,146 INFO L231 Difference]: Finished difference. Result has 243 places, 242 transitions, 507 flow [2022-11-18 20:58:32,147 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=507, PETRI_PLACES=243, PETRI_TRANSITIONS=242} [2022-11-18 20:58:32,148 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -21 predicate places. [2022-11-18 20:58:32,148 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 242 transitions, 507 flow [2022-11-18 20:58:32,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,149 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:32,149 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] [2022-11-18 20:58:32,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:58:32,150 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:32,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1068977208, now seen corresponding path program 1 times [2022-11-18 20:58:32,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:32,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616749589] [2022-11-18 20:58:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:32,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:32,195 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-18 20:58:32,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:32,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616749589] [2022-11-18 20:58:32,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616749589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:32,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:32,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126243690] [2022-11-18 20:58:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:32,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:32,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:32,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:32,200 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-18 20:58:32,201 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 242 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:32,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-18 20:58:32,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:32,359 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([738] thread3EXIT-->L87-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem25#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, ULTIMATE.start_main_#t~mem25#1=|v_ULTIMATE.start_main_#t~mem25#1_5|, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][234], [322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 61#L87-7true, 325#true]) [2022-11-18 20:58:32,359 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-18 20:58:32,360 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-18 20:58:32,360 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-18 20:58:32,360 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-18 20:58:32,360 INFO L130 PetriNetUnfolder]: 63/605 cut-off events. [2022-11-18 20:58:32,360 INFO L131 PetriNetUnfolder]: For 30/38 co-relation queries the response was YES. [2022-11-18 20:58:32,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 605 events. 63/605 cut-off events. For 30/38 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2883 event pairs, 12 based on Foata normal form. 2/544 useless extension candidates. Maximal degree in co-relation 717. Up to 50 conditions per place. [2022-11-18 20:58:32,370 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 12 selfloop transitions, 3 changer transitions 0/242 dead transitions. [2022-11-18 20:58:32,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 242 transitions, 539 flow [2022-11-18 20:58:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2022-11-18 20:58:32,373 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.936562860438293 [2022-11-18 20:58:32,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2022-11-18 20:58:32,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2022-11-18 20:58:32,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:32,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2022-11-18 20:58:32,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,380 INFO L175 Difference]: Start difference. First operand has 243 places, 242 transitions, 507 flow. Second operand 3 states and 812 transitions. [2022-11-18 20:58:32,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 242 transitions, 539 flow [2022-11-18 20:58:32,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:58:32,386 INFO L231 Difference]: Finished difference. Result has 243 places, 240 transitions, 509 flow [2022-11-18 20:58:32,386 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=243, PETRI_TRANSITIONS=240} [2022-11-18 20:58:32,387 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -21 predicate places. [2022-11-18 20:58:32,388 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 240 transitions, 509 flow [2022-11-18 20:58:32,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 3 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,389 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:32,389 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] [2022-11-18 20:58:32,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:58:32,389 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:32,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:32,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1484134374, now seen corresponding path program 1 times [2022-11-18 20:58:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256053795] [2022-11-18 20:58:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:32,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:32,677 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-18 20:58:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:32,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256053795] [2022-11-18 20:58:32,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256053795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:32,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:32,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:58:32,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300264019] [2022-11-18 20:58:32,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:32,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:58:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:58:32,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:58:32,691 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 289 [2022-11-18 20:58:32,694 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 240 transitions, 509 flow. Second operand has 7 states, 7 states have (on average 241.71428571428572) internal successors, (1692), 7 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:32,694 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:32,694 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 289 [2022-11-18 20:58:32,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:33,134 INFO L130 PetriNetUnfolder]: 256/1414 cut-off events. [2022-11-18 20:58:33,134 INFO L131 PetriNetUnfolder]: For 42/97 co-relation queries the response was YES. [2022-11-18 20:58:33,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1414 events. 256/1414 cut-off events. For 42/97 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9127 event pairs, 118 based on Foata normal form. 0/1165 useless extension candidates. Maximal degree in co-relation 1937. Up to 337 conditions per place. [2022-11-18 20:58:33,154 INFO L137 encePairwiseOnDemand]: 280/289 looper letters, 57 selfloop transitions, 8 changer transitions 0/265 dead transitions. [2022-11-18 20:58:33,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 265 transitions, 697 flow [2022-11-18 20:58:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:58:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 20:58:33,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1978 transitions. [2022-11-18 20:58:33,172 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8555363321799307 [2022-11-18 20:58:33,173 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1978 transitions. [2022-11-18 20:58:33,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1978 transitions. [2022-11-18 20:58:33,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:33,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1978 transitions. [2022-11-18 20:58:33,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 247.25) internal successors, (1978), 8 states have internal predecessors, (1978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,186 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 289.0) internal successors, (2601), 9 states have internal predecessors, (2601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,187 INFO L175 Difference]: Start difference. First operand has 243 places, 240 transitions, 509 flow. Second operand 8 states and 1978 transitions. [2022-11-18 20:58:33,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 265 transitions, 697 flow [2022-11-18 20:58:33,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 265 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:58:33,194 INFO L231 Difference]: Finished difference. Result has 251 places, 243 transitions, 539 flow [2022-11-18 20:58:33,196 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=539, PETRI_PLACES=251, PETRI_TRANSITIONS=243} [2022-11-18 20:58:33,197 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-18 20:58:33,197 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 243 transitions, 539 flow [2022-11-18 20:58:33,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 241.71428571428572) internal successors, (1692), 7 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,199 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:33,199 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] [2022-11-18 20:58:33,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:58:33,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:33,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1295362066, now seen corresponding path program 1 times [2022-11-18 20:58:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:33,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720200993] [2022-11-18 20:58:33,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:33,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:33,399 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-18 20:58:33,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:33,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720200993] [2022-11-18 20:58:33,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720200993] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:33,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:33,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:58:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038605311] [2022-11-18 20:58:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:33,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:58:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:33,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:58:33,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:58:33,403 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 289 [2022-11-18 20:58:33,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 243 transitions, 539 flow. Second operand has 5 states, 5 states have (on average 255.4) internal successors, (1277), 5 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:33,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 289 [2022-11-18 20:58:33,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:33,825 INFO L130 PetriNetUnfolder]: 298/2171 cut-off events. [2022-11-18 20:58:33,825 INFO L131 PetriNetUnfolder]: For 156/202 co-relation queries the response was YES. [2022-11-18 20:58:33,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 2171 events. 298/2171 cut-off events. For 156/202 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 18106 event pairs, 162 based on Foata normal form. 4/1892 useless extension candidates. Maximal degree in co-relation 2793. Up to 381 conditions per place. [2022-11-18 20:58:33,856 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 38 selfloop transitions, 4 changer transitions 0/257 dead transitions. [2022-11-18 20:58:33,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 257 transitions, 659 flow [2022-11-18 20:58:33,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:58:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-18 20:58:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1303 transitions. [2022-11-18 20:58:33,861 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9017301038062284 [2022-11-18 20:58:33,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1303 transitions. [2022-11-18 20:58:33,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1303 transitions. [2022-11-18 20:58:33,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:33,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1303 transitions. [2022-11-18 20:58:33,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 260.6) internal successors, (1303), 5 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,871 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 289.0) internal successors, (1734), 6 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,871 INFO L175 Difference]: Start difference. First operand has 251 places, 243 transitions, 539 flow. Second operand 5 states and 1303 transitions. [2022-11-18 20:58:33,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 257 transitions, 659 flow [2022-11-18 20:58:33,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 649 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:58:33,879 INFO L231 Difference]: Finished difference. Result has 253 places, 244 transitions, 546 flow [2022-11-18 20:58:33,880 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=546, PETRI_PLACES=253, PETRI_TRANSITIONS=244} [2022-11-18 20:58:33,880 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -11 predicate places. [2022-11-18 20:58:33,880 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 244 transitions, 546 flow [2022-11-18 20:58:33,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 255.4) internal successors, (1277), 5 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:33,882 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:33,882 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] [2022-11-18 20:58:33,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:58:33,883 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:33,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:33,883 INFO L85 PathProgramCache]: Analyzing trace with hash 934390803, now seen corresponding path program 1 times [2022-11-18 20:58:33,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:33,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141834157] [2022-11-18 20:58:33,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:33,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:58:34,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:34,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141834157] [2022-11-18 20:58:34,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141834157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:34,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:34,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:58:34,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537078071] [2022-11-18 20:58:34,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:34,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:58:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:34,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:58:34,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:58:34,441 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-18 20:58:34,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 244 transitions, 546 flow. Second operand has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:34,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:34,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-18 20:58:34,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:37,525 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][186], [322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 131#thread2ENTRYtrue, 199#L84-4true, Black: 339#(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|)), 351#(<= (+ ~M~0 1) 0), Black: 341#(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|)), 356#true, Black: 343#(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))]) [2022-11-18 20:58:37,525 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-18 20:58:37,525 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-18 20:58:37,525 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-18 20:58:37,526 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-18 20:58:38,554 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][186], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 162#L65-3true, 314#(= |#race~M~0| 0), 131#thread2ENTRYtrue, 348#true, 199#L84-4true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 356#true]) [2022-11-18 20:58:38,554 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-18 20:58:38,555 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-18 20:58:38,555 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:58:38,555 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:58:39,254 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][186], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 314#(= |#race~M~0| 0), 162#L65-3true, 348#true, 181#L57-3true, 199#L84-4true, Black: 339#(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: 341#(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|)), 356#true, Black: 343#(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))]) [2022-11-18 20:58:39,254 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-18 20:58:39,254 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:58:39,254 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-18 20:58:39,254 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:58:39,321 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][172], [322#(= |#race~A~0| 0), 24#L65-6true, Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 348#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 178#L85-7true]) [2022-11-18 20:58:39,322 INFO L383 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-11-18 20:58:39,322 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-18 20:58:39,322 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-18 20:58:39,322 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-18 20:58:39,496 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][172], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), 24#L65-6true, 132#L86-2true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 314#(= |#race~M~0| 0), 348#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:58:39,496 INFO L383 tUnfolder$Statistics]: this new event has 173 ancestors and is cut-off event [2022-11-18 20:58:39,496 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-18 20:58:39,496 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-18 20:58:39,496 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-18 20:58:39,538 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][172], [24#L65-6true, 322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 191#L86-3true, 348#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:58:39,538 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-18 20:58:39,538 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-18 20:58:39,538 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:58:39,538 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-18 20:58:39,582 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][172], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 314#(= |#race~M~0| 0), 348#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 163#L86-4true]) [2022-11-18 20:58:39,582 INFO L383 tUnfolder$Statistics]: this new event has 175 ancestors and is cut-off event [2022-11-18 20:58:39,582 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-18 20:58:39,583 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-18 20:58:39,583 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-18 20:58:39,749 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][172], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 314#(= |#race~M~0| 0), 164#L86-5true, 348#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:58:39,749 INFO L383 tUnfolder$Statistics]: this new event has 176 ancestors and is cut-off event [2022-11-18 20:58:39,749 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-18 20:58:39,749 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-18 20:58:39,750 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-18 20:58:39,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][172], [24#L65-6true, 322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 348#true, 181#L57-3true, Black: 339#(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|)), 242#L86-6true, Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:58:39,807 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-18 20:58:39,807 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-18 20:58:39,807 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-18 20:58:39,807 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:58:39,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([714] L65-5-->L65-6: Formula: (= |v_#race_21| (store |v_#race_22| v_~A~0.base_16 (store (select |v_#race_22| v_~A~0.base_16) (+ v_~A~0.offset_16 (* v_thread3Thread1of1ForFork1_~i~2_9 4)) 0))) InVars {#race=|v_#race_22|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} OutVars{#race=|v_#race_21|, ~A~0.base=v_~A~0.base_16, thread3Thread1of1ForFork1_~i~2=v_thread3Thread1of1ForFork1_~i~2_9, ~A~0.offset=v_~A~0.offset_16} AuxVars[] AssignedVars[#race][172], [322#(= |#race~A~0| 0), 24#L65-6true, Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 32#ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACEtrue, 348#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:58:39,808 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-18 20:58:39,808 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-18 20:58:39,808 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-18 20:58:39,809 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-18 20:58:40,059 INFO L130 PetriNetUnfolder]: 12121/31184 cut-off events. [2022-11-18 20:58:40,059 INFO L131 PetriNetUnfolder]: For 193/447 co-relation queries the response was YES. [2022-11-18 20:58:40,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49362 conditions, 31184 events. 12121/31184 cut-off events. For 193/447 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 345955 event pairs, 3745 based on Foata normal form. 72/26945 useless extension candidates. Maximal degree in co-relation 49314. Up to 7209 conditions per place. [2022-11-18 20:58:40,401 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 118 selfloop transitions, 4 changer transitions 0/315 dead transitions. [2022-11-18 20:58:40,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 315 transitions, 932 flow [2022-11-18 20:58:40,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:58:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:58:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1479 transitions. [2022-11-18 20:58:40,408 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2022-11-18 20:58:40,408 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1479 transitions. [2022-11-18 20:58:40,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1479 transitions. [2022-11-18 20:58:40,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:40,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1479 transitions. [2022-11-18 20:58:40,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 246.5) internal successors, (1479), 6 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:40,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:40,421 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:40,422 INFO L175 Difference]: Start difference. First operand has 253 places, 244 transitions, 546 flow. Second operand 6 states and 1479 transitions. [2022-11-18 20:58:40,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 315 transitions, 932 flow [2022-11-18 20:58:40,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 315 transitions, 927 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:58:40,442 INFO L231 Difference]: Finished difference. Result has 255 places, 243 transitions, 547 flow [2022-11-18 20:58:40,442 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=547, PETRI_PLACES=255, PETRI_TRANSITIONS=243} [2022-11-18 20:58:40,444 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -9 predicate places. [2022-11-18 20:58:40,445 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 243 transitions, 547 flow [2022-11-18 20:58:40,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:40,446 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:40,446 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] [2022-11-18 20:58:40,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:58:40,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash -245350886, now seen corresponding path program 1 times [2022-11-18 20:58:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:40,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598801135] [2022-11-18 20:58:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:40,524 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-18 20:58:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:40,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598801135] [2022-11-18 20:58:40,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598801135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:40,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:40,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:58:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387741577] [2022-11-18 20:58:40,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:40,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:58:40,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:40,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:58:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:58:40,529 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-18 20:58:40,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 243 transitions, 547 flow. Second operand has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:40,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:40,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-18 20:58:40,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:40,981 INFO L130 PetriNetUnfolder]: 158/1520 cut-off events. [2022-11-18 20:58:40,982 INFO L131 PetriNetUnfolder]: For 135/150 co-relation queries the response was YES. [2022-11-18 20:58:40,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 1520 events. 158/1520 cut-off events. For 135/150 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 10927 event pairs, 29 based on Foata normal form. 10/1388 useless extension candidates. Maximal degree in co-relation 1889. Up to 133 conditions per place. [2022-11-18 20:58:40,994 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 10 selfloop transitions, 2 changer transitions 7/243 dead transitions. [2022-11-18 20:58:40,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 243 transitions, 577 flow [2022-11-18 20:58:40,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:58:40,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:58:40,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-11-18 20:58:40,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9354094579008074 [2022-11-18 20:58:40,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-11-18 20:58:40,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-11-18 20:58:40,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:40,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-11-18 20:58:41,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.3333333333333) internal successors, (811), 3 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:41,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:41,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:41,003 INFO L175 Difference]: Start difference. First operand has 255 places, 243 transitions, 547 flow. Second operand 3 states and 811 transitions. [2022-11-18 20:58:41,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 243 transitions, 577 flow [2022-11-18 20:58:41,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 243 transitions, 570 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:58:41,010 INFO L231 Difference]: Finished difference. Result has 251 places, 234 transitions, 525 flow [2022-11-18 20:58:41,010 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=251, PETRI_TRANSITIONS=234} [2022-11-18 20:58:41,012 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-18 20:58:41,012 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 234 transitions, 525 flow [2022-11-18 20:58:41,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.6666666666667) internal successors, (800), 3 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:41,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:41,013 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] [2022-11-18 20:58:41,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:58:41,013 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824685, now seen corresponding path program 1 times [2022-11-18 20:58:41,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:41,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451611036] [2022-11-18 20:58:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:41,474 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-18 20:58:41,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:41,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451611036] [2022-11-18 20:58:41,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451611036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:41,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:41,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:58:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7088339] [2022-11-18 20:58:41,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:41,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:58:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:41,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:58:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:58:41,479 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-18 20:58:41,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 234 transitions, 525 flow. Second operand has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:41,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:41,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-18 20:58:41,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:47,239 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 162#L65-3true, 131#thread2ENTRYtrue, 365#(= |#race~sum3~0| 0), 199#L84-4true, Black: 339#(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|)), 351#(<= (+ ~M~0 1) 0), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 367#true]) [2022-11-18 20:58:47,239 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-18 20:58:47,239 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-18 20:58:47,240 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-18 20:58:47,240 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-18 20:58:48,293 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 131#thread2ENTRYtrue, 365#(= |#race~sum3~0| 0), 199#L84-4true, Black: 339#(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: 341#(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|)), 367#true, Black: 343#(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))]) [2022-11-18 20:58:48,293 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-18 20:58:48,293 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:58:48,293 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:58:48,294 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-18 20:58:49,588 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 365#(= |#race~sum3~0| 0), 181#L57-3true, 199#L84-4true, Black: 339#(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: 341#(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|)), 367#true, Black: 343#(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))]) [2022-11-18 20:58:49,588 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-18 20:58:49,588 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-18 20:58:49,588 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:58:49,589 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:58:49,967 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 365#(= |#race~sum3~0| 0), 181#L57-3true, Black: 339#(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: 341#(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|)), 367#true, Black: 343#(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)), 358#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0)]) [2022-11-18 20:58:49,967 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-18 20:58:49,967 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:58:49,967 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-18 20:58:49,968 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-18 20:58:50,059 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 37#L49-3true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 162#L65-3true, 359#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 365#(= |#race~sum3~0| 0), 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 367#true]) [2022-11-18 20:58:50,060 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-18 20:58:50,060 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-18 20:58:50,060 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-18 20:58:50,060 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-18 20:58:50,111 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 365#(= |#race~sum3~0| 0), 181#L57-3true, Black: 339#(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: 341#(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|)), 360#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 367#true, Black: 343#(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))]) [2022-11-18 20:58:50,111 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-18 20:58:50,111 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-18 20:58:50,112 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-18 20:58:50,112 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-18 20:58:50,147 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 365#(= |#race~sum3~0| 0), 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 367#true, 126#L85-5true]) [2022-11-18 20:58:50,148 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-11-18 20:58:50,148 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-18 20:58:50,148 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-18 20:58:50,148 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-18 20:58:50,175 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][179], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), 9#L85-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 365#(= |#race~sum3~0| 0), 181#L57-3true, Black: 339#(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: 341#(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|)), 367#true, Black: 343#(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))]) [2022-11-18 20:58:50,176 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-18 20:58:50,176 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 20:58:50,176 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 20:58:50,176 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 20:58:50,337 INFO L130 PetriNetUnfolder]: 23566/58783 cut-off events. [2022-11-18 20:58:50,338 INFO L131 PetriNetUnfolder]: For 3434/3434 co-relation queries the response was YES. [2022-11-18 20:58:50,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98759 conditions, 58783 events. 23566/58783 cut-off events. For 3434/3434 co-relation queries the response was YES. Maximal size of possible extension queue 1766. Compared 716086 event pairs, 12497 based on Foata normal form. 0/53498 useless extension candidates. Maximal degree in co-relation 98712. Up to 19940 conditions per place. [2022-11-18 20:58:50,937 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 158 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2022-11-18 20:58:50,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 341 transitions, 1077 flow [2022-11-18 20:58:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:58:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:58:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1495 transitions. [2022-11-18 20:58:50,946 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8621683967704729 [2022-11-18 20:58:50,946 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1495 transitions. [2022-11-18 20:58:50,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1495 transitions. [2022-11-18 20:58:50,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:50,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1495 transitions. [2022-11-18 20:58:50,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:50,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:50,962 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:50,962 INFO L175 Difference]: Start difference. First operand has 251 places, 234 transitions, 525 flow. Second operand 6 states and 1495 transitions. [2022-11-18 20:58:50,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 341 transitions, 1077 flow [2022-11-18 20:58:51,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 341 transitions, 1073 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:58:51,046 INFO L231 Difference]: Finished difference. Result has 246 places, 233 transitions, 529 flow [2022-11-18 20:58:51,047 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=529, PETRI_PLACES=246, PETRI_TRANSITIONS=233} [2022-11-18 20:58:51,048 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-11-18 20:58:51,048 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 233 transitions, 529 flow [2022-11-18 20:58:51,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:51,049 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:51,049 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] [2022-11-18 20:58:51,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:58:51,050 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:51,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:51,050 INFO L85 PathProgramCache]: Analyzing trace with hash -341970496, now seen corresponding path program 1 times [2022-11-18 20:58:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:51,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976992463] [2022-11-18 20:58:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:51,728 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-18 20:58:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:51,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976992463] [2022-11-18 20:58:51,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976992463] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:51,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:51,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:58:51,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755260245] [2022-11-18 20:58:51,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:51,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:58:51,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:58:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:58:51,733 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-18 20:58:51,735 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 233 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:51,735 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:51,735 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-18 20:58:51,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:58:55,276 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 314#(= |#race~M~0| 0), 181#L57-3true, Black: 339#(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: 341#(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|)), 367#true, Black: 343#(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)), 374#true, 204#L83-4true]) [2022-11-18 20:58:55,277 INFO L383 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2022-11-18 20:58:55,277 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-18 20:58:55,277 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-18 20:58:55,277 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-18 20:58:58,165 INFO L130 PetriNetUnfolder]: 18385/43344 cut-off events. [2022-11-18 20:58:58,166 INFO L131 PetriNetUnfolder]: For 3508/3622 co-relation queries the response was YES. [2022-11-18 20:58:58,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75899 conditions, 43344 events. 18385/43344 cut-off events. For 3508/3622 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 487111 event pairs, 8670 based on Foata normal form. 0/39733 useless extension candidates. Maximal degree in co-relation 75852. Up to 13844 conditions per place. [2022-11-18 20:58:58,537 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 176 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2022-11-18 20:58:58,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 360 transitions, 1189 flow [2022-11-18 20:58:58,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:58:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:58:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1514 transitions. [2022-11-18 20:58:58,542 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8731257208765859 [2022-11-18 20:58:58,542 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1514 transitions. [2022-11-18 20:58:58,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1514 transitions. [2022-11-18 20:58:58,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:58:58,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1514 transitions. [2022-11-18 20:58:58,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 252.33333333333334) internal successors, (1514), 6 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:58,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:58,553 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:58,553 INFO L175 Difference]: Start difference. First operand has 246 places, 233 transitions, 529 flow. Second operand 6 states and 1514 transitions. [2022-11-18 20:58:58,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 360 transitions, 1189 flow [2022-11-18 20:58:58,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 360 transitions, 1147 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:58:58,579 INFO L231 Difference]: Finished difference. Result has 245 places, 232 transitions, 527 flow [2022-11-18 20:58:58,579 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=527, PETRI_PLACES=245, PETRI_TRANSITIONS=232} [2022-11-18 20:58:58,580 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -19 predicate places. [2022-11-18 20:58:58,580 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 232 transitions, 527 flow [2022-11-18 20:58:58,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.16666666666666) internal successors, (1345), 6 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:58,581 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:58:58,581 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] [2022-11-18 20:58:58,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:58:58,582 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:58:58,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:58:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash -658822991, now seen corresponding path program 1 times [2022-11-18 20:58:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:58:58,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529061151] [2022-11-18 20:58:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:58:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:58:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:58:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:58:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:58:59,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529061151] [2022-11-18 20:58:59,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529061151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:58:59,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:58:59,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:58:59,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657783555] [2022-11-18 20:58:59,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:58:59,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:58:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:58:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:58:59,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:58:59,226 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-18 20:58:59,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 232 transitions, 527 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:58:59,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:58:59,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-18 20:58:59,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:05,392 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 381#true, 181#L57-3true, 199#L84-4true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 374#true]) [2022-11-18 20:59:05,392 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-18 20:59:05,392 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:59:05,392 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-18 20:59:05,392 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-11-18 20:59:05,436 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 37#L49-3true, Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 381#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 374#true, 358#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0)]) [2022-11-18 20:59:05,436 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-18 20:59:05,436 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-11-18 20:59:05,436 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-18 20:59:05,436 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-18 20:59:05,451 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 359#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 381#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 374#true]) [2022-11-18 20:59:05,451 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-18 20:59:05,451 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-18 20:59:05,451 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-18 20:59:05,451 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-11-18 20:59:05,460 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 162#L65-3true, 381#true, 181#L57-3true, Black: 339#(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|)), 360#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 374#true]) [2022-11-18 20:59:05,460 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-18 20:59:05,460 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-18 20:59:05,461 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-18 20:59:05,461 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-18 20:59:05,467 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 314#(= |#race~M~0| 0), 162#L65-3true, 381#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 126#L85-5true, 374#true]) [2022-11-18 20:59:05,467 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-11-18 20:59:05,467 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-18 20:59:05,467 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-18 20:59:05,467 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-18 20:59:05,475 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([675] L57-2-->L57-3: Formula: (= |v_#race~A~0_4| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_4|} AuxVars[] AssignedVars[#race~A~0][181], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), 9#L85-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 361#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 381#true, 181#L57-3true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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)), 374#true]) [2022-11-18 20:59:05,476 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-18 20:59:05,476 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 20:59:05,476 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-18 20:59:05,476 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-18 20:59:05,488 INFO L130 PetriNetUnfolder]: 17672/44290 cut-off events. [2022-11-18 20:59:05,488 INFO L131 PetriNetUnfolder]: For 4582/5005 co-relation queries the response was YES. [2022-11-18 20:59:05,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77669 conditions, 44290 events. 17672/44290 cut-off events. For 4582/5005 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 504807 event pairs, 10154 based on Foata normal form. 0/41478 useless extension candidates. Maximal degree in co-relation 77622. Up to 15756 conditions per place. [2022-11-18 20:59:06,168 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 124 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2022-11-18 20:59:06,168 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 307 transitions, 979 flow [2022-11-18 20:59:06,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:59:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:59:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1461 transitions. [2022-11-18 20:59:06,174 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.842560553633218 [2022-11-18 20:59:06,174 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1461 transitions. [2022-11-18 20:59:06,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1461 transitions. [2022-11-18 20:59:06,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:06,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1461 transitions. [2022-11-18 20:59:06,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.5) internal successors, (1461), 6 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,187 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,187 INFO L175 Difference]: Start difference. First operand has 245 places, 232 transitions, 527 flow. Second operand 6 states and 1461 transitions. [2022-11-18 20:59:06,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 307 transitions, 979 flow [2022-11-18 20:59:06,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 307 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:59:06,216 INFO L231 Difference]: Finished difference. Result has 244 places, 231 transitions, 525 flow [2022-11-18 20:59:06,217 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=525, PETRI_PLACES=244, PETRI_TRANSITIONS=231} [2022-11-18 20:59:06,217 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -20 predicate places. [2022-11-18 20:59:06,218 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 231 transitions, 525 flow [2022-11-18 20:59:06,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:06,219 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-18 20:59:06,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:59:06,219 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:59:06,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:06,220 INFO L85 PathProgramCache]: Analyzing trace with hash -2088407146, now seen corresponding path program 1 times [2022-11-18 20:59:06,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:06,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602578292] [2022-11-18 20:59:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:06,286 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-18 20:59:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:06,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602578292] [2022-11-18 20:59:06,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602578292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:06,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:06,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:59:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268560056] [2022-11-18 20:59:06,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:06,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:59:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:59:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:59:06,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-18 20:59:06,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 231 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:06,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-18 20:59:06,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:06,537 INFO L130 PetriNetUnfolder]: 95/1172 cut-off events. [2022-11-18 20:59:06,538 INFO L131 PetriNetUnfolder]: For 57/71 co-relation queries the response was YES. [2022-11-18 20:59:06,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1499 conditions, 1172 events. 95/1172 cut-off events. For 57/71 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7273 event pairs, 28 based on Foata normal form. 0/1099 useless extension candidates. Maximal degree in co-relation 1453. Up to 111 conditions per place. [2022-11-18 20:59:06,546 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2022-11-18 20:59:06,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 232 transitions, 555 flow [2022-11-18 20:59:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:59:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:59:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-18 20:59:06,550 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-18 20:59:06,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-18 20:59:06,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-18 20:59:06,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:06,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-18 20:59:06,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,558 INFO L175 Difference]: Start difference. First operand has 244 places, 231 transitions, 525 flow. Second operand 3 states and 803 transitions. [2022-11-18 20:59:06,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 232 transitions, 555 flow [2022-11-18 20:59:06,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 232 transitions, 545 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-18 20:59:06,565 INFO L231 Difference]: Finished difference. Result has 240 places, 230 transitions, 517 flow [2022-11-18 20:59:06,566 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=517, PETRI_PLACES=240, PETRI_TRANSITIONS=230} [2022-11-18 20:59:06,567 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-18 20:59:06,567 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 230 transitions, 517 flow [2022-11-18 20:59:06,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,568 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:06,568 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:59:06,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:59:06,568 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:59:06,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:06,569 INFO L85 PathProgramCache]: Analyzing trace with hash 623862083, now seen corresponding path program 1 times [2022-11-18 20:59:06,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:06,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60972100] [2022-11-18 20:59:06,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:06,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:06,635 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-18 20:59:06,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:06,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60972100] [2022-11-18 20:59:06,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60972100] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:06,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:06,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:59:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395521581] [2022-11-18 20:59:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:06,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:59:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:06,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:59:06,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:59:06,640 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-18 20:59:06,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 230 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:06,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-18 20:59:06,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:06,940 INFO L130 PetriNetUnfolder]: 170/1270 cut-off events. [2022-11-18 20:59:06,941 INFO L131 PetriNetUnfolder]: For 139/152 co-relation queries the response was YES. [2022-11-18 20:59:06,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 1270 events. 170/1270 cut-off events. For 139/152 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8717 event pairs, 57 based on Foata normal form. 0/1182 useless extension candidates. Maximal degree in co-relation 1643. Up to 212 conditions per place. [2022-11-18 20:59:06,950 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2022-11-18 20:59:06,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 231 transitions, 547 flow [2022-11-18 20:59:06,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:59:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:59:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-18 20:59:06,953 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-18 20:59:06,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-18 20:59:06,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-18 20:59:06,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:06,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-18 20:59:06,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,961 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,961 INFO L175 Difference]: Start difference. First operand has 240 places, 230 transitions, 517 flow. Second operand 3 states and 803 transitions. [2022-11-18 20:59:06,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 231 transitions, 547 flow [2022-11-18 20:59:06,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 231 transitions, 543 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:59:06,968 INFO L231 Difference]: Finished difference. Result has 239 places, 229 transitions, 515 flow [2022-11-18 20:59:06,969 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=237, 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=515, PETRI_PLACES=239, PETRI_TRANSITIONS=229} [2022-11-18 20:59:06,970 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -25 predicate places. [2022-11-18 20:59:06,970 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 229 transitions, 515 flow [2022-11-18 20:59:06,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:06,971 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:06,971 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:59:06,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:59:06,971 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:59:06,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:06,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1105608436, now seen corresponding path program 1 times [2022-11-18 20:59:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:06,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031742358] [2022-11-18 20:59:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:59:07,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:07,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031742358] [2022-11-18 20:59:07,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031742358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:07,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:07,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:59:07,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636644662] [2022-11-18 20:59:07,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:07,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:59:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:07,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:59:07,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:59:07,048 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-18 20:59:07,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 229 transitions, 515 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:07,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:07,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-18 20:59:07,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:07,319 INFO L130 PetriNetUnfolder]: 77/1083 cut-off events. [2022-11-18 20:59:07,320 INFO L131 PetriNetUnfolder]: For 26/42 co-relation queries the response was YES. [2022-11-18 20:59:07,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 1083 events. 77/1083 cut-off events. For 26/42 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6467 event pairs, 29 based on Foata normal form. 1/1045 useless extension candidates. Maximal degree in co-relation 1368. Up to 119 conditions per place. [2022-11-18 20:59:07,333 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-18 20:59:07,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 230 transitions, 545 flow [2022-11-18 20:59:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:59:07,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:59:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-18 20:59:07,337 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-18 20:59:07,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-18 20:59:07,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-18 20:59:07,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:07,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-18 20:59:07,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.6666666666667) internal successors, (803), 3 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:07,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:07,344 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:07,344 INFO L175 Difference]: Start difference. First operand has 239 places, 229 transitions, 515 flow. Second operand 3 states and 803 transitions. [2022-11-18 20:59:07,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 230 transitions, 545 flow [2022-11-18 20:59:07,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 230 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:59:07,351 INFO L231 Difference]: Finished difference. Result has 238 places, 228 transitions, 513 flow [2022-11-18 20:59:07,352 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=513, PETRI_PLACES=238, PETRI_TRANSITIONS=228} [2022-11-18 20:59:07,353 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -26 predicate places. [2022-11-18 20:59:07,353 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 228 transitions, 513 flow [2022-11-18 20:59:07,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:07,354 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:07,354 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] [2022-11-18 20:59:07,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:59:07,354 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:59:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1929960959, now seen corresponding path program 1 times [2022-11-18 20:59:07,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:07,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367401329] [2022-11-18 20:59:07,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:07,882 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-18 20:59:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:07,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367401329] [2022-11-18 20:59:07,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367401329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:07,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:07,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:59:07,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844204399] [2022-11-18 20:59:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:07,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:59:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:07,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:59:07,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:59:07,887 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-18 20:59:07,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 228 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:07,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:07,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-18 20:59:07,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:10,177 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 131#thread2ENTRYtrue, 396#true, 400#true, 199#L84-4true, Black: 339#(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|)), 351#(<= (+ ~M~0 1) 0), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:59:10,179 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-18 20:59:10,179 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-18 20:59:10,179 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-18 20:59:10,179 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-18 20:59:10,548 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 37#L49-3true, 314#(= |#race~M~0| 0), 162#L65-3true, 131#thread2ENTRYtrue, 400#true, 396#true, 199#L84-4true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:59:10,548 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-18 20:59:10,548 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:59:10,548 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-18 20:59:10,548 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:59:10,987 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [322#(= |#race~A~0| 0), Black: 351#(<= (+ ~M~0 1) 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 396#true, 400#true, 181#L57-3true, 199#L84-4true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:59:10,987 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-18 20:59:10,987 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:59:10,988 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:59:10,988 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-18 20:59:11,754 INFO L130 PetriNetUnfolder]: 7151/24530 cut-off events. [2022-11-18 20:59:11,754 INFO L131 PetriNetUnfolder]: For 153/453 co-relation queries the response was YES. [2022-11-18 20:59:11,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37012 conditions, 24530 events. 7151/24530 cut-off events. For 153/453 co-relation queries the response was YES. Maximal size of possible extension queue 768. Compared 301404 event pairs, 5038 based on Foata normal form. 16/23738 useless extension candidates. Maximal degree in co-relation 36964. Up to 8023 conditions per place. [2022-11-18 20:59:11,929 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 81 selfloop transitions, 4 changer transitions 0/267 dead transitions. [2022-11-18 20:59:11,929 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 267 transitions, 761 flow [2022-11-18 20:59:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:59:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:59:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1442 transitions. [2022-11-18 20:59:11,934 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.831603229527105 [2022-11-18 20:59:11,934 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1442 transitions. [2022-11-18 20:59:11,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1442 transitions. [2022-11-18 20:59:11,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:11,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1442 transitions. [2022-11-18 20:59:11,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 240.33333333333334) internal successors, (1442), 6 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:11,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:11,944 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:11,944 INFO L175 Difference]: Start difference. First operand has 238 places, 228 transitions, 513 flow. Second operand 6 states and 1442 transitions. [2022-11-18 20:59:11,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 267 transitions, 761 flow [2022-11-18 20:59:12,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 267 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:59:12,027 INFO L231 Difference]: Finished difference. Result has 240 places, 227 transitions, 515 flow [2022-11-18 20:59:12,027 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=515, PETRI_PLACES=240, PETRI_TRANSITIONS=227} [2022-11-18 20:59:12,028 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-18 20:59:12,028 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 227 transitions, 515 flow [2022-11-18 20:59:12,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:12,029 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:59:12,029 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] [2022-11-18 20:59:12,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 20:59:12,030 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-18 20:59:12,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:59:12,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1060477721, now seen corresponding path program 1 times [2022-11-18 20:59:12,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:59:12,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827372287] [2022-11-18 20:59:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:59:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:59:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:59:12,515 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-18 20:59:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:59:12,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827372287] [2022-11-18 20:59:12,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827372287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:59:12,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:59:12,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:59:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971524626] [2022-11-18 20:59:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:59:12,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:59:12,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:59:12,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:59:12,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:59:12,520 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-18 20:59:12,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 227 transitions, 515 flow. Second operand has 6 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-18 20:59:12,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:59:12,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-18 20:59:12,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:59:14,675 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 407#true, Black: 320#true, 37#L49-3true, 314#(= |#race~M~0| 0), 162#L65-3true, 131#thread2ENTRYtrue, 400#true, 199#L84-4true, Black: 339#(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|)), 351#(<= (+ ~M~0 1) 0), Black: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:59:14,675 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-18 20:59:14,675 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-18 20:59:14,675 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-18 20:59:14,675 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-18 20:59:15,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 407#true, 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 131#thread2ENTRYtrue, 400#true, 199#L84-4true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:59:15,422 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-18 20:59:15,422 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:59:15,422 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-18 20:59:15,422 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-18 20:59:15,910 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([710] L65-2-->L65-3: Formula: (= |v_#race~A~0_7| 0) InVars {} OutVars{#race~A~0=|v_#race~A~0_7|} AuxVars[] AssignedVars[#race~A~0][175], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 407#true, 37#L49-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 162#L65-3true, 400#true, 181#L57-3true, 199#L84-4true, Black: 339#(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: 341#(and (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_~size#1|) (= |ULTIMATE.start_create_fresh_uint_array_~i~3#1| 0) (<= ~N~0 0) (<= ~N~0 |ULTIMATE.start_create_fresh_uint_array_#in~size#1|)), Black: 343#(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))]) [2022-11-18 20:59:15,910 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-18 20:59:15,910 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:59:15,911 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-18 20:59:15,911 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-18 20:59:16,377 INFO L130 PetriNetUnfolder]: 7065/24550 cut-off events. [2022-11-18 20:59:16,377 INFO L131 PetriNetUnfolder]: For 338/586 co-relation queries the response was YES. [2022-11-18 20:59:16,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36624 conditions, 24550 events. 7065/24550 cut-off events. For 338/586 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 302976 event pairs, 5723 based on Foata normal form. 0/23733 useless extension candidates. Maximal degree in co-relation 36576. Up to 9332 conditions per place. [2022-11-18 20:59:16,516 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 0 selfloop transitions, 0 changer transitions 246/246 dead transitions. [2022-11-18 20:59:16,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 246 transitions, 681 flow [2022-11-18 20:59:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:59:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-18 20:59:16,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1421 transitions. [2022-11-18 20:59:16,521 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8194925028835064 [2022-11-18 20:59:16,522 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1421 transitions. [2022-11-18 20:59:16,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1421 transitions. [2022-11-18 20:59:16,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:59:16,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1421 transitions. [2022-11-18 20:59:16,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:16,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:16,530 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 289.0) internal successors, (2023), 7 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:59:16,530 INFO L175 Difference]: Start difference. First operand has 240 places, 227 transitions, 515 flow. Second operand 6 states and 1421 transitions. [2022-11-18 20:59:16,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 246 transitions, 681 flow [2022-11-18 20:59:16,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 246 transitions, 674 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 20:59:16,548 INFO L231 Difference]: Finished difference. Result has 240 places, 0 transitions, 0 flow [2022-11-18 20:59:16,549 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=240, PETRI_TRANSITIONS=0} [2022-11-18 20:59:16,549 INFO L288 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-18 20:59:16,550 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 0 transitions, 0 flow [2022-11-18 20:59:16,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-18 20:59:16,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 49 remaining) [2022-11-18 20:59:16,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2022-11-18 20:59:16,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2022-11-18 20:59:16,559 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2022-11-18 20:59:16,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2022-11-18 20:59:16,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2022-11-18 20:59:16,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2022-11-18 20:59:16,561 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2022-11-18 20:59:16,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2022-11-18 20:59:16,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2022-11-18 20:59:16,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2022-11-18 20:59:16,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2022-11-18 20:59:16,562 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2022-11-18 20:59:16,563 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2022-11-18 20:59:16,563 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2022-11-18 20:59:16,563 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2022-11-18 20:59:16,563 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2022-11-18 20:59:16,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2022-11-18 20:59:16,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2022-11-18 20:59:16,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2022-11-18 20:59:16,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2022-11-18 20:59:16,564 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2022-11-18 20:59:16,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2022-11-18 20:59:16,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2022-11-18 20:59:16,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2022-11-18 20:59:16,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2022-11-18 20:59:16,565 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2022-11-18 20:59:16,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2022-11-18 20:59:16,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2022-11-18 20:59:16,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2022-11-18 20:59:16,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 49 remaining) [2022-11-18 20:59:16,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 49 remaining) [2022-11-18 20:59:16,567 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 49 remaining) [2022-11-18 20:59:16,567 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2022-11-18 20:59:16,567 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2022-11-18 20:59:16,567 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2022-11-18 20:59:16,567 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2022-11-18 20:59:16,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2022-11-18 20:59:16,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2022-11-18 20:59:16,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2022-11-18 20:59:16,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2022-11-18 20:59:16,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2022-11-18 20:59:16,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2022-11-18 20:59:16,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2022-11-18 20:59:16,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2022-11-18 20:59:16,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2022-11-18 20:59:16,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2022-11-18 20:59:16,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2022-11-18 20:59:16,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2022-11-18 20:59:16,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:59:16,571 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:59:16,579 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 20:59:16,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 20:59:16,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:59:16 BasicIcfg [2022-11-18 20:59:16,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 20:59:16,586 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 20:59:16,588 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 20:59:16,588 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 20:59:16,589 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:58:23" (3/4) ... [2022-11-18 20:59:16,592 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-18 20:59:16,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-18 20:59:16,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-18 20:59:16,599 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-18 20:59:16,609 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-11-18 20:59:16,609 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-18 20:59:16,610 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-18 20:59:16,610 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-18 20:59:16,654 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 20:59:16,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 20:59:16,655 INFO L158 Benchmark]: Toolchain (without parser) took 54936.35ms. Allocated memory was 125.8MB in the beginning and 13.3GB in the end (delta: 13.2GB). Free memory was 94.5MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2022-11-18 20:59:16,655 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 92.3MB. Free memory was 51.1MB in the beginning and 51.1MB in the end (delta: 55.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 20:59:16,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.02ms. Allocated memory is still 125.8MB. Free memory was 94.2MB in the beginning and 99.4MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-18 20:59:16,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.77ms. Allocated memory is still 125.8MB. Free memory was 99.4MB in the beginning and 96.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:59:16,657 INFO L158 Benchmark]: Boogie Preprocessor took 45.63ms. Allocated memory is still 125.8MB. Free memory was 96.9MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 20:59:16,657 INFO L158 Benchmark]: RCFGBuilder took 908.87ms. Allocated memory is still 125.8MB. Free memory was 94.8MB in the beginning and 70.5MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-18 20:59:16,657 INFO L158 Benchmark]: TraceAbstraction took 53492.50ms. Allocated memory was 125.8MB in the beginning and 13.3GB in the end (delta: 13.2GB). Free memory was 70.1MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2022-11-18 20:59:16,658 INFO L158 Benchmark]: Witness Printer took 68.06ms. Allocated memory is still 13.3GB. Free memory was 10.5GB in the beginning and 10.5GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 20:59:16,660 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 92.3MB. Free memory was 51.1MB in the beginning and 51.1MB in the end (delta: 55.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.02ms. Allocated memory is still 125.8MB. Free memory was 94.2MB in the beginning and 99.4MB in the end (delta: -5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.77ms. Allocated memory is still 125.8MB. Free memory was 99.4MB in the beginning and 96.9MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.63ms. Allocated memory is still 125.8MB. Free memory was 96.9MB in the beginning and 94.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 908.87ms. Allocated memory is still 125.8MB. Free memory was 94.8MB in the beginning and 70.5MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53492.50ms. Allocated memory was 125.8MB in the beginning and 13.3GB in the end (delta: 13.2GB). Free memory was 70.1MB in the beginning and 10.5GB in the end (delta: -10.4GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 68.06ms. Allocated memory is still 13.3GB. Free memory was 10.5GB in the beginning and 10.5GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 376 locations, 49 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 46.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 356 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2080 IncrementalHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 356 mSolverCounterUnsat, 396 mSDtfsCounter, 2080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1900 NumberOfCodeBlocks, 1900 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 2820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-18 20:59:16,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34ae4eb-4f71-4c7b-af1f-3211bc48c32e/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE