./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/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_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/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_afe38d0a-bbdb-45ba-b712-68f78bd926c1/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 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 --- 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:37:47,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:37:47,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:37:47,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:37:47,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:37:47,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:37:47,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:37:47,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:37:47,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:37:47,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:37:47,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:37:47,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:37:47,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:37:47,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:37:47,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:37:47,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:37:47,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:37:47,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:37:47,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:37:47,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:37:47,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:37:47,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:37:47,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:37:47,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:37:47,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:37:47,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:37:47,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:37:47,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:37:47,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:37:47,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:37:47,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:37:47,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:37:47,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:37:47,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:37:47,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:37:47,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:37:47,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:37:47,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:37:47,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:37:47,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:37:47,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:37:47,678 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:37:47,724 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:37:47,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:37:47,726 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:37:47,726 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:37:47,727 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:37:47,727 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:37:47,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:37:47,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:37:47,729 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:37:47,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:37:47,731 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:37:47,731 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:37:47,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:37:47,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:37:47,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:37:47,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:37:47,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:37:47,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:37:47,733 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:37:47,733 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:37:47,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:37:47,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:37:47,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:37:47,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:37:47,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:37:47,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:37:47,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:37:47,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:37:47,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:37:47,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:37:47,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:37:47,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:37:47,737 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:37:47,738 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:37:47,738 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:37:47,738 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_afe38d0a-bbdb-45ba-b712-68f78bd926c1/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_afe38d0a-bbdb-45ba-b712-68f78bd926c1/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 -> 65bf47faf943da19c0d2d15e35f35ceed9dd68ed50ac4355a0589bd57bf3d155 [2022-11-02 20:37:48,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:37:48,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:37:48,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:37:48,115 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:37:48,116 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:37:48,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2022-11-02 20:37:48,190 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/data/a93467f11/94dabbb88b7743a8a6c5bc92f500814e/FLAG1500d6c88 [2022-11-02 20:37:48,728 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:37:48,731 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2022-11-02 20:37:48,741 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/data/a93467f11/94dabbb88b7743a8a6c5bc92f500814e/FLAG1500d6c88 [2022-11-02 20:37:49,035 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/data/a93467f11/94dabbb88b7743a8a6c5bc92f500814e [2022-11-02 20:37:49,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:37:49,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:37:49,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:37:49,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:37:49,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:37:49,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72bd7e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49, skipping insertion in model container [2022-11-02 20:37:49,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:37:49,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:37:49,430 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_afe38d0a-bbdb-45ba-b712-68f78bd926c1/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2022-11-02 20:37:49,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:37:49,443 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:37:49,478 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_afe38d0a-bbdb-45ba-b712-68f78bd926c1/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2022-11-02 20:37:49,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:37:49,505 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:37:49,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49 WrapperNode [2022-11-02 20:37:49,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:37:49,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:37:49,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:37:49,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:37:49,517 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:37:49" (1/1) ... [2022-11-02 20:37:49,544 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:37:49" (1/1) ... [2022-11-02 20:37:49,583 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-11-02 20:37:49,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:37:49,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:37:49,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:37:49,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:37:49,597 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,618 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,622 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:37:49,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:37:49,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:37:49,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:37:49,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (1/1) ... [2022-11-02 20:37:49,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:37:49,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:49,676 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:37:49,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:37:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:37:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-02 20:37:49,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-02 20:37:49,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-02 20:37:49,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-02 20:37:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-02 20:37:49,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-02 20:37:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-02 20:37:49,738 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-02 20:37:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:37:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:37:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:37:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:37:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:37:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:37:49,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:37:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:37:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:37:49,742 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:37:49,906 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:37:49,910 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:37:50,470 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:37:50,636 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:37:50,636 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:37:50,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:50 BoogieIcfgContainer [2022-11-02 20:37:50,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:37:50,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:37:50,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:37:50,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:37:50,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:37:49" (1/3) ... [2022-11-02 20:37:50,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecf5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:37:50, skipping insertion in model container [2022-11-02 20:37:50,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:49" (2/3) ... [2022-11-02 20:37:50,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ecf5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:37:50, skipping insertion in model container [2022-11-02 20:37:50,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:50" (3/3) ... [2022-11-02 20:37:50,653 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2022-11-02 20:37:50,665 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:37:50,678 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:37:50,678 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-02 20:37:50,678 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:37:50,784 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-11-02 20:37:50,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 180 transitions, 392 flow [2022-11-02 20:37:50,977 INFO L130 PetriNetUnfolder]: 9/176 cut-off events. [2022-11-02 20:37:50,978 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 20:37:50,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 176 events. 9/176 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 197 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-11-02 20:37:50,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 180 transitions, 392 flow [2022-11-02 20:37:51,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 154 transitions, 332 flow [2022-11-02 20:37:51,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:37:51,033 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;@ed776ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:37:51,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-11-02 20:37:51,040 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-11-02 20:37:51,040 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:37:51,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:51,041 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] [2022-11-02 20:37:51,042 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2022-11-02 20:37:51,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1355877263, now seen corresponding path program 1 times [2022-11-02 20:37:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:51,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612517578] [2022-11-02 20:37:51,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:51,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:51,281 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:37:51,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:51,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612517578] [2022-11-02 20:37:51,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612517578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:51,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:51,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:37:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205513444] [2022-11-02 20:37:51,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:37:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:51,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:37:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:37:51,349 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 180 [2022-11-02 20:37:51,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:51,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:37:51,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 180 [2022-11-02 20:37:51,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:37:52,865 INFO L130 PetriNetUnfolder]: 2736/5718 cut-off events. [2022-11-02 20:37:52,865 INFO L131 PetriNetUnfolder]: For 713/1142 co-relation queries the response was YES. [2022-11-02 20:37:52,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9865 conditions, 5718 events. 2736/5718 cut-off events. For 713/1142 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 46624 event pairs, 2064 based on Foata normal form. 0/4566 useless extension candidates. Maximal degree in co-relation 9484. Up to 3672 conditions per place. [2022-11-02 20:37:53,010 INFO L137 encePairwiseOnDemand]: 163/180 looper letters, 27 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2022-11-02 20:37:53,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 139 transitions, 360 flow [2022-11-02 20:37:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:37:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:37:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-11-02 20:37:53,042 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.825925925925926 [2022-11-02 20:37:53,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-11-02 20:37:53,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-11-02 20:37:53,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:37:53,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-11-02 20:37:53,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,072 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 332 flow. Second operand 3 states and 446 transitions. [2022-11-02 20:37:53,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 139 transitions, 360 flow [2022-11-02 20:37:53,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 344 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-11-02 20:37:53,092 INFO L231 Difference]: Finished difference. Result has 142 places, 139 transitions, 290 flow [2022-11-02 20:37:53,095 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=142, PETRI_TRANSITIONS=139} [2022-11-02 20:37:53,099 INFO L287 CegarLoopForPetriNet]: 159 programPoint places, -17 predicate places. [2022-11-02 20:37:53,100 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 139 transitions, 290 flow [2022-11-02 20:37:53,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:53,101 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:37:53,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:37:53,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2022-11-02 20:37:53,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:53,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1422098542, now seen corresponding path program 1 times [2022-11-02 20:37:53,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:53,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630949085] [2022-11-02 20:37:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:53,198 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:37:53,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:53,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630949085] [2022-11-02 20:37:53,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630949085] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:53,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:53,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:37:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150142708] [2022-11-02 20:37:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:53,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:37:53,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:37:53,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:37:53,205 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 180 [2022-11-02 20:37:53,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 139 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:37:53,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 180 [2022-11-02 20:37:53,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:37:53,775 INFO L130 PetriNetUnfolder]: 1225/3007 cut-off events. [2022-11-02 20:37:53,776 INFO L131 PetriNetUnfolder]: For 86/284 co-relation queries the response was YES. [2022-11-02 20:37:53,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 3007 events. 1225/3007 cut-off events. For 86/284 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 22745 event pairs, 747 based on Foata normal form. 0/2690 useless extension candidates. Maximal degree in co-relation 4710. Up to 1640 conditions per place. [2022-11-02 20:37:53,854 INFO L137 encePairwiseOnDemand]: 172/180 looper letters, 25 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2022-11-02 20:37:53,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 357 flow [2022-11-02 20:37:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:37:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:37:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2022-11-02 20:37:53,857 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2022-11-02 20:37:53,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2022-11-02 20:37:53,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2022-11-02 20:37:53,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:37:53,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2022-11-02 20:37:53,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,863 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,863 INFO L175 Difference]: Start difference. First operand has 142 places, 139 transitions, 290 flow. Second operand 3 states and 444 transitions. [2022-11-02 20:37:53,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 357 flow [2022-11-02 20:37:53,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 142 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:37:53,869 INFO L231 Difference]: Finished difference. Result has 139 places, 139 transitions, 306 flow [2022-11-02 20:37:53,870 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=139, PETRI_TRANSITIONS=139} [2022-11-02 20:37:53,871 INFO L287 CegarLoopForPetriNet]: 159 programPoint places, -20 predicate places. [2022-11-02 20:37:53,871 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 139 transitions, 306 flow [2022-11-02 20:37:53,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:53,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:53,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:53,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:37:53,873 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2022-11-02 20:37:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1257417651, now seen corresponding path program 1 times [2022-11-02 20:37:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:53,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263529602] [2022-11-02 20:37:53,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:53,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:54,600 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:37:54,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:54,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263529602] [2022-11-02 20:37:54,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263529602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:54,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:54,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:37:54,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788788515] [2022-11-02 20:37:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:54,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:37:54,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:54,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:37:54,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:37:54,605 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 180 [2022-11-02 20:37:54,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 139 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:54,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:37:54,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 180 [2022-11-02 20:37:54,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:37:54,843 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([553] L62-6-->L62-1: Formula: (= |v_#race~N~0_7| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_7|} AuxVars[] AssignedVars[#race~N~0][67], [Black: 191#true, 193#(= |#race~N~0| 0), 143#L90-4true, 76#L62-1true, 36#L51-1true, 196#true, 10#L41-1true]) [2022-11-02 20:37:54,843 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 20:37:54,843 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-11-02 20:37:54,844 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-11-02 20:37:54,844 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-11-02 20:37:54,960 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 61#thread3ENTRYtrue, 14#L91-4true, 36#L51-1true, 196#true, 10#L41-1true]) [2022-11-02 20:37:54,960 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:37:54,960 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:37:54,960 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:54,961 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:54,984 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 14#L91-4true, 175#thread2ENTRYtrue, 76#L62-1true, 196#true, 10#L41-1true]) [2022-11-02 20:37:54,984 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:37:54,984 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:54,985 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:54,985 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:37:55,004 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 85#thread1ENTRYtrue, 14#L91-4true, 76#L62-1true, 36#L51-1true, 196#true]) [2022-11-02 20:37:55,004 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:37:55,005 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:55,005 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:37:55,005 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:55,054 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 14#L91-4true, 76#L62-1true, 36#L51-1true, 196#true, 10#L41-1true]) [2022-11-02 20:37:55,054 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-02 20:37:55,055 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:37:55,055 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:37:55,055 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 20:37:55,413 INFO L130 PetriNetUnfolder]: 1335/2748 cut-off events. [2022-11-02 20:37:55,413 INFO L131 PetriNetUnfolder]: For 3/20 co-relation queries the response was YES. [2022-11-02 20:37:55,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4789 conditions, 2748 events. 1335/2748 cut-off events. For 3/20 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 19759 event pairs, 203 based on Foata normal form. 12/2418 useless extension candidates. Maximal degree in co-relation 3694. Up to 839 conditions per place. [2022-11-02 20:37:55,462 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 51 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2022-11-02 20:37:55,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 154 transitions, 446 flow [2022-11-02 20:37:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:37:55,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:37:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2022-11-02 20:37:55,467 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7296296296296296 [2022-11-02 20:37:55,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2022-11-02 20:37:55,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2022-11-02 20:37:55,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:37:55,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2022-11-02 20:37:55,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:55,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:55,477 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:55,477 INFO L175 Difference]: Start difference. First operand has 139 places, 139 transitions, 306 flow. Second operand 6 states and 788 transitions. [2022-11-02 20:37:55,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 154 transitions, 446 flow [2022-11-02 20:37:55,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 154 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:37:55,483 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 312 flow [2022-11-02 20:37:55,484 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2022-11-02 20:37:55,485 INFO L287 CegarLoopForPetriNet]: 159 programPoint places, -16 predicate places. [2022-11-02 20:37:55,485 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 312 flow [2022-11-02 20:37:55,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:55,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:55,487 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:37:55,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:37:55,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2022-11-02 20:37:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash 50500312, now seen corresponding path program 1 times [2022-11-02 20:37:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:55,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775798780] [2022-11-02 20:37:55,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:56,136 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:37:56,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:56,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775798780] [2022-11-02 20:37:56,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775798780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:56,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:56,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:37:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444586226] [2022-11-02 20:37:56,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:56,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:37:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:56,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:37:56,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:37:56,154 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 180 [2022-11-02 20:37:56,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:56,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:37:56,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 180 [2022-11-02 20:37:56,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:37:56,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][85], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 85#thread1ENTRYtrue, 14#L91-4true, 76#L62-1true, 36#L51-1true, 196#true, 203#true]) [2022-11-02 20:37:56,411 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:37:56,411 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:37:56,411 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:56,412 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:56,478 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][85], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 14#L91-4true, 76#L62-1true, 36#L51-1true, 196#true, 203#true, 10#L41-1true]) [2022-11-02 20:37:56,478 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-02 20:37:56,478 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 20:37:56,479 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:37:56,479 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:37:56,815 INFO L130 PetriNetUnfolder]: 1175/2481 cut-off events. [2022-11-02 20:37:56,815 INFO L131 PetriNetUnfolder]: For 78/84 co-relation queries the response was YES. [2022-11-02 20:37:56,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4503 conditions, 2481 events. 1175/2481 cut-off events. For 78/84 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17743 event pairs, 605 based on Foata normal form. 0/2109 useless extension candidates. Maximal degree in co-relation 3407. Up to 1143 conditions per place. [2022-11-02 20:37:56,850 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 46 selfloop transitions, 4 changer transitions 0/149 dead transitions. [2022-11-02 20:37:56,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 149 transitions, 434 flow [2022-11-02 20:37:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:37:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:37:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 783 transitions. [2022-11-02 20:37:56,853 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-11-02 20:37:56,854 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 783 transitions. [2022-11-02 20:37:56,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 783 transitions. [2022-11-02 20:37:56,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:37:56,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 783 transitions. [2022-11-02 20:37:56,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:56,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:56,862 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:56,863 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 312 flow. Second operand 6 states and 783 transitions. [2022-11-02 20:37:56,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 149 transitions, 434 flow [2022-11-02 20:37:56,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 149 transitions, 427 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:37:56,868 INFO L231 Difference]: Finished difference. Result has 143 places, 137 transitions, 311 flow [2022-11-02 20:37:56,868 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=311, PETRI_PLACES=143, PETRI_TRANSITIONS=137} [2022-11-02 20:37:56,871 INFO L287 CegarLoopForPetriNet]: 159 programPoint places, -16 predicate places. [2022-11-02 20:37:56,872 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 137 transitions, 311 flow [2022-11-02 20:37:56,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:56,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:56,873 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] [2022-11-02 20:37:56,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:37:56,874 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2022-11-02 20:37:56,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:56,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1832849658, now seen corresponding path program 1 times [2022-11-02 20:37:56,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:56,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408420017] [2022-11-02 20:37:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:56,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:57,473 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:37:57,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:57,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408420017] [2022-11-02 20:37:57,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408420017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:57,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:57,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:37:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706467432] [2022-11-02 20:37:57,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:57,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:37:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:57,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:37:57,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:37:57,478 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 180 [2022-11-02 20:37:57,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 137 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:57,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:37:57,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 180 [2022-11-02 20:37:57,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:37:58,022 INFO L130 PetriNetUnfolder]: 1031/2227 cut-off events. [2022-11-02 20:37:58,022 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-02 20:37:58,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 2227 events. 1031/2227 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15608 event pairs, 685 based on Foata normal form. 0/1901 useless extension candidates. Maximal degree in co-relation 3129. Up to 1270 conditions per place. [2022-11-02 20:37:58,056 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 41 selfloop transitions, 4 changer transitions 0/144 dead transitions. [2022-11-02 20:37:58,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 415 flow [2022-11-02 20:37:58,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:37:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:37:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions. [2022-11-02 20:37:58,060 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7203703703703703 [2022-11-02 20:37:58,060 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 778 transitions. [2022-11-02 20:37:58,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions. [2022-11-02 20:37:58,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:37:58,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions. [2022-11-02 20:37:58,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:58,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:58,068 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:58,068 INFO L175 Difference]: Start difference. First operand has 143 places, 137 transitions, 311 flow. Second operand 6 states and 778 transitions. [2022-11-02 20:37:58,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 415 flow [2022-11-02 20:37:58,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 144 transitions, 408 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:37:58,073 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 310 flow [2022-11-02 20:37:58,074 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2022-11-02 20:37:58,074 INFO L287 CegarLoopForPetriNet]: 159 programPoint places, -16 predicate places. [2022-11-02 20:37:58,075 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 310 flow [2022-11-02 20:37:58,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:58,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:58,076 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] [2022-11-02 20:37:58,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:37:58,076 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2022-11-02 20:37:58,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash -984771450, now seen corresponding path program 1 times [2022-11-02 20:37:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:58,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112129330] [2022-11-02 20:37:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:58,777 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:37:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:58,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112129330] [2022-11-02 20:37:58,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112129330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:58,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:58,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:37:58,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821323100] [2022-11-02 20:37:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:58,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:37:58,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:58,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:37:58,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:37:58,784 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 180 [2022-11-02 20:37:58,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:58,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:37:58,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 180 [2022-11-02 20:37:58,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:37:58,926 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([553] L62-6-->L62-1: Formula: (= |v_#race~N~0_7| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_7|} AuxVars[] AssignedVars[#race~N~0][67], [Black: 191#true, 193#(= |#race~N~0| 0), 143#L90-4true, 210#true, 76#L62-1true, 36#L51-1true, 217#true, 10#L41-1true]) [2022-11-02 20:37:58,926 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 20:37:58,926 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-11-02 20:37:58,926 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-11-02 20:37:58,926 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-11-02 20:37:59,367 INFO L130 PetriNetUnfolder]: 990/2109 cut-off events. [2022-11-02 20:37:59,367 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-02 20:37:59,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3756 conditions, 2109 events. 990/2109 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 14637 event pairs, 711 based on Foata normal form. 0/1818 useless extension candidates. Maximal degree in co-relation 3470. Up to 1318 conditions per place. [2022-11-02 20:37:59,410 INFO L137 encePairwiseOnDemand]: 175/180 looper letters, 36 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2022-11-02 20:37:59,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 139 transitions, 396 flow [2022-11-02 20:37:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:37:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-02 20:37:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2022-11-02 20:37:59,414 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7157407407407408 [2022-11-02 20:37:59,414 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2022-11-02 20:37:59,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2022-11-02 20:37:59,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:37:59,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2022-11-02 20:37:59,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,422 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,422 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 310 flow. Second operand 6 states and 773 transitions. [2022-11-02 20:37:59,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 139 transitions, 396 flow [2022-11-02 20:37:59,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 389 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:37:59,428 INFO L231 Difference]: Finished difference. Result has 143 places, 135 transitions, 309 flow [2022-11-02 20:37:59,428 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=143, PETRI_TRANSITIONS=135} [2022-11-02 20:37:59,433 INFO L287 CegarLoopForPetriNet]: 159 programPoint places, -16 predicate places. [2022-11-02 20:37:59,433 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 135 transitions, 309 flow [2022-11-02 20:37:59,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:59,434 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:37:59,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:37:59,436 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2022-11-02 20:37:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash -993765858, now seen corresponding path program 1 times [2022-11-02 20:37:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:59,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58114548] [2022-11-02 20:37:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:59,547 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:37:59,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:59,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58114548] [2022-11-02 20:37:59,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58114548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:59,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:59,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:37:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805600486] [2022-11-02 20:37:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:59,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:37:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:59,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:37:59,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:37:59,558 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180 [2022-11-02 20:37:59,559 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 135 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:37:59,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180 [2022-11-02 20:37:59,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:37:59,648 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([553] L62-6-->L62-1: Formula: (= |v_#race~N~0_7| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_7|} AuxVars[] AssignedVars[#race~N~0][67], [Black: 191#true, 193#(= |#race~N~0| 0), 143#L90-4true, 224#true, 76#L62-1true, 36#L51-1true, 217#true, 10#L41-1true]) [2022-11-02 20:37:59,648 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 20:37:59,649 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-11-02 20:37:59,649 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-11-02 20:37:59,649 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-11-02 20:37:59,694 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 61#thread3ENTRYtrue, 224#true, 14#L91-4true, 36#L51-1true, 217#true, 10#L41-1true]) [2022-11-02 20:37:59,695 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:37:59,695 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:37:59,695 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:59,695 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:59,696 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 224#true, 14#L91-4true, 175#thread2ENTRYtrue, 76#L62-1true, 217#true, 10#L41-1true]) [2022-11-02 20:37:59,697 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:37:59,697 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:37:59,697 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:59,697 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:59,702 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 85#thread1ENTRYtrue, 224#true, 14#L91-4true, 76#L62-1true, 36#L51-1true, 217#true]) [2022-11-02 20:37:59,702 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:37:59,702 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:37:59,702 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:59,703 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:37:59,711 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 224#true, 14#L91-4true, 76#L62-1true, 36#L51-1true, 217#true, 10#L41-1true]) [2022-11-02 20:37:59,711 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-02 20:37:59,711 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 20:37:59,711 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:37:59,712 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:37:59,785 INFO L130 PetriNetUnfolder]: 319/1137 cut-off events. [2022-11-02 20:37:59,786 INFO L131 PetriNetUnfolder]: For 37/60 co-relation queries the response was YES. [2022-11-02 20:37:59,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 1137 events. 319/1137 cut-off events. For 37/60 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7185 event pairs, 114 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 1627. Up to 247 conditions per place. [2022-11-02 20:37:59,802 INFO L137 encePairwiseOnDemand]: 178/180 looper letters, 13 selfloop transitions, 1 changer transitions 0/134 dead transitions. [2022-11-02 20:37:59,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 134 transitions, 335 flow [2022-11-02 20:37:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:37:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:37:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2022-11-02 20:37:59,804 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2022-11-02 20:37:59,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2022-11-02 20:37:59,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2022-11-02 20:37:59,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:37:59,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2022-11-02 20:37:59,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,810 INFO L175 Difference]: Start difference. First operand has 143 places, 135 transitions, 309 flow. Second operand 3 states and 462 transitions. [2022-11-02 20:37:59,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 134 transitions, 335 flow [2022-11-02 20:37:59,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 134 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-02 20:37:59,814 INFO L231 Difference]: Finished difference. Result has 140 places, 134 transitions, 302 flow [2022-11-02 20:37:59,814 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=140, PETRI_TRANSITIONS=134} [2022-11-02 20:37:59,815 INFO L287 CegarLoopForPetriNet]: 159 programPoint places, -19 predicate places. [2022-11-02 20:37:59,815 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 134 transitions, 302 flow [2022-11-02 20:37:59,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:37:59,816 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] [2022-11-02 20:37:59,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:37:59,817 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2022-11-02 20:37:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:59,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1133552364, now seen corresponding path program 1 times [2022-11-02 20:37:59,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:59,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984265414] [2022-11-02 20:37:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:59,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:59,898 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:37:59,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:59,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984265414] [2022-11-02 20:37:59,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984265414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:59,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:59,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:37:59,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032239839] [2022-11-02 20:37:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:59,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:37:59,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:59,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:37:59,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:37:59,902 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 180 [2022-11-02 20:37:59,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 134 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:59,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:37:59,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 180 [2022-11-02 20:37:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:37:59,973 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([553] L62-6-->L62-1: Formula: (= |v_#race~N~0_7| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_7|} AuxVars[] AssignedVars[#race~N~0][67], [Black: 191#true, 193#(= |#race~N~0| 0), 143#L90-4true, 224#true, 76#L62-1true, 36#L51-1true, 228#true, 10#L41-1true]) [2022-11-02 20:37:59,974 INFO L383 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2022-11-02 20:37:59,974 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-11-02 20:37:59,974 INFO L386 tUnfolder$Statistics]: existing Event has 48 ancestors and is cut-off event [2022-11-02 20:37:59,974 INFO L386 tUnfolder$Statistics]: existing Event has 55 ancestors and is cut-off event [2022-11-02 20:38:00,011 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 61#thread3ENTRYtrue, 224#true, 14#L91-4true, 36#L51-1true, 228#true, 10#L41-1true]) [2022-11-02 20:38:00,012 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:38:00,012 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:38:00,012 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:38:00,012 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:38:00,013 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 224#true, 14#L91-4true, 175#thread2ENTRYtrue, 76#L62-1true, 228#true, 10#L41-1true]) [2022-11-02 20:38:00,013 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:38:00,014 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:38:00,014 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:38:00,014 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:38:00,018 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 224#true, 85#thread1ENTRYtrue, 14#L91-4true, 76#L62-1true, 36#L51-1true, 228#true]) [2022-11-02 20:38:00,019 INFO L383 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-11-02 20:38:00,019 INFO L386 tUnfolder$Statistics]: existing Event has 54 ancestors and is cut-off event [2022-11-02 20:38:00,019 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:38:00,019 INFO L386 tUnfolder$Statistics]: existing Event has 61 ancestors and is cut-off event [2022-11-02 20:38:00,028 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([568] L72-6-->L72-1: Formula: (= |v_#race~N~0_10| 0) InVars {} OutVars{#race~N~0=|v_#race~N~0_10|} AuxVars[] AssignedVars[#race~N~0][86], [177#L72-1true, Black: 191#true, 193#(= |#race~N~0| 0), 224#true, 14#L91-4true, 76#L62-1true, 36#L51-1true, 228#true, 10#L41-1true]) [2022-11-02 20:38:00,028 INFO L383 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-11-02 20:38:00,028 INFO L386 tUnfolder$Statistics]: existing Event has 56 ancestors and is cut-off event [2022-11-02 20:38:00,028 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:38:00,029 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 20:38:00,095 INFO L130 PetriNetUnfolder]: 319/1136 cut-off events. [2022-11-02 20:38:00,095 INFO L131 PetriNetUnfolder]: For 37/60 co-relation queries the response was YES. [2022-11-02 20:38:00,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1651 conditions, 1136 events. 319/1136 cut-off events. For 37/60 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7188 event pairs, 114 based on Foata normal form. 1/981 useless extension candidates. Maximal degree in co-relation 1642. Up to 247 conditions per place. [2022-11-02 20:38:00,106 INFO L137 encePairwiseOnDemand]: 178/180 looper letters, 0 selfloop transitions, 0 changer transitions 133/133 dead transitions. [2022-11-02 20:38:00,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 133 transitions, 326 flow [2022-11-02 20:38:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:38:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:38:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2022-11-02 20:38:00,109 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8537037037037037 [2022-11-02 20:38:00,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2022-11-02 20:38:00,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2022-11-02 20:38:00,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:38:00,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2022-11-02 20:38:00,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:00,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:00,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:00,115 INFO L175 Difference]: Start difference. First operand has 140 places, 134 transitions, 302 flow. Second operand 3 states and 461 transitions. [2022-11-02 20:38:00,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 133 transitions, 326 flow [2022-11-02 20:38:00,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 133 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:38:00,118 INFO L231 Difference]: Finished difference. Result has 140 places, 0 transitions, 0 flow [2022-11-02 20:38:00,118 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=140, PETRI_TRANSITIONS=0} [2022-11-02 20:38:00,119 INFO L287 CegarLoopForPetriNet]: 159 programPoint places, -19 predicate places. [2022-11-02 20:38:00,119 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 0 transitions, 0 flow [2022-11-02 20:38:00,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:38:00,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (38 of 39 remaining) [2022-11-02 20:38:00,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (37 of 39 remaining) [2022-11-02 20:38:00,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (36 of 39 remaining) [2022-11-02 20:38:00,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 39 remaining) [2022-11-02 20:38:00,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 39 remaining) [2022-11-02 20:38:00,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 39 remaining) [2022-11-02 20:38:00,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 39 remaining) [2022-11-02 20:38:00,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (31 of 39 remaining) [2022-11-02 20:38:00,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (30 of 39 remaining) [2022-11-02 20:38:00,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (29 of 39 remaining) [2022-11-02 20:38:00,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 39 remaining) [2022-11-02 20:38:00,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 39 remaining) [2022-11-02 20:38:00,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 39 remaining) [2022-11-02 20:38:00,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (25 of 39 remaining) [2022-11-02 20:38:00,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 39 remaining) [2022-11-02 20:38:00,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 39 remaining) [2022-11-02 20:38:00,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (22 of 39 remaining) [2022-11-02 20:38:00,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 39 remaining) [2022-11-02 20:38:00,128 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 39 remaining) [2022-11-02 20:38:00,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 39 remaining) [2022-11-02 20:38:00,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 39 remaining) [2022-11-02 20:38:00,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (17 of 39 remaining) [2022-11-02 20:38:00,129 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (16 of 39 remaining) [2022-11-02 20:38:00,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (15 of 39 remaining) [2022-11-02 20:38:00,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (14 of 39 remaining) [2022-11-02 20:38:00,130 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 39 remaining) [2022-11-02 20:38:00,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (12 of 39 remaining) [2022-11-02 20:38:00,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (11 of 39 remaining) [2022-11-02 20:38:00,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 39 remaining) [2022-11-02 20:38:00,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 39 remaining) [2022-11-02 20:38:00,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 39 remaining) [2022-11-02 20:38:00,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 39 remaining) [2022-11-02 20:38:00,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (6 of 39 remaining) [2022-11-02 20:38:00,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (5 of 39 remaining) [2022-11-02 20:38:00,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (4 of 39 remaining) [2022-11-02 20:38:00,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (3 of 39 remaining) [2022-11-02 20:38:00,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (2 of 39 remaining) [2022-11-02 20:38:00,133 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (1 of 39 remaining) [2022-11-02 20:38:00,134 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (0 of 39 remaining) [2022-11-02 20:38:00,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:38:00,135 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:00,142 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 20:38:00,142 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:38:00,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:38:00 BasicIcfg [2022-11-02 20:38:00,148 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:38:00,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:38:00,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:38:00,149 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:38:00,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:50" (3/4) ... [2022-11-02 20:38:00,153 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-02 20:38:00,159 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-02 20:38:00,160 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-02 20:38:00,160 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2022-11-02 20:38:00,160 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2022-11-02 20:38:00,165 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2022-11-02 20:38:00,166 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-02 20:38:00,166 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-02 20:38:00,167 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-02 20:38:00,209 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/bin/uautomizer-Dbtcem3rbc/witness.graphml [2022-11-02 20:38:00,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:38:00,210 INFO L158 Benchmark]: Toolchain (without parser) took 11167.96ms. Allocated memory was 117.4MB in the beginning and 557.8MB in the end (delta: 440.4MB). Free memory was 79.4MB in the beginning and 164.1MB in the end (delta: -84.7MB). Peak memory consumption was 353.7MB. Max. memory is 16.1GB. [2022-11-02 20:38:00,210 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:38:00,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.17ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 91.4MB in the end (delta: -12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-02 20:38:00,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.86ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 89.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:38:00,212 INFO L158 Benchmark]: Boogie Preprocessor took 35.24ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 87.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:38:00,212 INFO L158 Benchmark]: RCFGBuilder took 1001.25ms. Allocated memory is still 117.4MB. Free memory was 87.5MB in the beginning and 60.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-02 20:38:00,213 INFO L158 Benchmark]: TraceAbstraction took 9505.99ms. Allocated memory was 117.4MB in the beginning and 557.8MB in the end (delta: 440.4MB). Free memory was 59.6MB in the beginning and 167.2MB in the end (delta: -107.6MB). Peak memory consumption was 335.5MB. Max. memory is 16.1GB. [2022-11-02 20:38:00,213 INFO L158 Benchmark]: Witness Printer took 60.09ms. Allocated memory is still 557.8MB. Free memory was 167.2MB in the beginning and 164.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:38:00,215 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.17ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 91.4MB in the end (delta: -12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.86ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 89.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.24ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 87.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1001.25ms. Allocated memory is still 117.4MB. Free memory was 87.5MB in the beginning and 60.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9505.99ms. Allocated memory was 117.4MB in the beginning and 557.8MB in the end (delta: 440.4MB). Free memory was 59.6MB in the beginning and 167.2MB in the end (delta: -107.6MB). Peak memory consumption was 335.5MB. Max. memory is 16.1GB. * Witness Printer took 60.09ms. Allocated memory is still 557.8MB. Free memory was 167.2MB in the beginning and 164.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 234 locations, 39 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: 9.3s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 535 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 78 mSDtfsCounter, 535 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=0, InterpolantAutomatonStates: 36, 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.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 575 ConstructedInterpolants, 0 QuantifiedInterpolants, 907 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-02 20:38:00,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_afe38d0a-bbdb-45ba-b712-68f78bd926c1/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