./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-lit/fkp2014.i --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_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/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_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-lit/fkp2014.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/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_e0308bc9-652f-4546-8aea-ef80343484d7/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 f24d9db33c7d5aecb89ac12017849974773f5d17a3292112bf25190c4dfae9f0 --- 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:27:52,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:27:52,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:27:52,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:27:52,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:27:52,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:27:52,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:27:52,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:27:52,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:27:52,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:27:52,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:27:52,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:27:52,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:27:52,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:27:52,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:27:52,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:27:52,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:27:52,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:27:52,538 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:27:52,547 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:27:52,551 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:27:52,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:27:52,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:27:52,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:27:52,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:27:52,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:27:52,557 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:27:52,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:27:52,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:27:52,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:27:52,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:27:52,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:27:52,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:27:52,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:27:52,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:27:52,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:27:52,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:27:52,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:27:52,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:27:52,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:27:52,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:27:52,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 20:27:52,603 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:27:52,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:27:52,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:27:52,604 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:27:52,605 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:27:52,605 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:27:52,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:27:52,606 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:27:52,606 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:27:52,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:27:52,607 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:27:52,608 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:27:52,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:27:52,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:27:52,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:27:52,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:27:52,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:27:52,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:27:52,609 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 20:27:52,609 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:27:52,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:27:52,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:27:52,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:27:52,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:27:52,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:27:52,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:27:52,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:27:52,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:27:52,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:27:52,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:27:52,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:27:52,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:27:52,614 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:27:52,614 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:27:52,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:27:52,615 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_e0308bc9-652f-4546-8aea-ef80343484d7/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_e0308bc9-652f-4546-8aea-ef80343484d7/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 -> f24d9db33c7d5aecb89ac12017849974773f5d17a3292112bf25190c4dfae9f0 [2022-11-02 20:27:52,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:27:52,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:27:52,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:27:52,989 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:27:52,989 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:27:52,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-lit/fkp2014.i [2022-11-02 20:27:53,063 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/data/f5c014c1a/4e2647d9286d42aab778ee44543e2d90/FLAG60b0c9f39 [2022-11-02 20:27:53,528 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:27:53,529 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/sv-benchmarks/c/pthread-lit/fkp2014.i [2022-11-02 20:27:53,544 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/data/f5c014c1a/4e2647d9286d42aab778ee44543e2d90/FLAG60b0c9f39 [2022-11-02 20:27:53,858 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/data/f5c014c1a/4e2647d9286d42aab778ee44543e2d90 [2022-11-02 20:27:53,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:27:53,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:27:53,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:27:53,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:27:53,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:27:53,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:27:53" (1/1) ... [2022-11-02 20:27:53,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628a4c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:53, skipping insertion in model container [2022-11-02 20:27:53,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:27:53" (1/1) ... [2022-11-02 20:27:53,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:27:53,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:27:54,241 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_e0308bc9-652f-4546-8aea-ef80343484d7/sv-benchmarks/c/pthread-lit/fkp2014.i[30003,30016] [2022-11-02 20:27:54,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:27:54,266 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:27:54,308 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_e0308bc9-652f-4546-8aea-ef80343484d7/sv-benchmarks/c/pthread-lit/fkp2014.i[30003,30016] [2022-11-02 20:27:54,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:27:54,346 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:27:54,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54 WrapperNode [2022-11-02 20:27:54,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:27:54,350 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:27:54,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:27:54,350 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:27:54,358 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:27:54" (1/1) ... [2022-11-02 20:27:54,389 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:27:54" (1/1) ... [2022-11-02 20:27:54,418 INFO L138 Inliner]: procedures = 173, calls = 19, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2022-11-02 20:27:54,419 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:27:54,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:27:54,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:27:54,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:27:54,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,463 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:27:54,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:27:54,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:27:54,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:27:54,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (1/1) ... [2022-11-02 20:27:54,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:27:54,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:27:54,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:27:54,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:27:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:27:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 20:27:54,565 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-11-02 20:27:54,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-11-02 20:27:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:27:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:27:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:27:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:27:54,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 20:27:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:27:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:27:54,568 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:27:54,753 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:27:54,755 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:27:54,939 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:27:54,991 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:27:54,991 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:27:54,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:54 BoogieIcfgContainer [2022-11-02 20:27:54,994 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:27:55,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:27:55,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:27:55,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:27:55,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:27:53" (1/3) ... [2022-11-02 20:27:55,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c52eeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:27:55, skipping insertion in model container [2022-11-02 20:27:55,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:27:54" (2/3) ... [2022-11-02 20:27:55,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c52eeee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:27:55, skipping insertion in model container [2022-11-02 20:27:55,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:54" (3/3) ... [2022-11-02 20:27:55,010 INFO L112 eAbstractionObserver]: Analyzing ICFG fkp2014.i [2022-11-02 20:27:55,026 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:27:55,039 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:27:55,040 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-02 20:27:55,040 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:27:55,095 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:27:55,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 84 transitions, 173 flow [2022-11-02 20:27:55,179 INFO L130 PetriNetUnfolder]: 4/96 cut-off events. [2022-11-02 20:27:55,179 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:27:55,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 96 events. 4/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 91 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2022-11-02 20:27:55,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 84 transitions, 173 flow [2022-11-02 20:27:55,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 84 transitions, 173 flow [2022-11-02 20:27:55,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:27:55,205 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;@558c9c7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:27:55,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-02 20:27:55,212 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-02 20:27:55,213 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:27:55,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:55,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:27:55,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:27:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 852446666, now seen corresponding path program 1 times [2022-11-02 20:27:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:55,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944110184] [2022-11-02 20:27:55,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:55,516 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:27:55,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:55,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944110184] [2022-11-02 20:27:55,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944110184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:55,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:55,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:55,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553793397] [2022-11-02 20:27:55,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:55,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:55,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:55,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:55,581 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 84 [2022-11-02 20:27:55,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 84 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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:27:55,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:55,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 84 [2022-11-02 20:27:55,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:55,662 INFO L130 PetriNetUnfolder]: 0/86 cut-off events. [2022-11-02 20:27:55,663 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 20:27:55,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 86 events. 0/86 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 0. Up to 10 conditions per place. [2022-11-02 20:27:55,665 INFO L137 encePairwiseOnDemand]: 74/84 looper letters, 9 selfloop transitions, 2 changer transitions 1/75 dead transitions. [2022-11-02 20:27:55,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 75 transitions, 177 flow [2022-11-02 20:27:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2022-11-02 20:27:55,679 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8373015873015873 [2022-11-02 20:27:55,680 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 211 transitions. [2022-11-02 20:27:55,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 211 transitions. [2022-11-02 20:27:55,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:55,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 211 transitions. [2022-11-02 20:27:55,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:27:55,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:27:55,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:27:55,693 INFO L175 Difference]: Start difference. First operand has 84 places, 84 transitions, 173 flow. Second operand 3 states and 211 transitions. [2022-11-02 20:27:55,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 75 transitions, 177 flow [2022-11-02 20:27:55,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 177 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:27:55,701 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 157 flow [2022-11-02 20:27:55,703 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2022-11-02 20:27:55,706 INFO L287 CegarLoopForPetriNet]: 84 programPoint places, -4 predicate places. [2022-11-02 20:27:55,707 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 157 flow [2022-11-02 20:27:55,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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:27:55,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:55,708 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] [2022-11-02 20:27:55,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:27:55,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:27:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash -899555129, now seen corresponding path program 1 times [2022-11-02 20:27:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:55,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595434590] [2022-11-02 20:27:55,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:55,801 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:27:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:55,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595434590] [2022-11-02 20:27:55,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595434590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:55,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:55,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942964494] [2022-11-02 20:27:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:55,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:55,806 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 84 [2022-11-02 20:27:55,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:27:55,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:55,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 84 [2022-11-02 20:27:55,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:55,843 INFO L130 PetriNetUnfolder]: 0/84 cut-off events. [2022-11-02 20:27:55,843 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:27:55,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 84 events. 0/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-11-02 20:27:55,844 INFO L137 encePairwiseOnDemand]: 81/84 looper letters, 5 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2022-11-02 20:27:55,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 169 flow [2022-11-02 20:27:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2022-11-02 20:27:55,847 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8293650793650794 [2022-11-02 20:27:55,847 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 209 transitions. [2022-11-02 20:27:55,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 209 transitions. [2022-11-02 20:27:55,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:55,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 209 transitions. [2022-11-02 20:27:55,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states 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:27:55,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:27:55,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:27:55,851 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 157 flow. Second operand 3 states and 209 transitions. [2022-11-02 20:27:55,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 169 flow [2022-11-02 20:27:55,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 73 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:27:55,854 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 155 flow [2022-11-02 20:27:55,855 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2022-11-02 20:27:55,856 INFO L287 CegarLoopForPetriNet]: 84 programPoint places, -6 predicate places. [2022-11-02 20:27:55,856 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 155 flow [2022-11-02 20:27:55,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:27:55,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:55,857 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] [2022-11-02 20:27:55,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:27:55,857 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:27:55,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:55,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1184043959, now seen corresponding path program 1 times [2022-11-02 20:27:55,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:55,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823383472] [2022-11-02 20:27:55,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:55,958 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:27:55,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:55,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823383472] [2022-11-02 20:27:55,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823383472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:55,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:55,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689490178] [2022-11-02 20:27:55,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:55,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:55,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:55,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:55,962 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 84 [2022-11-02 20:27:55,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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:27:55,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:55,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 84 [2022-11-02 20:27:55,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:56,024 INFO L130 PetriNetUnfolder]: 0/83 cut-off events. [2022-11-02 20:27:56,024 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:27:56,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 83 events. 0/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-11-02 20:27:56,025 INFO L137 encePairwiseOnDemand]: 82/84 looper letters, 4 selfloop transitions, 1 changer transitions 7/72 dead transitions. [2022-11-02 20:27:56,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 72 transitions, 163 flow [2022-11-02 20:27:56,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:56,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-11-02 20:27:56,027 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-11-02 20:27:56,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2022-11-02 20:27:56,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2022-11-02 20:27:56,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:56,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2022-11-02 20:27:56,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:27:56,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:27:56,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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:27:56,031 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 155 flow. Second operand 3 states and 216 transitions. [2022-11-02 20:27:56,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 72 transitions, 163 flow [2022-11-02 20:27:56,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 72 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:27:56,034 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 137 flow [2022-11-02 20:27:56,035 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2022-11-02 20:27:56,035 INFO L287 CegarLoopForPetriNet]: 84 programPoint places, -7 predicate places. [2022-11-02 20:27:56,036 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 137 flow [2022-11-02 20:27:56,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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:27:56,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:56,036 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:56,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:27:56,037 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 20:27:56,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:56,038 INFO L85 PathProgramCache]: Analyzing trace with hash -722871598, now seen corresponding path program 1 times [2022-11-02 20:27:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:56,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976256946] [2022-11-02 20:27:56,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:27:56,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:27:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:27:56,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:27:56,158 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:27:56,159 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2022-11-02 20:27:56,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-11-02 20:27:56,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-11-02 20:27:56,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-11-02 20:27:56,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-11-02 20:27:56,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-11-02 20:27:56,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-11-02 20:27:56,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2022-11-02 20:27:56,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-11-02 20:27:56,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-11-02 20:27:56,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-11-02 20:27:56,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-11-02 20:27:56,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-11-02 20:27:56,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-11-02 20:27:56,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:27:56,166 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-02 20:27:56,172 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:27:56,174 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-02 20:27:56,208 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:27:56,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 115 transitions, 242 flow [2022-11-02 20:27:56,241 INFO L130 PetriNetUnfolder]: 6/144 cut-off events. [2022-11-02 20:27:56,242 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:27:56,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 144 events. 6/144 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 246 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 97. Up to 6 conditions per place. [2022-11-02 20:27:56,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 115 transitions, 242 flow [2022-11-02 20:27:56,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 115 transitions, 242 flow [2022-11-02 20:27:56,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:27:56,248 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;@558c9c7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:27:56,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-11-02 20:27:56,253 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-11-02 20:27:56,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:27:56,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:56,254 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] [2022-11-02 20:27:56,255 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-02 20:27:56,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:56,255 INFO L85 PathProgramCache]: Analyzing trace with hash 198176381, now seen corresponding path program 1 times [2022-11-02 20:27:56,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:56,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235178972] [2022-11-02 20:27:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:56,313 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:27:56,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:56,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235178972] [2022-11-02 20:27:56,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235178972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:56,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:56,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:56,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729238877] [2022-11-02 20:27:56,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:56,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:56,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:56,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:56,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:56,335 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 115 [2022-11-02 20:27:56,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 115 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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:27:56,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:56,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 115 [2022-11-02 20:27:56,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:56,530 INFO L130 PetriNetUnfolder]: 30/310 cut-off events. [2022-11-02 20:27:56,530 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-02 20:27:56,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 413 conditions, 310 events. 30/310 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1298 event pairs, 30 based on Foata normal form. 52/319 useless extension candidates. Maximal degree in co-relation 281. Up to 76 conditions per place. [2022-11-02 20:27:56,538 INFO L137 encePairwiseOnDemand]: 100/115 looper letters, 15 selfloop transitions, 2 changer transitions 1/100 dead transitions. [2022-11-02 20:27:56,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 246 flow [2022-11-02 20:27:56,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:56,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2022-11-02 20:27:56,545 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.808695652173913 [2022-11-02 20:27:56,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2022-11-02 20:27:56,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2022-11-02 20:27:56,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:56,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2022-11-02 20:27:56,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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:27:56,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:27:56,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:27:56,553 INFO L175 Difference]: Start difference. First operand has 116 places, 115 transitions, 242 flow. Second operand 3 states and 279 transitions. [2022-11-02 20:27:56,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 246 flow [2022-11-02 20:27:56,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 244 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-02 20:27:56,560 INFO L231 Difference]: Finished difference. Result has 107 places, 99 transitions, 212 flow [2022-11-02 20:27:56,561 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=107, PETRI_TRANSITIONS=99} [2022-11-02 20:27:56,563 INFO L287 CegarLoopForPetriNet]: 116 programPoint places, -9 predicate places. [2022-11-02 20:27:56,563 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 99 transitions, 212 flow [2022-11-02 20:27:56,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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:27:56,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:56,564 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] [2022-11-02 20:27:56,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:27:56,565 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-02 20:27:56,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:56,566 INFO L85 PathProgramCache]: Analyzing trace with hash 795075591, now seen corresponding path program 1 times [2022-11-02 20:27:56,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:56,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389999409] [2022-11-02 20:27:56,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:56,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:56,618 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:27:56,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:56,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389999409] [2022-11-02 20:27:56,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389999409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:56,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:56,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:56,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264734760] [2022-11-02 20:27:56,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:56,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:56,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:56,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:56,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:56,623 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 115 [2022-11-02 20:27:56,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 99 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:27:56,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:56,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 115 [2022-11-02 20:27:56,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:56,711 INFO L130 PetriNetUnfolder]: 20/278 cut-off events. [2022-11-02 20:27:56,711 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-11-02 20:27:56,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 278 events. 20/278 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1011 event pairs, 8 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 330. Up to 30 conditions per place. [2022-11-02 20:27:56,715 INFO L137 encePairwiseOnDemand]: 107/115 looper letters, 17 selfloop transitions, 6 changer transitions 0/108 dead transitions. [2022-11-02 20:27:56,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 281 flow [2022-11-02 20:27:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2022-11-02 20:27:56,718 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8202898550724638 [2022-11-02 20:27:56,718 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2022-11-02 20:27:56,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2022-11-02 20:27:56,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:56,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2022-11-02 20:27:56,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states 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:27:56,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:27:56,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:27:56,723 INFO L175 Difference]: Start difference. First operand has 107 places, 99 transitions, 212 flow. Second operand 3 states and 283 transitions. [2022-11-02 20:27:56,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 281 flow [2022-11-02 20:27:56,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 108 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:27:56,730 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 260 flow [2022-11-02 20:27:56,730 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2022-11-02 20:27:56,734 INFO L287 CegarLoopForPetriNet]: 116 programPoint places, -8 predicate places. [2022-11-02 20:27:56,735 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 260 flow [2022-11-02 20:27:56,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:27:56,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:56,736 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] [2022-11-02 20:27:56,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:27:56,736 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-02 20:27:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash -436522583, now seen corresponding path program 1 times [2022-11-02 20:27:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:56,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329464177] [2022-11-02 20:27:56,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:56,829 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:27:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:56,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329464177] [2022-11-02 20:27:56,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329464177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:56,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:56,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853007669] [2022-11-02 20:27:56,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:56,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:56,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:56,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:56,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:56,833 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 115 [2022-11-02 20:27:56,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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:27:56,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:56,834 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 115 [2022-11-02 20:27:56,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:56,942 INFO L130 PetriNetUnfolder]: 36/432 cut-off events. [2022-11-02 20:27:56,943 INFO L131 PetriNetUnfolder]: For 92/96 co-relation queries the response was YES. [2022-11-02 20:27:56,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 432 events. 36/432 cut-off events. For 92/96 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2280 event pairs, 10 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 310. Up to 66 conditions per place. [2022-11-02 20:27:56,947 INFO L137 encePairwiseOnDemand]: 107/115 looper letters, 17 selfloop transitions, 6 changer transitions 0/114 dead transitions. [2022-11-02 20:27:56,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 114 transitions, 337 flow [2022-11-02 20:27:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2022-11-02 20:27:56,952 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8405797101449275 [2022-11-02 20:27:56,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2022-11-02 20:27:56,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2022-11-02 20:27:56,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:56,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2022-11-02 20:27:56,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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:27:56,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:27:56,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states 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:27:56,956 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 260 flow. Second operand 3 states and 290 transitions. [2022-11-02 20:27:56,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 114 transitions, 337 flow [2022-11-02 20:27:56,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 114 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:27:56,963 INFO L231 Difference]: Finished difference. Result has 110 places, 111 transitions, 300 flow [2022-11-02 20:27:56,964 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=110, PETRI_TRANSITIONS=111} [2022-11-02 20:27:56,965 INFO L287 CegarLoopForPetriNet]: 116 programPoint places, -6 predicate places. [2022-11-02 20:27:56,965 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 111 transitions, 300 flow [2022-11-02 20:27:56,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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:27:56,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:56,966 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:56,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:27:56,967 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2022-11-02 20:27:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1567598219, now seen corresponding path program 1 times [2022-11-02 20:27:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:56,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694202893] [2022-11-02 20:27:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:27:57,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:27:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:27:57,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:27:57,036 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:27:57,037 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2022-11-02 20:27:57,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2022-11-02 20:27:57,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2022-11-02 20:27:57,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2022-11-02 20:27:57,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2022-11-02 20:27:57,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2022-11-02 20:27:57,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2022-11-02 20:27:57,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2022-11-02 20:27:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2022-11-02 20:27:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2022-11-02 20:27:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2022-11-02 20:27:57,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2022-11-02 20:27:57,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2022-11-02 20:27:57,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2022-11-02 20:27:57,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2022-11-02 20:27:57,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2022-11-02 20:27:57,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2022-11-02 20:27:57,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2022-11-02 20:27:57,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2022-11-02 20:27:57,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2022-11-02 20:27:57,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:27:57,045 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-02 20:27:57,045 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 20:27:57,045 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-02 20:27:57,091 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 20:27:57,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 313 flow [2022-11-02 20:27:57,135 INFO L130 PetriNetUnfolder]: 8/192 cut-off events. [2022-11-02 20:27:57,135 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:27:57,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 192 events. 8/192 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 410 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 148. Up to 8 conditions per place. [2022-11-02 20:27:57,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 146 transitions, 313 flow [2022-11-02 20:27:57,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 146 transitions, 313 flow [2022-11-02 20:27:57,142 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:27:57,145 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;@558c9c7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:27:57,146 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-02 20:27:57,149 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-11-02 20:27:57,149 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:27:57,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:57,149 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] [2022-11-02 20:27:57,150 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-11-02 20:27:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:57,150 INFO L85 PathProgramCache]: Analyzing trace with hash 301226127, now seen corresponding path program 1 times [2022-11-02 20:27:57,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:57,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747886067] [2022-11-02 20:27:57,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:57,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:57,204 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:27:57,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:57,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747886067] [2022-11-02 20:27:57,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747886067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:57,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:57,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521678862] [2022-11-02 20:27:57,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:57,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:57,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:57,207 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 146 [2022-11-02 20:27:57,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 146 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states 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:27:57,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:57,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 146 [2022-11-02 20:27:57,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:57,578 INFO L130 PetriNetUnfolder]: 390/1782 cut-off events. [2022-11-02 20:27:57,578 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2022-11-02 20:27:57,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2607 conditions, 1782 events. 390/1782 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 14557 event pairs, 390 based on Foata normal form. 351/1824 useless extension candidates. Maximal degree in co-relation 1982. Up to 652 conditions per place. [2022-11-02 20:27:57,599 INFO L137 encePairwiseOnDemand]: 126/146 looper letters, 21 selfloop transitions, 2 changer transitions 1/125 dead transitions. [2022-11-02 20:27:57,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 125 transitions, 317 flow [2022-11-02 20:27:57,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:57,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-11-02 20:27:57,601 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7922374429223744 [2022-11-02 20:27:57,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-11-02 20:27:57,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-11-02 20:27:57,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:57,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-11-02 20:27:57,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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:27:57,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:27:57,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:27:57,605 INFO L175 Difference]: Start difference. First operand has 148 places, 146 transitions, 313 flow. Second operand 3 states and 347 transitions. [2022-11-02 20:27:57,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 125 transitions, 317 flow [2022-11-02 20:27:57,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 311 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-11-02 20:27:57,609 INFO L231 Difference]: Finished difference. Result has 134 places, 124 transitions, 267 flow [2022-11-02 20:27:57,609 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=134, PETRI_TRANSITIONS=124} [2022-11-02 20:27:57,610 INFO L287 CegarLoopForPetriNet]: 148 programPoint places, -14 predicate places. [2022-11-02 20:27:57,610 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 267 flow [2022-11-02 20:27:57,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states 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:27:57,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:57,611 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] [2022-11-02 20:27:57,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:27:57,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-11-02 20:27:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1321690421, now seen corresponding path program 1 times [2022-11-02 20:27:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762174366] [2022-11-02 20:27:57,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:57,644 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:27:57,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:57,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762174366] [2022-11-02 20:27:57,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762174366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:57,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:57,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271407343] [2022-11-02 20:27:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:57,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:57,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:57,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:57,647 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 146 [2022-11-02 20:27:57,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 267 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:27:57,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:57,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 146 [2022-11-02 20:27:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:58,009 INFO L130 PetriNetUnfolder]: 289/1716 cut-off events. [2022-11-02 20:27:58,009 INFO L131 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-11-02 20:27:58,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2374 conditions, 1716 events. 289/1716 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 13985 event pairs, 98 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 2342. Up to 301 conditions per place. [2022-11-02 20:27:58,029 INFO L137 encePairwiseOnDemand]: 134/146 looper letters, 25 selfloop transitions, 9 changer transitions 0/138 dead transitions. [2022-11-02 20:27:58,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 138 transitions, 373 flow [2022-11-02 20:27:58,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2022-11-02 20:27:58,031 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8036529680365296 [2022-11-02 20:27:58,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2022-11-02 20:27:58,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2022-11-02 20:27:58,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:58,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2022-11-02 20:27:58,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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:27:58,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:27:58,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:27:58,035 INFO L175 Difference]: Start difference. First operand has 134 places, 124 transitions, 267 flow. Second operand 3 states and 352 transitions. [2022-11-02 20:27:58,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 138 transitions, 373 flow [2022-11-02 20:27:58,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 138 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:27:58,039 INFO L231 Difference]: Finished difference. Result has 135 places, 133 transitions, 341 flow [2022-11-02 20:27:58,039 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=135, PETRI_TRANSITIONS=133} [2022-11-02 20:27:58,040 INFO L287 CegarLoopForPetriNet]: 148 programPoint places, -13 predicate places. [2022-11-02 20:27:58,040 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 133 transitions, 341 flow [2022-11-02 20:27:58,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states 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:27:58,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:58,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, 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:27:58,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:27:58,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-11-02 20:27:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:58,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1165841901, now seen corresponding path program 1 times [2022-11-02 20:27:58,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:58,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445410195] [2022-11-02 20:27:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:27:58,075 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:27:58,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:27:58,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445410195] [2022-11-02 20:27:58,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445410195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:27:58,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:27:58,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:27:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735109789] [2022-11-02 20:27:58,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:27:58,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:27:58,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:27:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:27:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:27:58,079 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 146 [2022-11-02 20:27:58,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 133 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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:27:58,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:27:58,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 146 [2022-11-02 20:27:58,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:27:58,887 INFO L130 PetriNetUnfolder]: 938/4402 cut-off events. [2022-11-02 20:27:58,887 INFO L131 PetriNetUnfolder]: For 1183/1272 co-relation queries the response was YES. [2022-11-02 20:27:58,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7540 conditions, 4402 events. 938/4402 cut-off events. For 1183/1272 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 46702 event pairs, 236 based on Foata normal form. 1/3941 useless extension candidates. Maximal degree in co-relation 7417. Up to 972 conditions per place. [2022-11-02 20:27:58,951 INFO L137 encePairwiseOnDemand]: 134/146 looper letters, 29 selfloop transitions, 9 changer transitions 0/150 dead transitions. [2022-11-02 20:27:58,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 150 transitions, 479 flow [2022-11-02 20:27:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:27:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:27:58,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2022-11-02 20:27:58,953 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.819634703196347 [2022-11-02 20:27:58,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2022-11-02 20:27:58,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2022-11-02 20:27:58,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:27:58,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2022-11-02 20:27:58,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states 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:27:58,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:27:58,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:27:58,957 INFO L175 Difference]: Start difference. First operand has 135 places, 133 transitions, 341 flow. Second operand 3 states and 359 transitions. [2022-11-02 20:27:58,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 150 transitions, 479 flow [2022-11-02 20:27:58,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 150 transitions, 455 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:27:58,968 INFO L231 Difference]: Finished difference. Result has 137 places, 142 transitions, 401 flow [2022-11-02 20:27:58,969 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=137, PETRI_TRANSITIONS=142} [2022-11-02 20:27:58,970 INFO L287 CegarLoopForPetriNet]: 148 programPoint places, -11 predicate places. [2022-11-02 20:27:58,970 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 142 transitions, 401 flow [2022-11-02 20:27:58,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states 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:27:58,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:27:58,971 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:58,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:27:58,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2022-11-02 20:27:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:27:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1121762039, now seen corresponding path program 1 times [2022-11-02 20:27:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:27:58,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431874838] [2022-11-02 20:27:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:27:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:27:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:27:58,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:27:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:27:59,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:27:59,036 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 20:27:59,036 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thrErr3ASSERT_VIOLATIONDATA_RACE (25 of 26 remaining) [2022-11-02 20:27:59,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 26 remaining) [2022-11-02 20:27:59,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 26 remaining) [2022-11-02 20:27:59,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (22 of 26 remaining) [2022-11-02 20:27:59,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (21 of 26 remaining) [2022-11-02 20:27:59,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (20 of 26 remaining) [2022-11-02 20:27:59,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (19 of 26 remaining) [2022-11-02 20:27:59,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (18 of 26 remaining) [2022-11-02 20:27:59,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (17 of 26 remaining) [2022-11-02 20:27:59,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (16 of 26 remaining) [2022-11-02 20:27:59,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (15 of 26 remaining) [2022-11-02 20:27:59,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (14 of 26 remaining) [2022-11-02 20:27:59,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (13 of 26 remaining) [2022-11-02 20:27:59,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (12 of 26 remaining) [2022-11-02 20:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (11 of 26 remaining) [2022-11-02 20:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (10 of 26 remaining) [2022-11-02 20:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (9 of 26 remaining) [2022-11-02 20:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (8 of 26 remaining) [2022-11-02 20:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (7 of 26 remaining) [2022-11-02 20:27:59,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (6 of 26 remaining) [2022-11-02 20:27:59,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (5 of 26 remaining) [2022-11-02 20:27:59,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 26 remaining) [2022-11-02 20:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (3 of 26 remaining) [2022-11-02 20:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr3ASSERT_VIOLATIONDATA_RACE (2 of 26 remaining) [2022-11-02 20:27:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr4ASSERT_VIOLATIONDATA_RACE (1 of 26 remaining) [2022-11-02 20:27:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr5ASSERT_VIOLATIONDATA_RACE (0 of 26 remaining) [2022-11-02 20:27:59,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:27:59,044 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-11-02 20:27:59,049 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-11-02 20:27:59,049 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 20:27:59,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:27:59 BasicIcfg [2022-11-02 20:27:59,170 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 20:27:59,170 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 20:27:59,170 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 20:27:59,171 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 20:27:59,171 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:27:54" (3/4) ... [2022-11-02 20:27:59,174 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 20:27:59,174 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 20:27:59,175 INFO L158 Benchmark]: Toolchain (without parser) took 5312.06ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 82.5MB in the beginning and 154.1MB in the end (delta: -71.5MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2022-11-02 20:27:59,175 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 123.7MB. Free memory was 101.0MB in the beginning and 101.0MB in the end (delta: 65.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:27:59,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.34ms. Allocated memory is still 123.7MB. Free memory was 82.4MB in the beginning and 88.0MB in the end (delta: -5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 20:27:59,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.10ms. Allocated memory is still 123.7MB. Free memory was 87.7MB in the beginning and 85.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:27:59,176 INFO L158 Benchmark]: Boogie Preprocessor took 51.42ms. Allocated memory is still 123.7MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 20:27:59,176 INFO L158 Benchmark]: RCFGBuilder took 522.20ms. Allocated memory is still 123.7MB. Free memory was 84.0MB in the beginning and 68.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-02 20:27:59,177 INFO L158 Benchmark]: TraceAbstraction took 4170.09ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 68.2MB in the beginning and 154.1MB in the end (delta: -85.9MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. [2022-11-02 20:27:59,177 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 218.1MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 20:27:59,179 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.27ms. Allocated memory is still 123.7MB. Free memory was 101.0MB in the beginning and 101.0MB in the end (delta: 65.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 483.34ms. Allocated memory is still 123.7MB. Free memory was 82.4MB in the beginning and 88.0MB in the end (delta: -5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.10ms. Allocated memory is still 123.7MB. Free memory was 87.7MB in the beginning and 85.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.42ms. Allocated memory is still 123.7MB. Free memory was 85.9MB in the beginning and 84.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.20ms. Allocated memory is still 123.7MB. Free memory was 84.0MB in the beginning and 68.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4170.09ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 68.2MB in the beginning and 154.1MB in the end (delta: -85.9MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 218.1MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 711]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int s; VAL [s=0] [L698] 0 volatile int t; VAL [s=0, t=0] [L716] 0 pthread_t t; VAL [s=0, t={3:0}, t=0] [L717] 0 int i, n; VAL [s=0, t=0, t={3:0}] [L718] 0 s = 0 VAL [s=0, t=0, t={3:0}] [L719] 0 n = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=2, n=2, s=0, t=0, t={3:0}] [L720] CALL 0 assume_abort_if_not(n > 0) [L686] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, s=0, t=0] [L720] RET 0 assume_abort_if_not(n > 0) [L721] 0 i = 0 VAL [i=0, n=2, s=0, t={3:0}, t=0] [L721] COND TRUE 0 i < n VAL [i=0, n=2, s=0, t=0, t={3:0}] [L722] FCALL, FORK 0 pthread_create(&t, 0, thr, 0) VAL [i=0, n=2, pthread_create(&t, 0, thr, 0)=-1, s=0, t={3:0}, t=0] [L721] 0 i++ VAL [i=1, n=2, s=0, t={3:0}, t=0] [L721] COND TRUE 0 i < n VAL [i=1, n=2, s=0, t=0, t={3:0}] [L722] FCALL, FORK 0 pthread_create(&t, 0, thr, 0) VAL [i=1, n=2, pthread_create(&t, 0, thr, 0)=0, s=0, t=0, t={3:0}] [L710] CALL 1 inct() [L701] 1 t++ VAL [s=0, t=1] [L710] RET 1 inct() [L711] 1 s < t VAL [arg={0:0}, arg={0:0}, s=0, t=1] [L710] CALL 2 inct() [L701] 2 t++ VAL [s=0, t=2] [L711] 1 s < t VAL [arg={0:0}, arg={0:0}, s=0, t=2] Now there is a data race on ~t~0 between C: t++ [701] and C: s < t [711] - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 112 locations, 14 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: 1.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 11 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=0, InterpolantAutomatonStates: 9, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 142 locations, 20 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: 0.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 24 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300occurred in iteration=3, InterpolantAutomatonStates: 9, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 172 locations, 26 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: 1.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 33 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=401occurred in iteration=3, InterpolantAutomatonStates: 9, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 20:27:59,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0308bc9-652f-4546-8aea-ef80343484d7/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE