./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/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_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-5e519f3 [2022-11-02 20:30:07,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:30:07,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:30:07,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:30:07,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:30:07,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:30:07,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:30:07,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:30:07,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:30:07,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:30:07,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:30:07,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:30:07,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:30:07,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:30:07,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:30:07,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:30:07,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:30:07,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:30:07,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:30:07,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:30:07,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:30:07,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:30:07,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:30:07,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:30:07,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:30:07,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:30:07,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:30:07,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:30:07,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:30:07,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:30:07,431 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:30:07,432 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:30:07,433 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:30:07,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:30:07,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:30:07,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:30:07,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:30:07,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:30:07,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:30:07,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:30:07,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:30:07,443 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:30:07,491 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:30:07,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:30:07,492 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:30:07,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:30:07,494 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:30:07,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:30:07,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:30:07,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:30:07,496 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:30:07,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:30:07,497 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:30:07,498 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:30:07,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:30:07,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:30:07,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:30:07,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:30:07,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:30:07,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:30:07,500 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:30:07,501 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:30:07,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:30:07,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:30:07,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:30:07,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:30:07,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:30:07,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:30:07,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:30:07,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:30:07,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:30:07,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:30:07,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:30:07,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:30:07,505 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:30:07,506 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:30:07,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:30:07,506 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_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0307f20ae0363cc6fed70ae0937c5000167639ab486b68a523e3313ccdd28e28 [2022-11-02 20:30:07,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:30:07,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:30:07,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:30:07,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:30:07,913 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:30:07,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-11-02 20:30:08,002 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/data/549e07ff4/1dc8058dec6a49759ffa5302f6e4ff65/FLAG33b9e977e [2022-11-02 20:30:08,515 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:30:08,516 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2022-11-02 20:30:08,526 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/data/549e07ff4/1dc8058dec6a49759ffa5302f6e4ff65/FLAG33b9e977e [2022-11-02 20:30:08,881 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/data/549e07ff4/1dc8058dec6a49759ffa5302f6e4ff65 [2022-11-02 20:30:08,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:30:08,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:30:08,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:08,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:30:08,899 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:30:08,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:08" (1/1) ... [2022-11-02 20:30:08,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ecee0eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:08, skipping insertion in model container [2022-11-02 20:30:08,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:30:08" (1/1) ... [2022-11-02 20:30:08,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:30:08,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:30:09,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-11-02 20:30:09,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:09,200 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:30:09,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c[2396,2409] [2022-11-02 20:30:09,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:30:09,255 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:30:09,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09 WrapperNode [2022-11-02 20:30:09,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:30:09,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:09,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:30:09,257 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:30:09,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,320 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 154 [2022-11-02 20:30:09,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:30:09,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:30:09,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:30:09,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:30:09,331 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,364 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:30:09,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:30:09,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:30:09,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:30:09,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (1/1) ... [2022-11-02 20:30:09,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:30:09,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:30:09,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:30:09,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:30:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:30:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:30:09,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:30:09,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:30:09,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:30:09,493 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:30:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:30:09,494 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:30:09,494 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:30:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:30:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:30:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:30:09,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:30:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:30:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:30:09,498 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:30:09,629 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:30:09,632 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:30:10,348 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:30:10,364 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:30:10,364 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:30:10,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:10 BoogieIcfgContainer [2022-11-02 20:30:10,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:30:10,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:30:10,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:30:10,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:30:10,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:30:08" (1/3) ... [2022-11-02 20:30:10,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306415bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:30:10, skipping insertion in model container [2022-11-02 20:30:10,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:30:09" (2/3) ... [2022-11-02 20:30:10,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306415bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:30:10, skipping insertion in model container [2022-11-02 20:30:10,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:10" (3/3) ... [2022-11-02 20:30:10,381 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2022-11-02 20:30:10,393 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:30:10,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:30:10,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-02 20:30:10,407 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:30:10,536 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 20:30:10,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 289 transitions, 602 flow [2022-11-02 20:30:10,762 INFO L130 PetriNetUnfolder]: 13/286 cut-off events. [2022-11-02 20:30:10,763 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 20:30:10,771 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 433 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-02 20:30:10,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 289 transitions, 602 flow [2022-11-02 20:30:10,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 264 places, 266 transitions, 550 flow [2022-11-02 20:30:10,852 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:30:10,864 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;@746a4272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:30:10,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2022-11-02 20:30:10,879 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-11-02 20:30:10,880 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:30:10,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:10,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:10,882 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-02 20:30:10,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash 444636234, now seen corresponding path program 1 times [2022-11-02 20:30:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:10,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440692486] [2022-11-02 20:30:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:11,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440692486] [2022-11-02 20:30:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440692486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:11,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:11,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:11,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964991716] [2022-11-02 20:30:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:11,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:11,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:11,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:11,221 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 289 [2022-11-02 20:30:11,227 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-02 20:30:11,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:11,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 289 [2022-11-02 20:30:11,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:11,579 INFO L130 PetriNetUnfolder]: 60/637 cut-off events. [2022-11-02 20:30:11,579 INFO L131 PetriNetUnfolder]: For 81/93 co-relation queries the response was YES. [2022-11-02 20:30:11,589 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 29. Compared 2991 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-02 20:30:11,597 INFO L137 encePairwiseOnDemand]: 279/289 looper letters, 21 selfloop transitions, 2 changer transitions 3/258 dead transitions. [2022-11-02 20:30:11,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 258 transitions, 580 flow [2022-11-02 20:30:11,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2022-11-02 20:30:11,630 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9215686274509803 [2022-11-02 20:30:11,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 799 transitions. [2022-11-02 20:30:11,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 799 transitions. [2022-11-02 20:30:11,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:11,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 799 transitions. [2022-11-02 20:30:11,645 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-02 20:30:11,658 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-02 20:30:11,660 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-02 20:30:11,663 INFO L175 Difference]: Start difference. First operand has 264 places, 266 transitions, 550 flow. Second operand 3 states and 799 transitions. [2022-11-02 20:30:11,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 258 transitions, 580 flow [2022-11-02 20:30:11,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 568 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-02 20:30:11,683 INFO L231 Difference]: Finished difference. Result has 259 places, 255 transitions, 520 flow [2022-11-02 20:30:11,686 INFO L270 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-02 20:30:11,693 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -5 predicate places. [2022-11-02 20:30:11,693 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 255 transitions, 520 flow [2022-11-02 20:30:11,694 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-02 20:30:11,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:11,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:11,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:30:11,696 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-02 20:30:11,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:11,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1903590535, now seen corresponding path program 1 times [2022-11-02 20:30:11,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:11,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878458285] [2022-11-02 20:30:11,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:11,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:11,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:11,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878458285] [2022-11-02 20:30:11,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878458285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:11,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:11,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:11,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219566618] [2022-11-02 20:30:11,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:11,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:11,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:11,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:11,862 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 289 [2022-11-02 20:30:11,863 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-02 20:30:11,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:11,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 289 [2022-11-02 20:30:11,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:12,027 INFO L130 PetriNetUnfolder]: 36/538 cut-off events. [2022-11-02 20:30:12,027 INFO L131 PetriNetUnfolder]: For 9/26 co-relation queries the response was YES. [2022-11-02 20:30:12,032 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 2275 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-02 20:30:12,037 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 21 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2022-11-02 20:30:12,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 254 transitions, 564 flow [2022-11-02 20:30:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 792 transitions. [2022-11-02 20:30:12,041 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9134948096885813 [2022-11-02 20:30:12,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 792 transitions. [2022-11-02 20:30:12,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 792 transitions. [2022-11-02 20:30:12,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:12,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 792 transitions. [2022-11-02 20:30:12,045 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-02 20:30:12,048 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-02 20:30:12,049 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-02 20:30:12,049 INFO L175 Difference]: Start difference. First operand has 259 places, 255 transitions, 520 flow. Second operand 3 states and 792 transitions. [2022-11-02 20:30:12,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 254 transitions, 564 flow [2022-11-02 20:30:12,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 254 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:12,058 INFO L231 Difference]: Finished difference. Result has 255 places, 254 transitions, 518 flow [2022-11-02 20:30:12,059 INFO L270 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-02 20:30:12,060 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -9 predicate places. [2022-11-02 20:30:12,060 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 254 transitions, 518 flow [2022-11-02 20:30:12,061 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-02 20:30:12,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:12,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:12,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:30:12,063 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-02 20:30:12,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:12,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1608973978, now seen corresponding path program 1 times [2022-11-02 20:30:12,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:12,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201403452] [2022-11-02 20:30:12,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:12,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:12,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:12,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201403452] [2022-11-02 20:30:12,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201403452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:12,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:12,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:12,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455280536] [2022-11-02 20:30:12,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:12,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:12,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:12,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:12,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:12,207 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-02 20:30:12,210 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-02 20:30:12,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:12,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-02 20:30:12,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:12,422 INFO L130 PetriNetUnfolder]: 25/487 cut-off events. [2022-11-02 20:30:12,422 INFO L131 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2022-11-02 20:30:12,427 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 1858 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-02 20:30:12,432 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 15 selfloop transitions, 1 changer transitions 0/250 dead transitions. [2022-11-02 20:30:12,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 542 flow [2022-11-02 20:30:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-11-02 20:30:12,437 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9192618223760092 [2022-11-02 20:30:12,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-11-02 20:30:12,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-11-02 20:30:12,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:12,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-11-02 20:30:12,442 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-02 20:30:12,445 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-02 20:30:12,448 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-02 20:30:12,449 INFO L175 Difference]: Start difference. First operand has 255 places, 254 transitions, 518 flow. Second operand 3 states and 797 transitions. [2022-11-02 20:30:12,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 542 flow [2022-11-02 20:30:12,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 250 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:12,458 INFO L231 Difference]: Finished difference. Result has 251 places, 250 transitions, 508 flow [2022-11-02 20:30:12,459 INFO L270 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-02 20:30:12,462 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-02 20:30:12,462 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 250 transitions, 508 flow [2022-11-02 20:30:12,463 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-02 20:30:12,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:12,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:12,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:30:12,464 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-02 20:30:12,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2112885161, now seen corresponding path program 1 times [2022-11-02 20:30:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:12,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989924031] [2022-11-02 20:30:12,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:12,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:12,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989924031] [2022-11-02 20:30:12,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989924031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:12,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:12,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:12,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064742488] [2022-11-02 20:30:12,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:12,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:12,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:12,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:12,621 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-02 20:30:12,623 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-02 20:30:12,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:12,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-02 20:30:12,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:13,143 INFO L130 PetriNetUnfolder]: 224/1619 cut-off events. [2022-11-02 20:30:13,143 INFO L131 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2022-11-02 20:30:13,154 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 66. Compared 12264 event pairs, 135 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 1926. Up to 322 conditions per place. [2022-11-02 20:30:13,166 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 18 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2022-11-02 20:30:13,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 249 transitions, 546 flow [2022-11-02 20:30:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:13,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 798 transitions. [2022-11-02 20:30:13,170 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9204152249134948 [2022-11-02 20:30:13,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 798 transitions. [2022-11-02 20:30:13,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 798 transitions. [2022-11-02 20:30:13,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:13,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 798 transitions. [2022-11-02 20:30:13,174 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-02 20:30:13,177 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-02 20:30:13,178 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-02 20:30:13,178 INFO L175 Difference]: Start difference. First operand has 251 places, 250 transitions, 508 flow. Second operand 3 states and 798 transitions. [2022-11-02 20:30:13,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 249 transitions, 546 flow [2022-11-02 20:30:13,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:30:13,185 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 509 flow [2022-11-02 20:30:13,186 INFO L270 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-02 20:30:13,187 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-02 20:30:13,187 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 509 flow [2022-11-02 20:30:13,188 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-02 20:30:13,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:13,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:13,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:30:13,188 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-02 20:30:13,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:13,189 INFO L85 PathProgramCache]: Analyzing trace with hash 12063358, now seen corresponding path program 1 times [2022-11-02 20:30:13,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:13,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204523279] [2022-11-02 20:30:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:13,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:13,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204523279] [2022-11-02 20:30:13,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204523279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:13,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:13,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:13,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220695619] [2022-11-02 20:30:13,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:13,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:13,921 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 289 [2022-11-02 20:30:13,923 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-02 20:30:13,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:13,924 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 289 [2022-11-02 20:30:13,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:19,281 INFO L130 PetriNetUnfolder]: 7760/21080 cut-off events. [2022-11-02 20:30:19,282 INFO L131 PetriNetUnfolder]: For 84/1596 co-relation queries the response was YES. [2022-11-02 20:30:19,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31758 conditions, 21080 events. 7760/21080 cut-off events. For 84/1596 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 232693 event pairs, 6552 based on Foata normal form. 0/16629 useless extension candidates. Maximal degree in co-relation 31718. Up to 10611 conditions per place. [2022-11-02 20:30:19,554 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 53 selfloop transitions, 5 changer transitions 0/248 dead transitions. [2022-11-02 20:30:19,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 248 transitions, 623 flow [2022-11-02 20:30:19,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:30:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:30:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1385 transitions. [2022-11-02 20:30:19,560 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7987312572087658 [2022-11-02 20:30:19,561 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1385 transitions. [2022-11-02 20:30:19,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1385 transitions. [2022-11-02 20:30:19,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:19,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1385 transitions. [2022-11-02 20:30:19,566 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-02 20:30:19,570 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-02 20:30:19,572 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-02 20:30:19,572 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 509 flow. Second operand 6 states and 1385 transitions. [2022-11-02 20:30:19,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 248 transitions, 623 flow [2022-11-02 20:30:19,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 248 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:19,580 INFO L231 Difference]: Finished difference. Result has 253 places, 248 transitions, 513 flow [2022-11-02 20:30:19,580 INFO L270 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-02 20:30:19,584 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -11 predicate places. [2022-11-02 20:30:19,585 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 248 transitions, 513 flow [2022-11-02 20:30:19,587 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-02 20:30:19,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:19,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:19,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:30:19,588 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-02 20:30:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash 34551780, now seen corresponding path program 1 times [2022-11-02 20:30:19,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:19,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448992977] [2022-11-02 20:30:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:19,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:19,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:19,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448992977] [2022-11-02 20:30:19,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448992977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:19,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:19,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:19,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028287698] [2022-11-02 20:30:19,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:19,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:19,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:19,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:19,686 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 289 [2022-11-02 20:30:19,687 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-02 20:30:19,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:19,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 289 [2022-11-02 20:30:19,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:19,821 INFO L130 PetriNetUnfolder]: 37/520 cut-off events. [2022-11-02 20:30:19,821 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-11-02 20:30:19,825 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 19. Compared 2103 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-02 20:30:19,828 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 15 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2022-11-02 20:30:19,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 537 flow [2022-11-02 20:30:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2022-11-02 20:30:19,833 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9192618223760092 [2022-11-02 20:30:19,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2022-11-02 20:30:19,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2022-11-02 20:30:19,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:19,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2022-11-02 20:30:19,837 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-02 20:30:19,839 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-02 20:30:19,840 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-02 20:30:19,840 INFO L175 Difference]: Start difference. First operand has 253 places, 248 transitions, 513 flow. Second operand 3 states and 797 transitions. [2022-11-02 20:30:19,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 537 flow [2022-11-02 20:30:19,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 244 transitions, 527 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:30:19,847 INFO L231 Difference]: Finished difference. Result has 246 places, 244 transitions, 497 flow [2022-11-02 20:30:19,848 INFO L270 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-02 20:30:19,850 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-11-02 20:30:19,851 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 244 transitions, 497 flow [2022-11-02 20:30:19,851 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-02 20:30:19,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:19,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:19,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:30:19,853 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-02 20:30:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:19,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2117582322, now seen corresponding path program 1 times [2022-11-02 20:30:19,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:19,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788795214] [2022-11-02 20:30:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:19,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:19,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:19,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:19,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788795214] [2022-11-02 20:30:19,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788795214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:19,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:19,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:19,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705810221] [2022-11-02 20:30:19,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:19,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:19,958 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-02 20:30:19,960 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-02 20:30:19,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:19,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-02 20:30:19,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:20,047 INFO L130 PetriNetUnfolder]: 18/311 cut-off events. [2022-11-02 20:30:20,049 INFO L131 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2022-11-02 20:30:20,052 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 856 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-02 20:30:20,053 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 12 selfloop transitions, 3 changer transitions 0/244 dead transitions. [2022-11-02 20:30:20,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 244 transitions, 529 flow [2022-11-02 20:30:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2022-11-02 20:30:20,058 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.936562860438293 [2022-11-02 20:30:20,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2022-11-02 20:30:20,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2022-11-02 20:30:20,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:20,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2022-11-02 20:30:20,064 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-02 20:30:20,067 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-02 20:30:20,068 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-02 20:30:20,068 INFO L175 Difference]: Start difference. First operand has 246 places, 244 transitions, 497 flow. Second operand 3 states and 812 transitions. [2022-11-02 20:30:20,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 244 transitions, 529 flow [2022-11-02 20:30:20,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 244 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:30:20,075 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 498 flow [2022-11-02 20:30:20,076 INFO L270 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-02 20:30:20,078 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -19 predicate places. [2022-11-02 20:30:20,079 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 498 flow [2022-11-02 20:30:20,080 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-02 20:30:20,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:20,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:20,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:30:20,081 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-02 20:30:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash -817865324, now seen corresponding path program 1 times [2022-11-02 20:30:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:20,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391211036] [2022-11-02 20:30:20,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:20,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:20,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:20,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391211036] [2022-11-02 20:30:20,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391211036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:20,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:20,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531717879] [2022-11-02 20:30:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:20,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:20,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:20,153 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2022-11-02 20:30:20,154 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-02 20:30:20,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:20,155 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2022-11-02 20:30:20,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:20,415 INFO L130 PetriNetUnfolder]: 114/1130 cut-off events. [2022-11-02 20:30:20,416 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-11-02 20:30:20,423 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 7449 event pairs, 29 based on Foata normal form. 0/978 useless extension candidates. Maximal degree in co-relation 1290. Up to 161 conditions per place. [2022-11-02 20:30:20,427 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 19 selfloop transitions, 3 changer transitions 0/247 dead transitions. [2022-11-02 20:30:20,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 247 transitions, 557 flow [2022-11-02 20:30:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-11-02 20:30:20,430 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9354094579008074 [2022-11-02 20:30:20,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-11-02 20:30:20,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-11-02 20:30:20,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:20,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-11-02 20:30:20,433 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-02 20:30:20,435 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-02 20:30:20,435 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-02 20:30:20,436 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 498 flow. Second operand 3 states and 811 transitions. [2022-11-02 20:30:20,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 247 transitions, 557 flow [2022-11-02 20:30:20,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 247 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:20,441 INFO L231 Difference]: Finished difference. Result has 243 places, 242 transitions, 507 flow [2022-11-02 20:30:20,441 INFO L270 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-02 20:30:20,442 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -21 predicate places. [2022-11-02 20:30:20,442 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 242 transitions, 507 flow [2022-11-02 20:30:20,443 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-02 20:30:20,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:20,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:20,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:30:20,444 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-02 20:30:20,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:20,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1722324090, now seen corresponding path program 1 times [2022-11-02 20:30:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:20,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891280782] [2022-11-02 20:30:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:20,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:20,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891280782] [2022-11-02 20:30:20,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891280782] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:20,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:20,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:20,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176901819] [2022-11-02 20:30:20,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:20,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:20,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:20,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:20,493 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-02 20:30:20,494 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-02 20:30:20,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:20,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-02 20:30:20,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:20,619 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], [60#L87-7true, 322#(= |#race~A~0| 0), 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 325#true]) [2022-11-02 20:30:20,620 INFO L383 tUnfolder$Statistics]: this new event has 206 ancestors and is cut-off event [2022-11-02 20:30:20,620 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-02 20:30:20,620 INFO L386 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-11-02 20:30:20,621 INFO L386 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2022-11-02 20:30:20,621 INFO L130 PetriNetUnfolder]: 63/605 cut-off events. [2022-11-02 20:30:20,621 INFO L131 PetriNetUnfolder]: For 30/38 co-relation queries the response was YES. [2022-11-02 20:30:20,627 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 2885 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-02 20:30:20,630 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 12 selfloop transitions, 3 changer transitions 0/242 dead transitions. [2022-11-02 20:30:20,631 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 242 transitions, 539 flow [2022-11-02 20:30:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2022-11-02 20:30:20,634 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.936562860438293 [2022-11-02 20:30:20,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2022-11-02 20:30:20,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2022-11-02 20:30:20,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:20,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2022-11-02 20:30:20,637 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-02 20:30:20,639 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-02 20:30:20,640 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-02 20:30:20,640 INFO L175 Difference]: Start difference. First operand has 243 places, 242 transitions, 507 flow. Second operand 3 states and 812 transitions. [2022-11-02 20:30:20,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 242 transitions, 539 flow [2022-11-02 20:30:20,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 242 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:30:20,646 INFO L231 Difference]: Finished difference. Result has 243 places, 240 transitions, 509 flow [2022-11-02 20:30:20,646 INFO L270 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-02 20:30:20,647 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -21 predicate places. [2022-11-02 20:30:20,647 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 240 transitions, 509 flow [2022-11-02 20:30:20,648 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-02 20:30:20,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:20,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:20,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:30:20,649 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-02 20:30:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:20,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1072662552, now seen corresponding path program 1 times [2022-11-02 20:30:20,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:20,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416449526] [2022-11-02 20:30:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:20,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:20,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:20,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416449526] [2022-11-02 20:30:20,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416449526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:20,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:20,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:30:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818313623] [2022-11-02 20:30:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:20,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:30:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:30:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:30:20,825 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 289 [2022-11-02 20:30:20,827 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-02 20:30:20,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:20,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 289 [2022-11-02 20:30:20,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:21,232 INFO L130 PetriNetUnfolder]: 255/1374 cut-off events. [2022-11-02 20:30:21,233 INFO L131 PetriNetUnfolder]: For 42/101 co-relation queries the response was YES. [2022-11-02 20:30:21,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 1374 events. 255/1374 cut-off events. For 42/101 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8836 event pairs, 117 based on Foata normal form. 1/1130 useless extension candidates. Maximal degree in co-relation 1891. Up to 337 conditions per place. [2022-11-02 20:30:21,256 INFO L137 encePairwiseOnDemand]: 280/289 looper letters, 57 selfloop transitions, 8 changer transitions 0/265 dead transitions. [2022-11-02 20:30:21,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 265 transitions, 697 flow [2022-11-02 20:30:21,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:30:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-02 20:30:21,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1978 transitions. [2022-11-02 20:30:21,262 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8555363321799307 [2022-11-02 20:30:21,263 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1978 transitions. [2022-11-02 20:30:21,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1978 transitions. [2022-11-02 20:30:21,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:21,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1978 transitions. [2022-11-02 20:30:21,271 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-02 20:30:21,276 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-02 20:30:21,278 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-02 20:30:21,278 INFO L175 Difference]: Start difference. First operand has 243 places, 240 transitions, 509 flow. Second operand 8 states and 1978 transitions. [2022-11-02 20:30:21,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 265 transitions, 697 flow [2022-11-02 20:30:21,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 265 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:21,286 INFO L231 Difference]: Finished difference. Result has 251 places, 243 transitions, 539 flow [2022-11-02 20:30:21,287 INFO L270 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-02 20:30:21,288 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-02 20:30:21,288 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 243 transitions, 539 flow [2022-11-02 20:30:21,289 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-02 20:30:21,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:21,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:21,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:30:21,291 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-02 20:30:21,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:21,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2099288416, now seen corresponding path program 1 times [2022-11-02 20:30:21,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:21,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319089890] [2022-11-02 20:30:21,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:21,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:21,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:21,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319089890] [2022-11-02 20:30:21,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319089890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:21,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:21,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:21,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235284864] [2022-11-02 20:30:21,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:21,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:30:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:30:21,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:30:21,465 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 289 [2022-11-02 20:30:21,468 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-02 20:30:21,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:21,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 289 [2022-11-02 20:30:21,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:21,980 INFO L130 PetriNetUnfolder]: 298/2171 cut-off events. [2022-11-02 20:30:21,980 INFO L131 PetriNetUnfolder]: For 156/202 co-relation queries the response was YES. [2022-11-02 20:30:21,998 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 18054 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-02 20:30:22,010 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 38 selfloop transitions, 4 changer transitions 0/257 dead transitions. [2022-11-02 20:30:22,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 257 transitions, 659 flow [2022-11-02 20:30:22,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:30:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 20:30:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1303 transitions. [2022-11-02 20:30:22,015 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9017301038062284 [2022-11-02 20:30:22,016 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1303 transitions. [2022-11-02 20:30:22,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1303 transitions. [2022-11-02 20:30:22,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:22,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1303 transitions. [2022-11-02 20:30:22,021 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-02 20:30:22,024 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-02 20:30:22,025 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-02 20:30:22,026 INFO L175 Difference]: Start difference. First operand has 251 places, 243 transitions, 539 flow. Second operand 5 states and 1303 transitions. [2022-11-02 20:30:22,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 257 transitions, 659 flow [2022-11-02 20:30:22,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 649 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:30:22,033 INFO L231 Difference]: Finished difference. Result has 253 places, 244 transitions, 546 flow [2022-11-02 20:30:22,034 INFO L270 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-02 20:30:22,035 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -11 predicate places. [2022-11-02 20:30:22,035 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 244 transitions, 546 flow [2022-11-02 20:30:22,036 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-02 20:30:22,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:22,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:22,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:30:22,037 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-02 20:30:22,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1108507916, now seen corresponding path program 1 times [2022-11-02 20:30:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:22,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139424347] [2022-11-02 20:30:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:22,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:22,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139424347] [2022-11-02 20:30:22,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139424347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:22,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:22,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:30:22,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808676874] [2022-11-02 20:30:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:22,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:30:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:30:22,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:30:22,100 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2022-11-02 20:30:22,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 244 transitions, 546 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-02 20:30:22,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:22,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2022-11-02 20:30:22,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:22,438 INFO L130 PetriNetUnfolder]: 158/1360 cut-off events. [2022-11-02 20:30:22,439 INFO L131 PetriNetUnfolder]: For 135/155 co-relation queries the response was YES. [2022-11-02 20:30:22,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1763 conditions, 1360 events. 158/1360 cut-off events. For 135/155 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 9488 event pairs, 31 based on Foata normal form. 15/1260 useless extension candidates. Maximal degree in co-relation 1717. Up to 133 conditions per place. [2022-11-02 20:30:22,457 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 10 selfloop transitions, 2 changer transitions 7/244 dead transitions. [2022-11-02 20:30:22,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 576 flow [2022-11-02 20:30:22,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:30:22,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:30:22,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2022-11-02 20:30:22,461 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9354094579008074 [2022-11-02 20:30:22,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 811 transitions. [2022-11-02 20:30:22,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 811 transitions. [2022-11-02 20:30:22,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:22,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 811 transitions. [2022-11-02 20:30:22,465 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-02 20:30:22,467 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-02 20:30:22,468 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-02 20:30:22,468 INFO L175 Difference]: Start difference. First operand has 253 places, 244 transitions, 546 flow. Second operand 3 states and 811 transitions. [2022-11-02 20:30:22,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 576 flow [2022-11-02 20:30:22,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 244 transitions, 571 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:22,476 INFO L231 Difference]: Finished difference. Result has 251 places, 235 transitions, 526 flow [2022-11-02 20:30:22,476 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=251, PETRI_TRANSITIONS=235} [2022-11-02 20:30:22,477 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -13 predicate places. [2022-11-02 20:30:22,477 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 235 transitions, 526 flow [2022-11-02 20:30:22,479 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-02 20:30:22,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:22,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:22,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:30:22,480 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2022-11-02 20:30:22,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:22,480 INFO L85 PathProgramCache]: Analyzing trace with hash -371646906, now seen corresponding path program 1 times [2022-11-02 20:30:22,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:22,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582251497] [2022-11-02 20:30:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:22,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:23,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582251497] [2022-11-02 20:30:23,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582251497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:23,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:23,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032405724] [2022-11-02 20:30:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:23,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:23,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:23,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:23,047 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-02 20:30:23,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 235 transitions, 526 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-02 20:30:23,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:23,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-02 20:30:23,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:26,460 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][184], [130#thread2ENTRYtrue, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-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|)), 351#(<= (+ ~M~0 1) 0), 198#L84-4true, 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#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#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:26,461 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-02 20:30:26,461 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:30:26,461 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:30:26,461 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:30:27,848 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][184], [130#thread2ENTRYtrue, 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), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-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#true, 198#L84-4true, 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)), 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:27,849 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-02 20:30:27,849 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-02 20:30:27,849 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:30:27,849 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:30:28,939 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][184], [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), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 180#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#true, 198#L84-4true, 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)), 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:28,940 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:30:28,940 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:30:28,940 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:30:28,940 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:30:28,989 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][173], [Black: 351#(<= (+ ~M~0 1) 0), 24#L65-6true, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 365#(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)), 177#L85-7true, 180#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)), 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:28,990 INFO L383 tUnfolder$Statistics]: this new event has 170 ancestors and is cut-off event [2022-11-02 20:30:28,990 INFO L386 tUnfolder$Statistics]: existing Event has 148 ancestors and is cut-off event [2022-11-02 20:30:28,990 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-02 20:30:28,990 INFO L386 tUnfolder$Statistics]: existing Event has 170 ancestors and is cut-off event [2022-11-02 20:30:29,328 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][173], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 131#L86-2true, 365#(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)), 180#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)), 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:29,329 INFO L383 tUnfolder$Statistics]: this new event has 173 ancestors and is cut-off event [2022-11-02 20:30:29,329 INFO L386 tUnfolder$Statistics]: existing Event has 151 ancestors and is cut-off event [2022-11-02 20:30:29,329 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-02 20:30:29,329 INFO L386 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-11-02 20:30:29,400 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][173], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 190#L86-3true, 365#(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)), 180#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)), 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:29,400 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-02 20:30:29,400 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-02 20:30:29,401 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:30:29,401 INFO L386 tUnfolder$Statistics]: existing Event has 174 ancestors and is cut-off event [2022-11-02 20:30:29,476 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][173], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 162#L86-4true, 365#(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)), 180#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)), 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:29,476 INFO L383 tUnfolder$Statistics]: this new event has 175 ancestors and is cut-off event [2022-11-02 20:30:29,476 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-02 20:30:29,477 INFO L386 tUnfolder$Statistics]: existing Event has 153 ancestors and is cut-off event [2022-11-02 20:30:29,477 INFO L386 tUnfolder$Statistics]: existing Event has 175 ancestors and is cut-off event [2022-11-02 20:30:29,540 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][173], [Black: 351#(<= (+ ~M~0 1) 0), 24#L65-6true, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 365#(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)), 180#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-5true, 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:29,540 INFO L383 tUnfolder$Statistics]: this new event has 176 ancestors and is cut-off event [2022-11-02 20:30:29,540 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-02 20:30:29,540 INFO L386 tUnfolder$Statistics]: existing Event has 176 ancestors and is cut-off event [2022-11-02 20:30:29,540 INFO L386 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-11-02 20:30:29,600 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][173], [Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), 24#L65-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 365#(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)), 180#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)), 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:29,600 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-02 20:30:29,600 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:30:29,601 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-02 20:30:29,601 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-02 20:30:29,601 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][173], [Black: 351#(<= (+ ~M~0 1) 0), 24#L65-6true, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 365#(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)), 180#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|)), 31#ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACEtrue, 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)), 358#(= |#race~sum3~0| 0)]) [2022-11-02 20:30:29,601 INFO L383 tUnfolder$Statistics]: this new event has 177 ancestors and is cut-off event [2022-11-02 20:30:29,602 INFO L386 tUnfolder$Statistics]: existing Event has 155 ancestors and is cut-off event [2022-11-02 20:30:29,602 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-02 20:30:29,602 INFO L386 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-11-02 20:30:29,986 INFO L130 PetriNetUnfolder]: 12085/30503 cut-off events. [2022-11-02 20:30:29,987 INFO L131 PetriNetUnfolder]: For 189/472 co-relation queries the response was YES. [2022-11-02 20:30:30,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49555 conditions, 30503 events. 12085/30503 cut-off events. For 189/472 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 334201 event pairs, 3745 based on Foata normal form. 72/26718 useless extension candidates. Maximal degree in co-relation 49507. Up to 7186 conditions per place. [2022-11-02 20:30:30,342 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 117 selfloop transitions, 4 changer transitions 0/306 dead transitions. [2022-11-02 20:30:30,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 306 transitions, 910 flow [2022-11-02 20:30:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:30:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:30:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1478 transitions. [2022-11-02 20:30:30,347 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8523644752018454 [2022-11-02 20:30:30,348 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1478 transitions. [2022-11-02 20:30:30,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1478 transitions. [2022-11-02 20:30:30,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:30,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1478 transitions. [2022-11-02 20:30:30,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:30:30,357 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-02 20:30:30,358 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-02 20:30:30,359 INFO L175 Difference]: Start difference. First operand has 251 places, 235 transitions, 526 flow. Second operand 6 states and 1478 transitions. [2022-11-02 20:30:30,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 306 transitions, 910 flow [2022-11-02 20:30:30,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 306 transitions, 906 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:30:30,412 INFO L231 Difference]: Finished difference. Result has 246 places, 234 transitions, 528 flow [2022-11-02 20:30:30,413 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=289, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=246, PETRI_TRANSITIONS=234} [2022-11-02 20:30:30,415 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-11-02 20:30:30,415 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 234 transitions, 528 flow [2022-11-02 20:30:30,416 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-02 20:30:30,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:30,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:30,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:30:30,417 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-02 20:30:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1095931425, now seen corresponding path program 1 times [2022-11-02 20:30:30,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:30,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583129109] [2022-11-02 20:30:30,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:30,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:31,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:31,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583129109] [2022-11-02 20:30:31,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583129109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:31,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:31,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905771369] [2022-11-02 20:30:31,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:31,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:31,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:31,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:31,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:31,165 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-02 20:30:31,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 234 transitions, 528 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-02 20:30:31,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:31,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-02 20:30:31,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:39,319 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], [130#thread2ENTRYtrue, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 320#true, 161#L65-3true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-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|)), 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|)), 360#true, 198#L84-4true, 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-02 20:30:39,319 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-02 20:30:39,320 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:30:39,320 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:30:39,320 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:30:40,972 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], [130#thread2ENTRYtrue, 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), Black: 320#true, 161#L65-3true, 314#(= |#race~M~0| 0), 36#L49-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#true, 198#L84-4true, 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-02 20:30:40,973 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-02 20:30:40,973 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-02 20:30:40,973 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:30:40,973 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:30:42,736 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, 299#(= |#race~N~0| 0), 161#L65-3true, 314#(= |#race~M~0| 0), 36#L49-3true, 180#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#true, 198#L84-4true, 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-02 20:30:42,737 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:30:42,737 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:30:42,737 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:30:42,737 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:30:43,240 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)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 362#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 36#L49-3true, 180#L57-3true, 138#L85-2true, 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-02 20:30:43,241 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-02 20:30:43,241 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-02 20:30:43,241 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:30:43,241 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:30:43,325 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)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 247#L85-3true, 314#(= |#race~M~0| 0), 36#L49-3true, 363#(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)), 180#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-02 20:30:43,326 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-02 20:30:43,326 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:30:43,326 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:30:43,326 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:30:43,385 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)), 299#(= |#race~N~0| 0), Black: 320#true, 161#L65-3true, 314#(= |#race~M~0| 0), 36#L49-3true, 364#(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)), 180#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, 188#L85-4true]) [2022-11-02 20:30:43,385 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-02 20:30:43,385 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 20:30:43,385 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 20:30:43,386 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 20:30:43,432 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)), Black: 320#true, 161#L65-3true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 125#L85-5true, 365#(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)), 180#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-02 20:30:43,432 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-11-02 20:30:43,432 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:30:43,433 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:30:43,433 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:30:43,467 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), 9#L85-6true, Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 365#(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)), 180#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-02 20:30:43,467 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-02 20:30:43,467 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:30:43,467 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:30:43,468 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:30:43,872 INFO L130 PetriNetUnfolder]: 23566/58783 cut-off events. [2022-11-02 20:30:43,872 INFO L131 PetriNetUnfolder]: For 8596/8596 co-relation queries the response was YES. [2022-11-02 20:30:44,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101777 conditions, 58783 events. 23566/58783 cut-off events. For 8596/8596 co-relation queries the response was YES. Maximal size of possible extension queue 1766. Compared 715946 event pairs, 12497 based on Foata normal form. 0/53498 useless extension candidates. Maximal degree in co-relation 101730. Up to 19940 conditions per place. [2022-11-02 20:30:44,489 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 158 selfloop transitions, 5 changer transitions 0/341 dead transitions. [2022-11-02 20:30:44,490 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 341 transitions, 1108 flow [2022-11-02 20:30:44,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:30:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:30:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1495 transitions. [2022-11-02 20:30:44,496 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8621683967704729 [2022-11-02 20:30:44,497 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1495 transitions. [2022-11-02 20:30:44,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1495 transitions. [2022-11-02 20:30:44,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:44,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1495 transitions. [2022-11-02 20:30:44,505 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-02 20:30:44,509 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-02 20:30:44,510 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-02 20:30:44,510 INFO L175 Difference]: Start difference. First operand has 246 places, 234 transitions, 528 flow. Second operand 6 states and 1495 transitions. [2022-11-02 20:30:44,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 341 transitions, 1108 flow [2022-11-02 20:30:44,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 341 transitions, 1073 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:30:44,549 INFO L231 Difference]: Finished difference. Result has 246 places, 233 transitions, 529 flow [2022-11-02 20:30:44,550 INFO L270 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-02 20:30:44,551 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -18 predicate places. [2022-11-02 20:30:44,551 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 233 transitions, 529 flow [2022-11-02 20:30:44,552 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-02 20:30:44,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:44,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:44,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:30:44,553 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-02 20:30:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:44,554 INFO L85 PathProgramCache]: Analyzing trace with hash 635641522, now seen corresponding path program 1 times [2022-11-02 20:30:44,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:44,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492507113] [2022-11-02 20:30:44,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:44,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:30:45,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:45,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492507113] [2022-11-02 20:30:45,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492507113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:45,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:45,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:45,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145392028] [2022-11-02 20:30:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:45,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:45,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:45,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:45,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:45,089 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-02 20:30:45,091 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-02 20:30:45,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:45,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-02 20:30:45,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:30:50,230 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), 314#(= |#race~M~0| 0), 36#L49-3true, 180#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-02 20:30:50,230 INFO L383 tUnfolder$Statistics]: this new event has 166 ancestors and is cut-off event [2022-11-02 20:30:50,231 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-02 20:30:50,231 INFO L386 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-11-02 20:30:50,231 INFO L386 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-11-02 20:30:54,716 INFO L130 PetriNetUnfolder]: 18385/43344 cut-off events. [2022-11-02 20:30:54,716 INFO L131 PetriNetUnfolder]: For 3508/3622 co-relation queries the response was YES. [2022-11-02 20:30:54,944 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 1353. Compared 487645 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-02 20:30:55,144 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 176 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2022-11-02 20:30:55,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 360 transitions, 1189 flow [2022-11-02 20:30:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:30:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:30:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1514 transitions. [2022-11-02 20:30:55,150 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8731257208765859 [2022-11-02 20:30:55,151 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1514 transitions. [2022-11-02 20:30:55,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1514 transitions. [2022-11-02 20:30:55,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:30:55,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1514 transitions. [2022-11-02 20:30:55,156 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-02 20:30:55,160 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-02 20:30:55,161 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-02 20:30:55,161 INFO L175 Difference]: Start difference. First operand has 246 places, 233 transitions, 529 flow. Second operand 6 states and 1514 transitions. [2022-11-02 20:30:55,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 360 transitions, 1189 flow [2022-11-02 20:30:55,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 360 transitions, 1147 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:30:55,190 INFO L231 Difference]: Finished difference. Result has 245 places, 232 transitions, 527 flow [2022-11-02 20:30:55,192 INFO L270 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-02 20:30:55,192 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -19 predicate places. [2022-11-02 20:30:55,193 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 232 transitions, 527 flow [2022-11-02 20:30:55,193 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-02 20:30:55,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:30:55,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:30:55,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:30:55,194 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-02 20:30:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:30:55,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1828133762, now seen corresponding path program 1 times [2022-11-02 20:30:55,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:30:55,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860769358] [2022-11-02 20:30:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:30:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:30:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:30:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:30:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:30:55,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860769358] [2022-11-02 20:30:55,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860769358] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:30:55,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:30:55,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:30:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965690101] [2022-11-02 20:30:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:30:55,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:30:55,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:30:55,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:30:55,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:30:55,740 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 289 [2022-11-02 20:30:55,742 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-02 20:30:55,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:30:55,743 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 289 [2022-11-02 20:30:55,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:04,640 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)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 381#true, 180#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|)), 198#L84-4true, 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-02 20:31:04,640 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:31:04,641 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:31:04,641 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:31:04,641 INFO L386 tUnfolder$Statistics]: existing Event has 181 ancestors and is cut-off event [2022-11-02 20:31:04,707 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)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 381#true, 138#L85-2true, 180#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-02 20:31:04,707 INFO L383 tUnfolder$Statistics]: this new event has 185 ancestors and is cut-off event [2022-11-02 20:31:04,707 INFO L386 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2022-11-02 20:31:04,707 INFO L386 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2022-11-02 20:31:04,708 INFO L386 tUnfolder$Statistics]: existing Event has 163 ancestors and is cut-off event [2022-11-02 20:31:04,726 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)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 363#(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, 180#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-02 20:31:04,727 INFO L383 tUnfolder$Statistics]: this new event has 186 ancestors and is cut-off event [2022-11-02 20:31:04,727 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:31:04,727 INFO L386 tUnfolder$Statistics]: existing Event has 164 ancestors and is cut-off event [2022-11-02 20:31:04,728 INFO L386 tUnfolder$Statistics]: existing Event has 186 ancestors and is cut-off event [2022-11-02 20:31:04,742 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)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 364#(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)), 381#true, 180#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-02 20:31:04,742 INFO L383 tUnfolder$Statistics]: this new event has 187 ancestors and is cut-off event [2022-11-02 20:31:04,742 INFO L386 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2022-11-02 20:31:04,743 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 20:31:04,743 INFO L386 tUnfolder$Statistics]: existing Event has 165 ancestors and is cut-off event [2022-11-02 20:31:04,753 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)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 125#L85-5true, 365#(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)), 381#true, 180#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-02 20:31:04,753 INFO L383 tUnfolder$Statistics]: this new event has 188 ancestors and is cut-off event [2022-11-02 20:31:04,753 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:31:04,753 INFO L386 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-11-02 20:31:04,754 INFO L386 tUnfolder$Statistics]: existing Event has 166 ancestors and is cut-off event [2022-11-02 20:31:04,765 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)), 161#L65-3true, 299#(= |#race~N~0| 0), Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 365#(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)), 381#true, 180#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-02 20:31:04,765 INFO L383 tUnfolder$Statistics]: this new event has 189 ancestors and is cut-off event [2022-11-02 20:31:04,766 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:31:04,766 INFO L386 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-11-02 20:31:04,766 INFO L386 tUnfolder$Statistics]: existing Event has 189 ancestors and is cut-off event [2022-11-02 20:31:04,782 INFO L130 PetriNetUnfolder]: 17672/44290 cut-off events. [2022-11-02 20:31:04,782 INFO L131 PetriNetUnfolder]: For 4582/5005 co-relation queries the response was YES. [2022-11-02 20:31:05,057 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 1262. Compared 504689 event pairs, 10154 based on Foata normal form. 0/41499 useless extension candidates. Maximal degree in co-relation 77622. Up to 15756 conditions per place. [2022-11-02 20:31:05,294 INFO L137 encePairwiseOnDemand]: 283/289 looper letters, 124 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2022-11-02 20:31:05,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 307 transitions, 979 flow [2022-11-02 20:31:05,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1461 transitions. [2022-11-02 20:31:05,300 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.842560553633218 [2022-11-02 20:31:05,301 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1461 transitions. [2022-11-02 20:31:05,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1461 transitions. [2022-11-02 20:31:05,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:05,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1461 transitions. [2022-11-02 20:31:05,307 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-02 20:31:05,312 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-02 20:31:05,313 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-02 20:31:05,313 INFO L175 Difference]: Start difference. First operand has 245 places, 232 transitions, 527 flow. Second operand 6 states and 1461 transitions. [2022-11-02 20:31:05,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 307 transitions, 979 flow [2022-11-02 20:31:05,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 307 transitions, 937 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:31:05,345 INFO L231 Difference]: Finished difference. Result has 244 places, 231 transitions, 525 flow [2022-11-02 20:31:05,346 INFO L270 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-02 20:31:05,346 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -20 predicate places. [2022-11-02 20:31:05,347 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 231 transitions, 525 flow [2022-11-02 20:31:05,347 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-02 20:31:05,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:05,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:05,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:31:05,349 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-02 20:31:05,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:05,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1969701154, now seen corresponding path program 1 times [2022-11-02 20:31:05,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:05,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308021981] [2022-11-02 20:31:05,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:05,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:05,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:05,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308021981] [2022-11-02 20:31:05,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308021981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:05,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:05,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703027777] [2022-11-02 20:31:05,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:05,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:05,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:05,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:05,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:05,427 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-02 20:31:05,429 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-02 20:31:05,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:05,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-02 20:31:05,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:05,694 INFO L130 PetriNetUnfolder]: 95/1172 cut-off events. [2022-11-02 20:31:05,694 INFO L131 PetriNetUnfolder]: For 57/71 co-relation queries the response was YES. [2022-11-02 20:31:05,702 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 7253 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-02 20:31:05,706 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2022-11-02 20:31:05,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 232 transitions, 555 flow [2022-11-02 20:31:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-02 20:31:05,710 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-02 20:31:05,710 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-02 20:31:05,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-02 20:31:05,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:05,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-02 20:31:05,723 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-02 20:31:05,726 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-02 20:31:05,727 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-02 20:31:05,727 INFO L175 Difference]: Start difference. First operand has 244 places, 231 transitions, 525 flow. Second operand 3 states and 803 transitions. [2022-11-02 20:31:05,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 232 transitions, 555 flow [2022-11-02 20:31:05,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 232 transitions, 545 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-02 20:31:05,736 INFO L231 Difference]: Finished difference. Result has 240 places, 230 transitions, 517 flow [2022-11-02 20:31:05,736 INFO L270 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-02 20:31:05,737 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-02 20:31:05,737 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 230 transitions, 517 flow [2022-11-02 20:31:05,738 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-02 20:31:05,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:05,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:05,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:31:05,739 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-02 20:31:05,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:05,740 INFO L85 PathProgramCache]: Analyzing trace with hash 777045301, now seen corresponding path program 1 times [2022-11-02 20:31:05,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:05,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973300528] [2022-11-02 20:31:05,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:05,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:05,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973300528] [2022-11-02 20:31:05,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973300528] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:05,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:05,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452223977] [2022-11-02 20:31:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:05,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:05,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:05,812 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-02 20:31:05,813 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-02 20:31:05,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:05,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-02 20:31:05,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:06,132 INFO L130 PetriNetUnfolder]: 170/1270 cut-off events. [2022-11-02 20:31:06,132 INFO L131 PetriNetUnfolder]: For 139/152 co-relation queries the response was YES. [2022-11-02 20:31:06,141 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 8765 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-02 20:31:06,146 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2022-11-02 20:31:06,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 231 transitions, 547 flow [2022-11-02 20:31:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-02 20:31:06,150 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-02 20:31:06,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-02 20:31:06,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-02 20:31:06,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:06,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-02 20:31:06,155 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-02 20:31:06,158 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-02 20:31:06,159 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-02 20:31:06,159 INFO L175 Difference]: Start difference. First operand has 240 places, 230 transitions, 517 flow. Second operand 3 states and 803 transitions. [2022-11-02 20:31:06,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 231 transitions, 547 flow [2022-11-02 20:31:06,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 231 transitions, 543 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:06,167 INFO L231 Difference]: Finished difference. Result has 239 places, 229 transitions, 515 flow [2022-11-02 20:31:06,167 INFO L270 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-02 20:31:06,168 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -25 predicate places. [2022-11-02 20:31:06,169 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 229 transitions, 515 flow [2022-11-02 20:31:06,169 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-02 20:31:06,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:06,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:06,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:31:06,170 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-02 20:31:06,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1638244027, now seen corresponding path program 1 times [2022-11-02 20:31:06,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:06,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691113099] [2022-11-02 20:31:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:06,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:31:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:06,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691113099] [2022-11-02 20:31:06,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691113099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:06,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:06,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:31:06,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486314261] [2022-11-02 20:31:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:06,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:31:06,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:06,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:31:06,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:31:06,254 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 289 [2022-11-02 20:31:06,256 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-02 20:31:06,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:06,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 289 [2022-11-02 20:31:06,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:06,546 INFO L130 PetriNetUnfolder]: 77/1083 cut-off events. [2022-11-02 20:31:06,547 INFO L131 PetriNetUnfolder]: For 26/42 co-relation queries the response was YES. [2022-11-02 20:31:06,557 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 6464 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-02 20:31:06,561 INFO L137 encePairwiseOnDemand]: 286/289 looper letters, 11 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2022-11-02 20:31:06,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 230 transitions, 545 flow [2022-11-02 20:31:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:31:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:31:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 803 transitions. [2022-11-02 20:31:06,565 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9261822376009228 [2022-11-02 20:31:06,566 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 803 transitions. [2022-11-02 20:31:06,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 803 transitions. [2022-11-02 20:31:06,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:06,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 803 transitions. [2022-11-02 20:31:06,570 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-02 20:31:06,573 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-02 20:31:06,573 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-02 20:31:06,574 INFO L175 Difference]: Start difference. First operand has 239 places, 229 transitions, 515 flow. Second operand 3 states and 803 transitions. [2022-11-02 20:31:06,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 230 transitions, 545 flow [2022-11-02 20:31:06,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 230 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:06,581 INFO L231 Difference]: Finished difference. Result has 238 places, 228 transitions, 513 flow [2022-11-02 20:31:06,582 INFO L270 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-02 20:31:06,582 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -26 predicate places. [2022-11-02 20:31:06,583 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 228 transitions, 513 flow [2022-11-02 20:31:06,583 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-02 20:31:06,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:06,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:06,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:31:06,584 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-02 20:31:06,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:06,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1413192531, now seen corresponding path program 1 times [2022-11-02 20:31:06,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:06,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515181914] [2022-11-02 20:31:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:07,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:07,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515181914] [2022-11-02 20:31:07,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515181914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:07,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:07,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:07,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181800845] [2022-11-02 20:31:07,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:07,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:07,351 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-02 20:31:07,353 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-02 20:31:07,353 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:07,353 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-02 20:31:07,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:09,777 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], [130#thread2ENTRYtrue, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 396#true, 400#true, 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|)), 198#L84-4true, 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-02 20:31:09,778 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-02 20:31:09,778 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:31:09,778 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:31:09,778 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:31:10,247 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], [130#thread2ENTRYtrue, Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 161#L65-3true, Black: 320#true, 299#(= |#race~N~0| 0), 314#(= |#race~M~0| 0), 36#L49-3true, 400#true, 396#true, 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|)), 198#L84-4true, 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-02 20:31:10,248 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-02 20:31:10,248 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:31:10,248 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-02 20:31:10,248 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:31:11,202 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)), 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 396#true, 400#true, 180#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|)), 198#L84-4true, 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-02 20:31:11,202 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:31:11,202 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:31:11,203 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:31:11,203 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:31:11,811 INFO L130 PetriNetUnfolder]: 7151/24530 cut-off events. [2022-11-02 20:31:11,811 INFO L131 PetriNetUnfolder]: For 153/453 co-relation queries the response was YES. [2022-11-02 20:31:11,952 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 301629 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-02 20:31:12,018 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 81 selfloop transitions, 4 changer transitions 0/267 dead transitions. [2022-11-02 20:31:12,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 267 transitions, 761 flow [2022-11-02 20:31:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1442 transitions. [2022-11-02 20:31:12,024 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.831603229527105 [2022-11-02 20:31:12,024 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1442 transitions. [2022-11-02 20:31:12,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1442 transitions. [2022-11-02 20:31:12,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:12,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1442 transitions. [2022-11-02 20:31:12,030 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-02 20:31:12,035 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-02 20:31:12,036 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-02 20:31:12,036 INFO L175 Difference]: Start difference. First operand has 238 places, 228 transitions, 513 flow. Second operand 6 states and 1442 transitions. [2022-11-02 20:31:12,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 267 transitions, 761 flow [2022-11-02 20:31:12,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 267 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:31:12,115 INFO L231 Difference]: Finished difference. Result has 240 places, 227 transitions, 515 flow [2022-11-02 20:31:12,115 INFO L270 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-02 20:31:12,116 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-02 20:31:12,116 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 227 transitions, 515 flow [2022-11-02 20:31:12,117 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-02 20:31:12,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:31:12,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:31:12,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:31:12,118 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-02 20:31:12,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:31:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1179725226, now seen corresponding path program 1 times [2022-11-02 20:31:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:31:12,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458525128] [2022-11-02 20:31:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:31:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:31:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:31:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:31:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:31:12,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458525128] [2022-11-02 20:31:12,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458525128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:31:12,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:31:12,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:31:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231465273] [2022-11-02 20:31:12,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:31:12,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:31:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:31:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:31:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:31:12,674 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 289 [2022-11-02 20:31:12,676 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-02 20:31:12,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:31:12,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 289 [2022-11-02 20:31:12,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:31:15,964 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], [130#thread2ENTRYtrue, 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 299#(= |#race~N~0| 0), 407#true, 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 400#true, 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|)), 198#L84-4true, 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-02 20:31:15,965 INFO L383 tUnfolder$Statistics]: this new event has 169 ancestors and is cut-off event [2022-11-02 20:31:15,965 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:31:15,965 INFO L386 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-11-02 20:31:15,965 INFO L386 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-11-02 20:31:16,433 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], [130#thread2ENTRYtrue, Black: 351#(<= (+ ~M~0 1) 0), 322#(= |#race~A~0| 0), Black: 352#(and (<= (+ ~M~0 1) 0) (= thread2Thread1of1ForFork0_~i~1 0)), 407#true, 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 400#true, 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|)), 198#L84-4true, 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-02 20:31:16,434 INFO L383 tUnfolder$Statistics]: this new event has 174 ancestors and is cut-off event [2022-11-02 20:31:16,434 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:31:16,434 INFO L386 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-11-02 20:31:16,434 INFO L386 tUnfolder$Statistics]: existing Event has 130 ancestors and is cut-off event [2022-11-02 20:31:17,012 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, 299#(= |#race~N~0| 0), 161#L65-3true, Black: 320#true, 314#(= |#race~M~0| 0), 36#L49-3true, 400#true, 180#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|)), 198#L84-4true, 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-02 20:31:17,012 INFO L383 tUnfolder$Statistics]: this new event has 181 ancestors and is cut-off event [2022-11-02 20:31:17,012 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:31:17,012 INFO L386 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-11-02 20:31:17,012 INFO L386 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-11-02 20:31:17,976 INFO L130 PetriNetUnfolder]: 7065/24550 cut-off events. [2022-11-02 20:31:17,976 INFO L131 PetriNetUnfolder]: For 338/586 co-relation queries the response was YES. [2022-11-02 20:31:18,122 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 303218 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-02 20:31:18,131 INFO L137 encePairwiseOnDemand]: 284/289 looper letters, 0 selfloop transitions, 0 changer transitions 246/246 dead transitions. [2022-11-02 20:31:18,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 246 transitions, 681 flow [2022-11-02 20:31:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:31:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:31:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1421 transitions. [2022-11-02 20:31:18,136 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8194925028835064 [2022-11-02 20:31:18,136 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1421 transitions. [2022-11-02 20:31:18,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1421 transitions. [2022-11-02 20:31:18,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:31:18,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1421 transitions. [2022-11-02 20:31:18,142 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-02 20:31:18,146 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-02 20:31:18,147 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-02 20:31:18,147 INFO L175 Difference]: Start difference. First operand has 240 places, 227 transitions, 515 flow. Second operand 6 states and 1421 transitions. [2022-11-02 20:31:18,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 246 transitions, 681 flow [2022-11-02 20:31:18,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 246 transitions, 674 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:31:18,166 INFO L231 Difference]: Finished difference. Result has 240 places, 0 transitions, 0 flow [2022-11-02 20:31:18,167 INFO L270 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-02 20:31:18,167 INFO L287 CegarLoopForPetriNet]: 264 programPoint places, -24 predicate places. [2022-11-02 20:31:18,168 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 0 transitions, 0 flow [2022-11-02 20:31:18,168 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-02 20:31:18,172 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 49 remaining) [2022-11-02 20:31:18,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2022-11-02 20:31:18,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2022-11-02 20:31:18,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2022-11-02 20:31:18,173 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2022-11-02 20:31:18,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2022-11-02 20:31:18,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2022-11-02 20:31:18,174 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2022-11-02 20:31:18,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2022-11-02 20:31:18,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2022-11-02 20:31:18,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2022-11-02 20:31:18,175 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2022-11-02 20:31:18,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2022-11-02 20:31:18,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2022-11-02 20:31:18,176 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2022-11-02 20:31:18,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2022-11-02 20:31:18,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2022-11-02 20:31:18,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2022-11-02 20:31:18,177 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2022-11-02 20:31:18,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2022-11-02 20:31:18,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2022-11-02 20:31:18,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2022-11-02 20:31:18,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2022-11-02 20:31:18,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2022-11-02 20:31:18,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2022-11-02 20:31:18,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2022-11-02 20:31:18,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2022-11-02 20:31:18,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2022-11-02 20:31:18,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2022-11-02 20:31:18,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (19 of 49 remaining) [2022-11-02 20:31:18,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 49 remaining) [2022-11-02 20:31:18,180 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 49 remaining) [2022-11-02 20:31:18,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 49 remaining) [2022-11-02 20:31:18,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2022-11-02 20:31:18,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2022-11-02 20:31:18,181 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2022-11-02 20:31:18,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2022-11-02 20:31:18,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2022-11-02 20:31:18,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2022-11-02 20:31:18,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2022-11-02 20:31:18,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2022-11-02 20:31:18,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2022-11-02 20:31:18,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2022-11-02 20:31:18,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2022-11-02 20:31:18,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2022-11-02 20:31:18,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2022-11-02 20:31:18,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2022-11-02 20:31:18,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2022-11-02 20:31:18,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2022-11-02 20:31:18,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:31:18,185 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-02 20:31:18,193 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:31:18,193 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:31:18,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:31:18 BasicIcfg [2022-11-02 20:31:18,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:31:18,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:31:18,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:31:18,205 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:31:18,206 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:30:10" (3/4) ... [2022-11-02 20:31:18,211 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:31:18,218 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:31:18,219 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:31:18,219 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:31:18,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-11-02 20:31:18,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:31:18,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:31:18,230 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:31:18,291 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:31:18,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:31:18,296 INFO L158 Benchmark]: Toolchain (without parser) took 69409.96ms. Allocated memory was 136.3MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 97.7MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2022-11-02 20:31:18,297 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 136.3MB. Free memory was 114.3MB in the beginning and 114.2MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:31:18,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.98ms. Allocated memory is still 136.3MB. Free memory was 97.5MB in the beginning and 109.2MB in the end (delta: -11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 20:31:18,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.82ms. Allocated memory is still 136.3MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:31:18,298 INFO L158 Benchmark]: Boogie Preprocessor took 49.24ms. Allocated memory is still 136.3MB. Free memory was 106.7MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:31:18,298 INFO L158 Benchmark]: RCFGBuilder took 996.64ms. Allocated memory is still 136.3MB. Free memory was 104.6MB in the beginning and 80.0MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-02 20:31:18,299 INFO L158 Benchmark]: TraceAbstraction took 67830.50ms. Allocated memory was 136.3MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 79.0MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2022-11-02 20:31:18,299 INFO L158 Benchmark]: Witness Printer took 92.61ms. Allocated memory is still 13.4GB. Free memory was 10.9GB in the beginning and 10.9GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:31:18,303 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.33ms. Allocated memory is still 136.3MB. Free memory was 114.3MB in the beginning and 114.2MB in the end (delta: 77.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.98ms. Allocated memory is still 136.3MB. Free memory was 97.5MB in the beginning and 109.2MB in the end (delta: -11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.82ms. Allocated memory is still 136.3MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.24ms. Allocated memory is still 136.3MB. Free memory was 106.7MB in the beginning and 104.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 996.64ms. Allocated memory is still 136.3MB. Free memory was 104.6MB in the beginning and 80.0MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 67830.50ms. Allocated memory was 136.3MB in the beginning and 13.4GB in the end (delta: 13.3GB). Free memory was 79.0MB in the beginning and 10.9GB in the end (delta: -10.8GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 92.61ms. Allocated memory is still 13.4GB. Free memory was 10.9GB in the beginning and 10.9GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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: 67.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 61.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 417 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2051 IncrementalHoareTripleChecker+Invalid, 2409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 358 mSolverCounterUnsat, 396 mSDtfsCounter, 2051 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.6s SatisfiabilityAnalysisTime, 4.9s 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-02 20:31:18,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ceeeef90-fbea-4699-ac01-e3daa448d6cb/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE