./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/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_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-15.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/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_20ede300-61a2-4b98-acde-9a84b30c9b4f/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 c250d04a54594f141e4a6230ba64a939d316d8b15028517201aca3da084476d7 --- 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 21:08:52,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:08:52,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:08:52,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:08:52,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:08:52,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:08:52,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:08:52,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:08:52,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:08:52,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:08:52,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:08:52,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:08:52,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:08:52,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:08:52,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:08:52,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:08:52,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:08:52,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:08:52,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:08:52,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:08:52,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:08:52,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:08:52,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:08:52,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:08:52,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:08:52,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:08:52,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:08:52,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:08:52,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:08:52,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:08:52,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:08:52,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:08:52,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:08:52,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:08:52,157 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:08:52,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:08:52,158 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:08:52,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:08:52,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:08:52,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:08:52,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:08:52,161 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 21:08:52,205 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:08:52,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:08:52,206 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:08:52,206 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:08:52,207 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:08:52,208 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:08:52,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:08:52,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:08:52,209 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:08:52,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:08:52,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:08:52,211 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:08:52,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:08:52,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:08:52,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:08:52,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:08:52,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:08:52,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:08:52,212 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 21:08:52,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:08:52,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:08:52,213 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:08:52,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:08:52,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:08:52,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:08:52,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:08:52,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:52,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:08:52,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:08:52,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:08:52,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:08:52,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:08:52,217 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:08:52,217 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:08:52,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:08:52,218 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_20ede300-61a2-4b98-acde-9a84b30c9b4f/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_20ede300-61a2-4b98-acde-9a84b30c9b4f/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 -> c250d04a54594f141e4a6230ba64a939d316d8b15028517201aca3da084476d7 [2022-11-02 21:08:52,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:08:52,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:08:52,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:08:52,568 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:08:52,568 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:08:52,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-deagle/airline-15.i [2022-11-02 21:08:52,646 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/data/75da25586/24e4aa9ba458416497be5e50fa1366aa/FLAGa12a1deee [2022-11-02 21:08:53,257 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:08:53,262 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/sv-benchmarks/c/pthread-deagle/airline-15.i [2022-11-02 21:08:53,274 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/data/75da25586/24e4aa9ba458416497be5e50fa1366aa/FLAGa12a1deee [2022-11-02 21:08:53,530 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/data/75da25586/24e4aa9ba458416497be5e50fa1366aa [2022-11-02 21:08:53,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:08:53,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:08:53,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:53,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:08:53,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:08:53,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:53" (1/1) ... [2022-11-02 21:08:53,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6064944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:53, skipping insertion in model container [2022-11-02 21:08:53,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:08:53" (1/1) ... [2022-11-02 21:08:53,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:08:53,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:08:54,002 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_20ede300-61a2-4b98-acde-9a84b30c9b4f/sv-benchmarks/c/pthread-deagle/airline-15.i[32101,32114] [2022-11-02 21:08:54,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:54,010 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:08:54,051 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_20ede300-61a2-4b98-acde-9a84b30c9b4f/sv-benchmarks/c/pthread-deagle/airline-15.i[32101,32114] [2022-11-02 21:08:54,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:08:54,082 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:08:54,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54 WrapperNode [2022-11-02 21:08:54,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:08:54,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:54,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:08:54,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:08:54,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,111 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,136 INFO L138 Inliner]: procedures = 162, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80 [2022-11-02 21:08:54,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:08:54,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:08:54,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:08:54,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:08:54,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,162 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:08:54,167 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:08:54,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:08:54,167 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:08:54,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (1/1) ... [2022-11-02 21:08:54,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:08:54,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:54,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:08:54,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:08:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:08:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:08:54,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:08:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:08:54,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:08:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2022-11-02 21:08:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2022-11-02 21:08:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:08:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:08:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:08:54,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:08:54,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:08:54,260 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 21:08:54,494 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:08:54,496 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:08:54,792 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:08:54,851 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:08:54,852 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 21:08:54,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:54 BoogieIcfgContainer [2022-11-02 21:08:54,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:08:54,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:08:54,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:08:54,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:08:54,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:08:53" (1/3) ... [2022-11-02 21:08:54,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f40f3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:08:54, skipping insertion in model container [2022-11-02 21:08:54,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:08:54" (2/3) ... [2022-11-02 21:08:54,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f40f3fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:08:54, skipping insertion in model container [2022-11-02 21:08:54,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:54" (3/3) ... [2022-11-02 21:08:54,870 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-15.i [2022-11-02 21:08:54,880 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:08:54,891 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:08:54,891 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-02 21:08:54,891 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:08:54,998 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-02 21:08:55,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 184 flow [2022-11-02 21:08:55,160 INFO L130 PetriNetUnfolder]: 9/119 cut-off events. [2022-11-02 21:08:55,161 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 21:08:55,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 119 events. 9/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 241 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 58. Up to 4 conditions per place. [2022-11-02 21:08:55,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 184 flow [2022-11-02 21:08:55,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 88 transitions, 184 flow [2022-11-02 21:08:55,181 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:08:55,188 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;@4d990fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:08:55,189 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-02 21:08:55,199 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-11-02 21:08:55,200 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:08:55,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:55,201 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 21:08:55,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 21:08:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1346301244, now seen corresponding path program 1 times [2022-11-02 21:08:55,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:55,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677362465] [2022-11-02 21:08:55,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:55,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:55,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677362465] [2022-11-02 21:08:55,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677362465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:55,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:55,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 21:08:55,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857558300] [2022-11-02 21:08:55,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:55,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:08:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:55,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:08:55,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:08:55,555 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 88 [2022-11-02 21:08:55,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 184 flow. Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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 21:08:55,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:55,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 88 [2022-11-02 21:08:55,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:55,625 INFO L130 PetriNetUnfolder]: 3/106 cut-off events. [2022-11-02 21:08:55,626 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-02 21:08:55,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 106 events. 3/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 6/98 useless extension candidates. Maximal degree in co-relation 50. Up to 8 conditions per place. [2022-11-02 21:08:55,628 INFO L137 encePairwiseOnDemand]: 80/88 looper letters, 7 selfloop transitions, 0 changer transitions 0/79 dead transitions. [2022-11-02 21:08:55,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 180 flow [2022-11-02 21:08:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:08:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:08:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 159 transitions. [2022-11-02 21:08:55,643 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9034090909090909 [2022-11-02 21:08:55,644 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 159 transitions. [2022-11-02 21:08:55,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 159 transitions. [2022-11-02 21:08:55,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:55,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 159 transitions. [2022-11-02 21:08:55,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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 21:08:55,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 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 21:08:55,669 INFO L81 ComplementDD]: Finished complementDD. Result 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 21:08:55,671 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 184 flow. Second operand 2 states and 159 transitions. [2022-11-02 21:08:55,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 180 flow [2022-11-02 21:08:55,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 79 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:08:55,692 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 166 flow [2022-11-02 21:08:55,695 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2022-11-02 21:08:55,698 INFO L287 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places. [2022-11-02 21:08:55,699 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 166 flow [2022-11-02 21:08:55,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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 21:08:55,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:55,700 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] [2022-11-02 21:08:55,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:08:55,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 21:08:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:55,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1828019146, now seen corresponding path program 1 times [2022-11-02 21:08:55,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:55,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509949816] [2022-11-02 21:08:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:55,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,862 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 21:08:55,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:55,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509949816] [2022-11-02 21:08:55,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509949816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:55,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:55,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:08:55,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112155190] [2022-11-02 21:08:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:55,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:55,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:55,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:55,867 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88 [2022-11-02 21:08:55,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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 21:08:55,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:55,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88 [2022-11-02 21:08:55,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:55,926 INFO L130 PetriNetUnfolder]: 12/148 cut-off events. [2022-11-02 21:08:55,926 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 21:08:55,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 148 events. 12/148 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 343 event pairs, 3 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 185. Up to 23 conditions per place. [2022-11-02 21:08:55,928 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 16 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2022-11-02 21:08:55,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 210 flow [2022-11-02 21:08:55,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:55,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-11-02 21:08:55,931 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606 [2022-11-02 21:08:55,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2022-11-02 21:08:55,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2022-11-02 21:08:55,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:55,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2022-11-02 21:08:55,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 21:08:55,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 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 21:08:55,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 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 21:08:55,934 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 166 flow. Second operand 3 states and 214 transitions. [2022-11-02 21:08:55,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 210 flow [2022-11-02 21:08:55,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:08:55,937 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 174 flow [2022-11-02 21:08:55,938 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2022-11-02 21:08:55,939 INFO L287 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-02 21:08:55,939 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 174 flow [2022-11-02 21:08:55,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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 21:08:55,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:55,939 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] [2022-11-02 21:08:55,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:08:55,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 21:08:55,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:55,941 INFO L85 PathProgramCache]: Analyzing trace with hash -311906661, now seen corresponding path program 1 times [2022-11-02 21:08:55,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:55,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944696678] [2022-11-02 21:08:55,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:55,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:55,989 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 21:08:55,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:55,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944696678] [2022-11-02 21:08:55,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944696678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:55,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:55,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122773915] [2022-11-02 21:08:55,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:55,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:55,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:55,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:55,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:55,993 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 88 [2022-11-02 21:08:55,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states 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 21:08:55,994 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:55,994 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 88 [2022-11-02 21:08:55,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:56,085 INFO L130 PetriNetUnfolder]: 1/131 cut-off events. [2022-11-02 21:08:56,085 INFO L131 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES. [2022-11-02 21:08:56,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 131 events. 1/131 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 229 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 150. Up to 7 conditions per place. [2022-11-02 21:08:56,086 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 8 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2022-11-02 21:08:56,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 197 flow [2022-11-02 21:08:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-11-02 21:08:56,094 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8257575757575758 [2022-11-02 21:08:56,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2022-11-02 21:08:56,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2022-11-02 21:08:56,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:56,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2022-11-02 21:08:56,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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 21:08:56,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 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 21:08:56,097 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 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 21:08:56,097 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 174 flow. Second operand 3 states and 218 transitions. [2022-11-02 21:08:56,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 197 flow [2022-11-02 21:08:56,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:08:56,100 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 172 flow [2022-11-02 21:08:56,100 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2022-11-02 21:08:56,101 INFO L287 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places. [2022-11-02 21:08:56,101 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 172 flow [2022-11-02 21:08:56,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states 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 21:08:56,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:56,102 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] [2022-11-02 21:08:56,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:08:56,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 21:08:56,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:56,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1996792538, now seen corresponding path program 1 times [2022-11-02 21:08:56,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:56,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700132853] [2022-11-02 21:08:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:56,186 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 21:08:56,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:56,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700132853] [2022-11-02 21:08:56,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700132853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:56,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:56,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30159359] [2022-11-02 21:08:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:56,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:56,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:56,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:56,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:56,196 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88 [2022-11-02 21:08:56,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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 21:08:56,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:56,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88 [2022-11-02 21:08:56,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:56,270 INFO L130 PetriNetUnfolder]: 7/188 cut-off events. [2022-11-02 21:08:56,270 INFO L131 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2022-11-02 21:08:56,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 188 events. 7/188 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 584 event pairs, 4 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 231. Up to 23 conditions per place. [2022-11-02 21:08:56,271 INFO L137 encePairwiseOnDemand]: 82/88 looper letters, 11 selfloop transitions, 3 changer transitions 11/81 dead transitions. [2022-11-02 21:08:56,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 213 flow [2022-11-02 21:08:56,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-11-02 21:08:56,273 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2022-11-02 21:08:56,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions. [2022-11-02 21:08:56,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions. [2022-11-02 21:08:56,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:56,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions. [2022-11-02 21:08:56,275 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 21:08:56,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 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 21:08:56,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 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 21:08:56,277 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 172 flow. Second operand 3 states and 216 transitions. [2022-11-02 21:08:56,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 213 flow [2022-11-02 21:08:56,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 81 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:08:56,280 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 168 flow [2022-11-02 21:08:56,280 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2022-11-02 21:08:56,281 INFO L287 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places. [2022-11-02 21:08:56,281 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 168 flow [2022-11-02 21:08:56,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states 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 21:08:56,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:56,282 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] [2022-11-02 21:08:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:08:56,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2022-11-02 21:08:56,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash 476877077, now seen corresponding path program 1 times [2022-11-02 21:08:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:56,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120438413] [2022-11-02 21:08:56,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:56,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:08:56,326 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:08:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:08:56,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:08:56,368 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:08:56,369 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2022-11-02 21:08:56,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2022-11-02 21:08:56,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2022-11-02 21:08:56,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2022-11-02 21:08:56,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2022-11-02 21:08:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining) [2022-11-02 21:08:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2022-11-02 21:08:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2022-11-02 21:08:56,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2022-11-02 21:08:56,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2022-11-02 21:08:56,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2022-11-02 21:08:56,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2022-11-02 21:08:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2022-11-02 21:08:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2022-11-02 21:08:56,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:08:56,376 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-11-02 21:08:56,378 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 21:08:56,379 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-11-02 21:08:56,397 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 21:08:56,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 234 flow [2022-11-02 21:08:56,426 INFO L130 PetriNetUnfolder]: 18/209 cut-off events. [2022-11-02 21:08:56,426 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 21:08:56,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 209 events. 18/209 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 522 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 121. Up to 8 conditions per place. [2022-11-02 21:08:56,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 234 flow [2022-11-02 21:08:56,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 108 transitions, 234 flow [2022-11-02 21:08:56,431 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:08:56,438 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;@4d990fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:08:56,439 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-11-02 21:08:56,442 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-02 21:08:56,442 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:08:56,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:56,442 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 21:08:56,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-02 21:08:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1695734104, now seen corresponding path program 1 times [2022-11-02 21:08:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:56,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822501679] [2022-11-02 21:08:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:56,489 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 21:08:56,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:56,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822501679] [2022-11-02 21:08:56,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822501679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:56,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:56,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 21:08:56,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140312264] [2022-11-02 21:08:56,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:56,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:08:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:56,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:08:56,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:08:56,494 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2022-11-02 21:08:56,495 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 108 transitions, 234 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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 21:08:56,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:56,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2022-11-02 21:08:56,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:56,540 INFO L130 PetriNetUnfolder]: 16/208 cut-off events. [2022-11-02 21:08:56,541 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES. [2022-11-02 21:08:56,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 208 events. 16/208 cut-off events. For 36/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 639 event pairs, 1 based on Foata normal form. 18/197 useless extension candidates. Maximal degree in co-relation 116. Up to 27 conditions per place. [2022-11-02 21:08:56,543 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 11 selfloop transitions, 0 changer transitions 0/97 dead transitions. [2022-11-02 21:08:56,543 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 234 flow [2022-11-02 21:08:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:08:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:08:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions. [2022-11-02 21:08:56,545 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2022-11-02 21:08:56,545 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions. [2022-11-02 21:08:56,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions. [2022-11-02 21:08:56,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:56,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions. [2022-11-02 21:08:56,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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 21:08:56,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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 21:08:56,568 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states 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 21:08:56,568 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 234 flow. Second operand 2 states and 193 transitions. [2022-11-02 21:08:56,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 234 flow [2022-11-02 21:08:56,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 97 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:08:56,572 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 212 flow [2022-11-02 21:08:56,572 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=212, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2022-11-02 21:08:56,573 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, -7 predicate places. [2022-11-02 21:08:56,573 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 212 flow [2022-11-02 21:08:56,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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 21:08:56,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:56,574 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] [2022-11-02 21:08:56,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:08:56,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-02 21:08:56,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash -708223178, now seen corresponding path program 1 times [2022-11-02 21:08:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:56,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498443122] [2022-11-02 21:08:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:56,627 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 21:08:56,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:56,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498443122] [2022-11-02 21:08:56,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498443122] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:56,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:56,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:08:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187821840] [2022-11-02 21:08:56,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:56,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:56,630 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108 [2022-11-02 21:08:56,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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 21:08:56,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:56,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108 [2022-11-02 21:08:56,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:56,758 INFO L130 PetriNetUnfolder]: 68/423 cut-off events. [2022-11-02 21:08:56,758 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-02 21:08:56,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 423 events. 68/423 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2057 event pairs, 9 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 562. Up to 103 conditions per place. [2022-11-02 21:08:56,765 INFO L137 encePairwiseOnDemand]: 105/108 looper letters, 22 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2022-11-02 21:08:56,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 272 flow [2022-11-02 21:08:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:56,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2022-11-02 21:08:56,767 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2022-11-02 21:08:56,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2022-11-02 21:08:56,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2022-11-02 21:08:56,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:56,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2022-11-02 21:08:56,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states 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 21:08:56,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:08:56,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:08:56,772 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 212 flow. Second operand 3 states and 262 transitions. [2022-11-02 21:08:56,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 272 flow [2022-11-02 21:08:56,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:08:56,777 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 224 flow [2022-11-02 21:08:56,778 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2022-11-02 21:08:56,780 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, -4 predicate places. [2022-11-02 21:08:56,780 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 224 flow [2022-11-02 21:08:56,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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 21:08:56,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:56,781 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] [2022-11-02 21:08:56,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:08:56,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-02 21:08:56,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash -441666231, now seen corresponding path program 1 times [2022-11-02 21:08:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:56,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110115857] [2022-11-02 21:08:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:56,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:56,833 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 21:08:56,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:56,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110115857] [2022-11-02 21:08:56,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110115857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:56,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:56,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211222752] [2022-11-02 21:08:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:56,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:56,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:56,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:56,836 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2022-11-02 21:08:56,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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 21:08:56,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:56,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2022-11-02 21:08:56,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:56,977 INFO L130 PetriNetUnfolder]: 52/631 cut-off events. [2022-11-02 21:08:56,978 INFO L131 PetriNetUnfolder]: For 111/313 co-relation queries the response was YES. [2022-11-02 21:08:56,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 631 events. 52/631 cut-off events. For 111/313 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3957 event pairs, 10 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 780. Up to 52 conditions per place. [2022-11-02 21:08:56,983 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 22 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2022-11-02 21:08:56,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 313 flow [2022-11-02 21:08:56,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2022-11-02 21:08:56,985 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-11-02 21:08:56,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions. [2022-11-02 21:08:56,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions. [2022-11-02 21:08:56,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:56,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions. [2022-11-02 21:08:56,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 21:08:56,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:08:56,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:08:56,988 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 224 flow. Second operand 3 states and 270 transitions. [2022-11-02 21:08:56,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 313 flow [2022-11-02 21:08:56,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:08:56,993 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 274 flow [2022-11-02 21:08:56,994 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2022-11-02 21:08:56,994 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places. [2022-11-02 21:08:56,995 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 274 flow [2022-11-02 21:08:56,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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 21:08:56,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:56,996 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] [2022-11-02 21:08:56,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:08:56,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-02 21:08:56,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:56,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2101498532, now seen corresponding path program 1 times [2022-11-02 21:08:56,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:56,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952206257] [2022-11-02 21:08:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:57,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:57,046 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 21:08:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:57,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952206257] [2022-11-02 21:08:57,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952206257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:57,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:57,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:57,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011085588] [2022-11-02 21:08:57,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:57,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:57,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:57,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:57,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:57,050 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108 [2022-11-02 21:08:57,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 21:08:57,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:57,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108 [2022-11-02 21:08:57,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:57,344 INFO L130 PetriNetUnfolder]: 266/1644 cut-off events. [2022-11-02 21:08:57,344 INFO L131 PetriNetUnfolder]: For 364/746 co-relation queries the response was YES. [2022-11-02 21:08:57,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 1644 events. 266/1644 cut-off events. For 364/746 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 13951 event pairs, 90 based on Foata normal form. 1/1399 useless extension candidates. Maximal degree in co-relation 2410. Up to 383 conditions per place. [2022-11-02 21:08:57,357 INFO L137 encePairwiseOnDemand]: 97/108 looper letters, 27 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2022-11-02 21:08:57,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 117 transitions, 389 flow [2022-11-02 21:08:57,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:57,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2022-11-02 21:08:57,359 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741 [2022-11-02 21:08:57,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2022-11-02 21:08:57,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2022-11-02 21:08:57,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:57,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2022-11-02 21:08:57,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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 21:08:57,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:08:57,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states 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 21:08:57,362 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 274 flow. Second operand 3 states and 267 transitions. [2022-11-02 21:08:57,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 117 transitions, 389 flow [2022-11-02 21:08:57,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 117 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:08:57,374 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 332 flow [2022-11-02 21:08:57,374 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=105, PETRI_TRANSITIONS=112} [2022-11-02 21:08:57,377 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2022-11-02 21:08:57,377 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 332 flow [2022-11-02 21:08:57,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 21:08:57,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:57,378 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] [2022-11-02 21:08:57,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:08:57,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-02 21:08:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash 210032464, now seen corresponding path program 1 times [2022-11-02 21:08:57,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:57,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82697729] [2022-11-02 21:08:57,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:57,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:57,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82697729] [2022-11-02 21:08:57,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82697729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:08:57,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410782876] [2022-11-02 21:08:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:57,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:08:57,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:08:57,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:08:57,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:08:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:57,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:08:57,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:08:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:57,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:08:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:08:57,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410782876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:08:57,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:08:57,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-02 21:08:57,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099757884] [2022-11-02 21:08:57,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:08:57,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:08:57,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:57,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:08:57,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:08:57,775 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2022-11-02 21:08:57,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 112 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states 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 21:08:57,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:57,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2022-11-02 21:08:57,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:57,974 INFO L130 PetriNetUnfolder]: 196/645 cut-off events. [2022-11-02 21:08:57,974 INFO L131 PetriNetUnfolder]: For 427/570 co-relation queries the response was YES. [2022-11-02 21:08:57,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 645 events. 196/645 cut-off events. For 427/570 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4577 event pairs, 5 based on Foata normal form. 47/623 useless extension candidates. Maximal degree in co-relation 1409. Up to 156 conditions per place. [2022-11-02 21:08:57,980 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 50 selfloop transitions, 7 changer transitions 0/117 dead transitions. [2022-11-02 21:08:57,981 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 512 flow [2022-11-02 21:08:57,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:08:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 21:08:57,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions. [2022-11-02 21:08:57,983 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7664609053497943 [2022-11-02 21:08:57,983 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions. [2022-11-02 21:08:57,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions. [2022-11-02 21:08:57,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:57,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions. [2022-11-02 21:08:57,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.77777777777777) internal successors, (745), 9 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:08:57,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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 21:08:57,989 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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 21:08:57,989 INFO L175 Difference]: Start difference. First operand has 105 places, 112 transitions, 332 flow. Second operand 9 states and 745 transitions. [2022-11-02 21:08:57,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 512 flow [2022-11-02 21:08:58,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-02 21:08:58,015 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 252 flow [2022-11-02 21:08:58,015 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=252, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2022-11-02 21:08:58,016 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places. [2022-11-02 21:08:58,016 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 252 flow [2022-11-02 21:08:58,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states 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 21:08:58,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:58,017 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] [2022-11-02 21:08:58,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:08:58,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 21:08:58,235 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2022-11-02 21:08:58,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:58,235 INFO L85 PathProgramCache]: Analyzing trace with hash 616978764, now seen corresponding path program 1 times [2022-11-02 21:08:58,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:58,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291888721] [2022-11-02 21:08:58,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:08:58,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:08:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:08:58,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:08:58,267 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:08:58,267 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2022-11-02 21:08:58,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining) [2022-11-02 21:08:58,267 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining) [2022-11-02 21:08:58,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining) [2022-11-02 21:08:58,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining) [2022-11-02 21:08:58,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining) [2022-11-02 21:08:58,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining) [2022-11-02 21:08:58,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining) [2022-11-02 21:08:58,268 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining) [2022-11-02 21:08:58,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining) [2022-11-02 21:08:58,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining) [2022-11-02 21:08:58,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining) [2022-11-02 21:08:58,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining) [2022-11-02 21:08:58,269 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining) [2022-11-02 21:08:58,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining) [2022-11-02 21:08:58,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining) [2022-11-02 21:08:58,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining) [2022-11-02 21:08:58,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining) [2022-11-02 21:08:58,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:08:58,270 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-11-02 21:08:58,271 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-11-02 21:08:58,271 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-11-02 21:08:58,289 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-02 21:08:58,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 128 transitions, 286 flow [2022-11-02 21:08:58,333 INFO L130 PetriNetUnfolder]: 34/360 cut-off events. [2022-11-02 21:08:58,333 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-11-02 21:08:58,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 360 events. 34/360 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1092 event pairs, 1 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 217. Up to 16 conditions per place. [2022-11-02 21:08:58,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 128 transitions, 286 flow [2022-11-02 21:08:58,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 128 transitions, 286 flow [2022-11-02 21:08:58,340 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:08:58,340 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;@4d990fdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:08:58,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-11-02 21:08:58,342 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-11-02 21:08:58,342 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:08:58,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:58,343 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 21:08:58,343 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-02 21:08:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash -369850584, now seen corresponding path program 1 times [2022-11-02 21:08:58,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:58,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992378822] [2022-11-02 21:08:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:58,356 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 21:08:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:58,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992378822] [2022-11-02 21:08:58,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992378822] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:58,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:58,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 21:08:58,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801893140] [2022-11-02 21:08:58,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:58,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:08:58,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:58,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:08:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:08:58,359 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 128 [2022-11-02 21:08:58,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 286 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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 21:08:58,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:58,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 128 [2022-11-02 21:08:58,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:58,441 INFO L130 PetriNetUnfolder]: 84/453 cut-off events. [2022-11-02 21:08:58,441 INFO L131 PetriNetUnfolder]: For 191/217 co-relation queries the response was YES. [2022-11-02 21:08:58,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 453 events. 84/453 cut-off events. For 191/217 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1954 event pairs, 19 based on Foata normal form. 57/450 useless extension candidates. Maximal degree in co-relation 317. Up to 115 conditions per place. [2022-11-02 21:08:58,447 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 15 selfloop transitions, 0 changer transitions 0/115 dead transitions. [2022-11-02 21:08:58,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 290 flow [2022-11-02 21:08:58,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:08:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:08:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 227 transitions. [2022-11-02 21:08:58,448 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.88671875 [2022-11-02 21:08:58,448 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 227 transitions. [2022-11-02 21:08:58,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 227 transitions. [2022-11-02 21:08:58,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:58,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 227 transitions. [2022-11-02 21:08:58,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states 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 21:08:58,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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 21:08:58,450 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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 21:08:58,451 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 286 flow. Second operand 2 states and 227 transitions. [2022-11-02 21:08:58,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 290 flow [2022-11-02 21:08:58,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 115 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:08:58,453 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 260 flow [2022-11-02 21:08:58,454 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=114, PETRI_TRANSITIONS=115} [2022-11-02 21:08:58,454 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -9 predicate places. [2022-11-02 21:08:58,455 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 260 flow [2022-11-02 21:08:58,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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 21:08:58,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:58,455 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] [2022-11-02 21:08:58,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:08:58,455 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-02 21:08:58,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:58,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1058045878, now seen corresponding path program 1 times [2022-11-02 21:08:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:58,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199558083] [2022-11-02 21:08:58,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:58,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:58,490 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 21:08:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:58,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199558083] [2022-11-02 21:08:58,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199558083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:58,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:58,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:08:58,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785697877] [2022-11-02 21:08:58,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:58,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:58,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:58,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:58,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:58,492 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-02 21:08:58,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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 21:08:58,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:58,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-02 21:08:58,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:58,710 INFO L130 PetriNetUnfolder]: 258/1209 cut-off events. [2022-11-02 21:08:58,710 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-11-02 21:08:58,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1209 events. 258/1209 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7883 event pairs, 58 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1666. Up to 347 conditions per place. [2022-11-02 21:08:58,722 INFO L137 encePairwiseOnDemand]: 125/128 looper letters, 26 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-11-02 21:08:58,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 328 flow [2022-11-02 21:08:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2022-11-02 21:08:58,724 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2022-11-02 21:08:58,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2022-11-02 21:08:58,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2022-11-02 21:08:58,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:58,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2022-11-02 21:08:58,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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 21:08:58,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 21:08:58,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 21:08:58,727 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 260 flow. Second operand 3 states and 308 transitions. [2022-11-02 21:08:58,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 328 flow [2022-11-02 21:08:58,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 21:08:58,730 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 272 flow [2022-11-02 21:08:58,730 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=117, PETRI_TRANSITIONS=116} [2022-11-02 21:08:58,731 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -6 predicate places. [2022-11-02 21:08:58,731 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 272 flow [2022-11-02 21:08:58,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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 21:08:58,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:58,731 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] [2022-11-02 21:08:58,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:08:58,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-02 21:08:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 836136859, now seen corresponding path program 1 times [2022-11-02 21:08:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:58,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804380855] [2022-11-02 21:08:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:58,758 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 21:08:58,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:58,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804380855] [2022-11-02 21:08:58,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804380855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:58,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:58,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319064071] [2022-11-02 21:08:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:58,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:58,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:58,761 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 128 [2022-11-02 21:08:58,761 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 116 transitions, 272 flow. Second operand has 3 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 21:08:58,761 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:58,761 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 128 [2022-11-02 21:08:58,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:08:59,374 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, 103#L721-2true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 129#true, 126#true]) [2022-11-02 21:08:59,375 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-02 21:08:59,375 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-11-02 21:08:59,375 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-11-02 21:08:59,375 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-02 21:08:59,376 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 134#true, salethreadThread3of3ForFork0NotInUse, 129#true, 97#L721-3true, 126#true]) [2022-11-02 21:08:59,376 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-02 21:08:59,376 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 21:08:59,376 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-02 21:08:59,376 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:08:59,377 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][116], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, salethreadThread3of3ForFork0NotInUse, 129#true, 87#L721-3true, 126#true]) [2022-11-02 21:08:59,377 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-02 21:08:59,377 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-02 21:08:59,377 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:08:59,378 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 21:08:59,424 INFO L130 PetriNetUnfolder]: 665/3818 cut-off events. [2022-11-02 21:08:59,424 INFO L131 PetriNetUnfolder]: For 1383/3760 co-relation queries the response was YES. [2022-11-02 21:08:59,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 3818 events. 665/3818 cut-off events. For 1383/3760 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 38091 event pairs, 121 based on Foata normal form. 1/3082 useless extension candidates. Maximal degree in co-relation 5198. Up to 489 conditions per place. [2022-11-02 21:08:59,461 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 32 selfloop transitions, 9 changer transitions 0/133 dead transitions. [2022-11-02 21:08:59,462 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 409 flow [2022-11-02 21:08:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:08:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:08:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2022-11-02 21:08:59,463 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8255208333333334 [2022-11-02 21:08:59,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2022-11-02 21:08:59,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2022-11-02 21:08:59,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:08:59,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2022-11-02 21:08:59,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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 21:08:59,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 21:08:59,466 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 21:08:59,466 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 272 flow. Second operand 3 states and 317 transitions. [2022-11-02 21:08:59,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 409 flow [2022-11-02 21:08:59,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 133 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:08:59,470 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 348 flow [2022-11-02 21:08:59,470 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=120, PETRI_TRANSITIONS=125} [2022-11-02 21:08:59,472 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places. [2022-11-02 21:08:59,472 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 348 flow [2022-11-02 21:08:59,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 21:08:59,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:08:59,473 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] [2022-11-02 21:08:59,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:08:59,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-02 21:08:59,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:08:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1456596170, now seen corresponding path program 1 times [2022-11-02 21:08:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:08:59,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12178969] [2022-11-02 21:08:59,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:08:59,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:08:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:08:59,498 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 21:08:59,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:08:59,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12178969] [2022-11-02 21:08:59,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12178969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:08:59,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:08:59,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:08:59,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703796105] [2022-11-02 21:08:59,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:08:59,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:08:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:08:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:08:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:08:59,501 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 128 [2022-11-02 21:08:59,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 125 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 21:08:59,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:08:59,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 128 [2022-11-02 21:08:59,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:01,291 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][81], [136#(= |#race~stopSales~0| 0), 65#salethreadENTRYtrue, 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-02 21:09:01,292 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-02 21:09:01,292 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 21:09:01,292 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-11-02 21:09:01,292 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 21:09:01,532 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 106#L722-1true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:01,532 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 21:09:01,532 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 21:09:01,533 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 21:09:01,533 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 21:09:01,533 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:01,533 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-02 21:09:01,534 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:09:01,534 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-02 21:09:01,534 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 21:09:01,535 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, 41#L722-1true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:01,535 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 21:09:01,535 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 21:09:01,535 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 21:09:01,535 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 21:09:01,536 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, 88#L722-2true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:01,536 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-02 21:09:01,536 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:09:01,536 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-02 21:09:01,537 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 21:09:01,573 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:01,573 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-02 21:09:01,573 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-02 21:09:01,573 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:09:01,574 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 21:09:01,681 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} OutVars{salethreadThread2of3ForFork0_thidvar0=v_salethreadThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_14|} AuxVars[] AssignedVars[][118], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 134#true, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 126#true, 87#L721-3true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:01,682 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-02 21:09:01,682 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event [2022-11-02 21:09:01,682 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 21:09:01,682 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-02 21:09:01,774 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), 106#L722-1true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:01,775 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event [2022-11-02 21:09:01,775 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-11-02 21:09:01,775 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-11-02 21:09:01,775 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 21:09:01,776 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-11-02 21:09:01,834 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([546] salethreadEXIT-->L750-7: Formula: (= v_salethreadThread1of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) InVars {salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} OutVars{salethreadThread1of3ForFork0_thidvar0=v_salethreadThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_12|} AuxVars[] AssignedVars[][82], [136#(= |#race~stopSales~0| 0), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:01,835 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event [2022-11-02 21:09:01,835 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event [2022-11-02 21:09:01,835 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2022-11-02 21:09:01,835 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-02 21:09:01,835 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2022-11-02 21:09:02,220 INFO L130 PetriNetUnfolder]: 4582/16344 cut-off events. [2022-11-02 21:09:02,220 INFO L131 PetriNetUnfolder]: For 6389/11730 co-relation queries the response was YES. [2022-11-02 21:09:02,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27111 conditions, 16344 events. 4582/16344 cut-off events. For 6389/11730 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 200428 event pairs, 1430 based on Foata normal form. 4/13948 useless extension candidates. Maximal degree in co-relation 27102. Up to 4998 conditions per place. [2022-11-02 21:09:02,392 INFO L137 encePairwiseOnDemand]: 113/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/147 dead transitions. [2022-11-02 21:09:02,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 535 flow [2022-11-02 21:09:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:09:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:09:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-11-02 21:09:02,394 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334 [2022-11-02 21:09:02,395 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-11-02 21:09:02,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-11-02 21:09:02,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:02,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-11-02 21:09:02,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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 21:09:02,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 21:09:02,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 21:09:02,398 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 348 flow. Second operand 3 states and 314 transitions. [2022-11-02 21:09:02,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 535 flow [2022-11-02 21:09:02,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 147 transitions, 511 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:09:02,472 INFO L231 Difference]: Finished difference. Result has 122 places, 136 transitions, 426 flow [2022-11-02 21:09:02,472 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=122, PETRI_TRANSITIONS=136} [2022-11-02 21:09:02,474 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places. [2022-11-02 21:09:02,474 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 426 flow [2022-11-02 21:09:02,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states 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 21:09:02,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:02,475 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] [2022-11-02 21:09:02,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:09:02,475 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-02 21:09:02,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:02,476 INFO L85 PathProgramCache]: Analyzing trace with hash -505216926, now seen corresponding path program 1 times [2022-11-02 21:09:02,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:02,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969504269] [2022-11-02 21:09:02,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:02,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:02,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:02,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969504269] [2022-11-02 21:09:02,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969504269] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:09:02,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093836764] [2022-11-02 21:09:02,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:02,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:09:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:09:02,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:09:02,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:09:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:02,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:09:02,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:09:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:02,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:09:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:09:02,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093836764] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:09:02,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:09:02,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-02 21:09:02,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832561139] [2022-11-02 21:09:02,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:09:02,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:09:02,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:02,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:09:02,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:09:02,799 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 128 [2022-11-02 21:09:02,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 136 transitions, 426 flow. Second operand has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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 21:09:02,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:02,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 128 [2022-11-02 21:09:02,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:03,706 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][90], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 136#(= |#race~stopSales~0| 0), 97#L721-3true, 87#L721-3true, 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 140#true, 101#L746-3true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:03,706 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-11-02 21:09:03,707 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 21:09:03,707 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 21:09:03,707 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-11-02 21:09:03,980 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][105], [59#L746-4true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 136#(= |#race~stopSales~0| 0), 97#L721-3true, 87#L721-3true, 146#true, Black: 140#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:03,980 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-11-02 21:09:03,980 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 21:09:03,980 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 21:09:03,981 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-11-02 21:09:04,120 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][105], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 136#(= |#race~stopSales~0| 0), 97#L721-3true, 87#L721-3true, 94#L746-5true, 146#true, Black: 140#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:04,120 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event [2022-11-02 21:09:04,120 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 21:09:04,121 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 21:09:04,121 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-11-02 21:09:04,358 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][105], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 136#(= |#race~stopSales~0| 0), 97#L721-3true, 87#L721-3true, 146#true, Black: 140#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0), 23#L746-6true]) [2022-11-02 21:09:04,358 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 21:09:04,359 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 21:09:04,359 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 21:09:04,359 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 21:09:04,359 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][90], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 136#(= |#race~stopSales~0| 0), 97#L721-3true, 87#L721-3true, 306#(< |ULTIMATE.start_main_~i~0#1| 15), 10#L747true, Black: 140#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:04,359 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-11-02 21:09:04,360 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 21:09:04,360 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 21:09:04,360 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-11-02 21:09:04,682 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][90], [Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 63#L747-3true, Black: 136#(= |#race~stopSales~0| 0), 97#L721-3true, 87#L721-3true, 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 140#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:04,682 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-11-02 21:09:04,682 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 21:09:04,682 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 21:09:04,683 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-11-02 21:09:05,314 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][105], [146#true, Black: 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 87#L721-3true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:05,314 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 21:09:05,314 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 21:09:05,314 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 21:09:05,314 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 21:09:05,314 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L728-->L721-3: Formula: (= (+ v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread2of3ForFork0_#t~nondet2=|v_salethreadThread2of3ForFork0_#t~nondet2_3|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread2of3ForFork0_#t~nondet2][106], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 97#L721-3true, 126#true, 87#L721-3true]) [2022-11-02 21:09:05,314 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 21:09:05,315 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 21:09:05,315 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 21:09:05,315 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 21:09:05,705 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L749-6-->L752: Formula: (= |v_#race~numberOfSeatsSold~0_10| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_10|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][135], [146#true, Black: 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0InUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 126#true, 87#L721-3true, 142#(= |#race~numberOfSeatsSold~0| 0), 55#L752true]) [2022-11-02 21:09:05,706 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-02 21:09:05,706 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-02 21:09:05,706 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-02 21:09:05,706 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-02 21:09:06,339 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([503] L724-->L721-3: Formula: (= v_~stopSales~0_20 1) InVars {} OutVars{salethreadThread2of3ForFork0_#t~nondet1=|v_salethreadThread2of3ForFork0_#t~nondet1_3|, ~stopSales~0=v_~stopSales~0_20, #race~stopSales~0=|v_#race~stopSales~0_24|} AuxVars[] AssignedVars[~stopSales~0, #race~stopSales~0, salethreadThread2of3ForFork0_#t~nondet1][105], [146#true, Black: 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 136#(= |#race~stopSales~0| 0), salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)]) [2022-11-02 21:09:06,339 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-02 21:09:06,340 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:06,340 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:06,340 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-02 21:09:06,340 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([505] L728-->L721-3: Formula: (= (+ v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, salethreadThread2of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread2of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread2of3ForFork0_#t~nondet2=|v_salethreadThread2of3ForFork0_#t~nondet2_3|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread2of3ForFork0_#t~nondet2][106], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 140#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, Black: 134#true, salethreadThread3of3ForFork0NotInUse, 97#L721-3true, 126#true]) [2022-11-02 21:09:06,341 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-02 21:09:06,341 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:06,341 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:06,341 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-02 21:09:06,410 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([448] L749-6-->L752: Formula: (= |v_#race~numberOfSeatsSold~0_10| 0) InVars {} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_10|} AuxVars[] AssignedVars[#race~numberOfSeatsSold~0][135], [Black: 140#true, 146#true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), salethreadThread1of3ForFork0NotInUse, 102#L722-2true, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0), 55#L752true]) [2022-11-02 21:09:06,410 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event [2022-11-02 21:09:06,410 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-11-02 21:09:06,410 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-02 21:09:06,410 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event [2022-11-02 21:09:06,511 INFO L130 PetriNetUnfolder]: 6212/24965 cut-off events. [2022-11-02 21:09:06,511 INFO L131 PetriNetUnfolder]: For 10982/13799 co-relation queries the response was YES. [2022-11-02 21:09:06,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43953 conditions, 24965 events. 6212/24965 cut-off events. For 10982/13799 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 336156 event pairs, 1518 based on Foata normal form. 194/21140 useless extension candidates. Maximal degree in co-relation 43943. Up to 3635 conditions per place. [2022-11-02 21:09:06,718 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 73 selfloop transitions, 9 changer transitions 0/188 dead transitions. [2022-11-02 21:09:06,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 188 transitions, 804 flow [2022-11-02 21:09:06,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:09:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 21:09:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions. [2022-11-02 21:09:06,721 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2022-11-02 21:09:06,721 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions. [2022-11-02 21:09:06,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions. [2022-11-02 21:09:06,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:06,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions. [2022-11-02 21:09:06,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.66666666666667) internal successors, (888), 9 states have internal predecessors, (888), 0 states have call successors, (0), 0 states 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 21:09:06,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states 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 21:09:06,727 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 128.0) internal successors, (1280), 10 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states 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 21:09:06,728 INFO L175 Difference]: Start difference. First operand has 122 places, 136 transitions, 426 flow. Second operand 9 states and 888 transitions. [2022-11-02 21:09:06,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 188 transitions, 804 flow [2022-11-02 21:09:06,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 188 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 21:09:06,810 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 454 flow [2022-11-02 21:09:06,811 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=454, PETRI_PLACES=131, PETRI_TRANSITIONS=142} [2022-11-02 21:09:06,811 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places. [2022-11-02 21:09:06,812 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 454 flow [2022-11-02 21:09:06,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 0 states have call successors, (0), 0 states 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 21:09:06,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:06,813 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] [2022-11-02 21:09:06,852 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:09:07,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 21:09:07,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-02 21:09:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1053784385, now seen corresponding path program 1 times [2022-11-02 21:09:07,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:07,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142410702] [2022-11-02 21:09:07,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:07,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:09:07,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:07,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142410702] [2022-11-02 21:09:07,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142410702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:07,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:07,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779038137] [2022-11-02 21:09:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:07,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:07,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:07,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:07,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:07,334 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-02 21:09:07,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 454 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 21:09:07,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:07,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-02 21:09:07,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:09,558 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L728-->L721-3: Formula: (= (+ v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14, salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread1of3ForFork0_#t~nondet2=|v_salethreadThread1of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread1of3ForFork0_#t~nondet2][45], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 87#L721-3true, 5#L722-2true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-02 21:09:09,558 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-02 21:09:09,558 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-02 21:09:09,558 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 21:09:09,559 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-11-02 21:09:09,559 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L728-->L721-3: Formula: (= (+ v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7 1) v_~numberOfSeatsSold~0_14) InVars {salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7} OutVars{#race~numberOfSeatsSold~0=|v_#race~numberOfSeatsSold~0_25|, ~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_14, salethreadThread1of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread1of3ForFork0_~_numberOfSeatsSold~0_7, salethreadThread1of3ForFork0_#t~nondet2=|v_salethreadThread1of3ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[~numberOfSeatsSold~0, #race~numberOfSeatsSold~0, salethreadThread1of3ForFork0_#t~nondet2][45], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, 76#L722-1true, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-02 21:09:09,559 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-02 21:09:09,559 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-02 21:09:09,559 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 21:09:09,559 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-11-02 21:09:09,565 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] L722-2-->L723: Formula: (= v_salethreadThread3of3ForFork0_~_numberOfSeatsSold~0_1 v_~numberOfSeatsSold~0_1) InVars {~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_1} OutVars{~numberOfSeatsSold~0=v_~numberOfSeatsSold~0_1, salethreadThread3of3ForFork0_~_numberOfSeatsSold~0=v_salethreadThread3of3ForFork0_~_numberOfSeatsSold~0_1} AuxVars[] AssignedVars[salethreadThread3of3ForFork0_~_numberOfSeatsSold~0][136], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 20#L728true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 140#true, 146#true, 39#L723true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0InUse, 126#true]) [2022-11-02 21:09:09,565 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event [2022-11-02 21:09:09,565 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-02 21:09:09,566 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event [2022-11-02 21:09:09,566 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event [2022-11-02 21:09:09,727 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 97#L721-3true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-02 21:09:09,728 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-11-02 21:09:09,728 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 21:09:09,728 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-11-02 21:09:09,728 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-02 21:09:10,849 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 87#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-02 21:09:10,849 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-11-02 21:09:10,849 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:10,849 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:10,849 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:10,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][175], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), 20#L728true, Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 140#true, 146#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-02 21:09:10,866 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-11-02 21:09:10,866 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-02 21:09:10,866 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 21:09:10,867 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-11-02 21:09:10,934 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 134#true, 97#L721-3true, 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-02 21:09:10,934 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-02 21:09:10,934 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event [2022-11-02 21:09:10,934 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:10,934 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:11,626 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][177], [146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), salethreadThread3of3ForFork0NotInUse, Black: 134#true, 126#true]) [2022-11-02 21:09:11,626 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-02 21:09:11,626 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-02 21:09:11,627 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 21:09:11,627 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-02 21:09:11,711 INFO L130 PetriNetUnfolder]: 7626/31979 cut-off events. [2022-11-02 21:09:11,711 INFO L131 PetriNetUnfolder]: For 7994/14839 co-relation queries the response was YES. [2022-11-02 21:09:11,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51791 conditions, 31979 events. 7626/31979 cut-off events. For 7994/14839 co-relation queries the response was YES. Maximal size of possible extension queue 1395. Compared 455861 event pairs, 2221 based on Foata normal form. 112/27121 useless extension candidates. Maximal degree in co-relation 51779. Up to 4756 conditions per place. [2022-11-02 21:09:11,934 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 69 selfloop transitions, 7 changer transitions 0/190 dead transitions. [2022-11-02 21:09:11,934 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 190 transitions, 803 flow [2022-11-02 21:09:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2022-11-02 21:09:11,936 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.825 [2022-11-02 21:09:11,936 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2022-11-02 21:09:11,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2022-11-02 21:09:11,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:11,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2022-11-02 21:09:11,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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 21:09:11,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:11,940 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:11,940 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 454 flow. Second operand 5 states and 528 transitions. [2022-11-02 21:09:11,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 190 transitions, 803 flow [2022-11-02 21:09:11,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 190 transitions, 797 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-02 21:09:11,949 INFO L231 Difference]: Finished difference. Result has 137 places, 148 transitions, 511 flow [2022-11-02 21:09:11,949 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=511, PETRI_PLACES=137, PETRI_TRANSITIONS=148} [2022-11-02 21:09:11,950 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 14 predicate places. [2022-11-02 21:09:11,951 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 148 transitions, 511 flow [2022-11-02 21:09:11,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 21:09:11,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:11,951 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] [2022-11-02 21:09:11,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:09:11,952 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-02 21:09:11,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash -213244023, now seen corresponding path program 1 times [2022-11-02 21:09:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:11,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189447994] [2022-11-02 21:09:11,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:09:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 21:09:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:09:12,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189447994] [2022-11-02 21:09:12,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189447994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:09:12,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:09:12,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:09:12,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988040908] [2022-11-02 21:09:12,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:09:12,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:09:12,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:09:12,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:09:12,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:09:12,040 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128 [2022-11-02 21:09:12,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 148 transitions, 511 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 21:09:12,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:09:12,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128 [2022-11-02 21:09:12,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:09:15,145 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][172], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), 97#L721-3true, Black: 422#(= ~numberOfSeatsSold~0 0), 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 420#true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0InUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-02 21:09:15,145 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-11-02 21:09:15,145 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event [2022-11-02 21:09:15,146 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-02 21:09:15,146 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-11-02 21:09:16,014 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([548] salethreadEXIT-->L750-7: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem10#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_salethreadThread3of3ForFork0_thidvar0_4) InVars {salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} OutVars{salethreadThread3of3ForFork0_thidvar0=v_salethreadThread3of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_16|} AuxVars[] AssignedVars[][172], [Black: 306#(< |ULTIMATE.start_main_~i~0#1| 15), 433#(= salethreadThread2of3ForFork0_~_numberOfSeatsSold~0 0), Black: 150#(<= |ULTIMATE.start_main_~i~0#1| 1), Black: 131#(= |ULTIMATE.start_main_~i~0#1| 0), 32#L750-7true, Black: 425#(and (= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0) (= ~numberOfSeatsSold~0 0)), Black: 134#true, Black: 423#(= salethreadThread1of3ForFork0_~_numberOfSeatsSold~0 0), Black: 422#(= ~numberOfSeatsSold~0 0), 146#true, Black: 142#(= |#race~numberOfSeatsSold~0| 0), 420#true, salethreadThread1of3ForFork0NotInUse, salethreadThread2of3ForFork0NotInUse, salethreadThread3of3ForFork0NotInUse, 126#true]) [2022-11-02 21:09:16,015 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-02 21:09:16,015 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-02 21:09:16,015 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 21:09:16,015 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-02 21:09:16,112 INFO L130 PetriNetUnfolder]: 7497/33062 cut-off events. [2022-11-02 21:09:16,113 INFO L131 PetriNetUnfolder]: For 16020/21828 co-relation queries the response was YES. [2022-11-02 21:09:16,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57999 conditions, 33062 events. 7497/33062 cut-off events. For 16020/21828 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 479444 event pairs, 2288 based on Foata normal form. 209/28489 useless extension candidates. Maximal degree in co-relation 57983. Up to 4780 conditions per place. [2022-11-02 21:09:16,350 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 62 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2022-11-02 21:09:16,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 186 transitions, 838 flow [2022-11-02 21:09:16,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 21:09:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-02 21:09:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-11-02 21:09:16,352 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8203125 [2022-11-02 21:09:16,353 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-11-02 21:09:16,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-11-02 21:09:16,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:09:16,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-11-02 21:09:16,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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 21:09:16,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:16,356 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 21:09:16,357 INFO L175 Difference]: Start difference. First operand has 137 places, 148 transitions, 511 flow. Second operand 5 states and 525 transitions. [2022-11-02 21:09:16,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 186 transitions, 838 flow [2022-11-02 21:09:16,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 186 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 21:09:16,384 INFO L231 Difference]: Finished difference. Result has 143 places, 152 transitions, 574 flow [2022-11-02 21:09:16,384 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=143, PETRI_TRANSITIONS=152} [2022-11-02 21:09:16,385 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 20 predicate places. [2022-11-02 21:09:16,385 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 574 flow [2022-11-02 21:09:16,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 21:09:16,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:09:16,386 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] [2022-11-02 21:09:16,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:09:16,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2022-11-02 21:09:16,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:09:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1287448103, now seen corresponding path program 1 times [2022-11-02 21:09:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:09:16,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666215381] [2022-11-02 21:09:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:09:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:09:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:09:16,398 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:09:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:09:16,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:09:16,416 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:09:16,416 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2022-11-02 21:09:16,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2022-11-02 21:09:16,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2022-11-02 21:09:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2022-11-02 21:09:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2022-11-02 21:09:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2022-11-02 21:09:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2022-11-02 21:09:16,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2022-11-02 21:09:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2022-11-02 21:09:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2022-11-02 21:09:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining) [2022-11-02 21:09:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2022-11-02 21:09:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2022-11-02 21:09:16,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2022-11-02 21:09:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2022-11-02 21:09:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2022-11-02 21:09:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2022-11-02 21:09:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2022-11-02 21:09:16,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2022-11-02 21:09:16,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2022-11-02 21:09:16,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2022-11-02 21:09:16,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2022-11-02 21:09:16,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:09:16,420 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:09:16,426 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2022-11-02 21:09:16,426 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:09:16,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:09:16 BasicIcfg [2022-11-02 21:09:16,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:09:16,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:09:16,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:09:16,512 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:09:16,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:08:54" (3/4) ... [2022-11-02 21:09:16,515 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 21:09:16,515 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:09:16,516 INFO L158 Benchmark]: Toolchain (without parser) took 22981.53ms. Allocated memory was 98.6MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 63.7MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 941.1MB. Max. memory is 16.1GB. [2022-11-02 21:09:16,517 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 98.6MB. Free memory was 71.9MB in the beginning and 71.9MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:09:16,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.09ms. Allocated memory is still 98.6MB. Free memory was 63.6MB in the beginning and 65.3MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 21:09:16,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.46ms. Allocated memory is still 98.6MB. Free memory was 65.3MB in the beginning and 63.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:09:16,518 INFO L158 Benchmark]: Boogie Preprocessor took 29.64ms. Allocated memory is still 98.6MB. Free memory was 63.2MB in the beginning and 61.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:09:16,518 INFO L158 Benchmark]: RCFGBuilder took 692.63ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 45.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-02 21:09:16,519 INFO L158 Benchmark]: TraceAbstraction took 21648.75ms. Allocated memory was 98.6MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 44.4MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 924.8MB. Max. memory is 16.1GB. [2022-11-02 21:09:16,519 INFO L158 Benchmark]: Witness Printer took 4.13ms. Allocated memory is still 6.6GB. Free memory is still 5.6GB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:09:16,522 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.30ms. Allocated memory is still 98.6MB. Free memory was 71.9MB in the beginning and 71.9MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.09ms. Allocated memory is still 98.6MB. Free memory was 63.6MB in the beginning and 65.3MB in the end (delta: -1.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.46ms. Allocated memory is still 98.6MB. Free memory was 65.3MB in the beginning and 63.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.64ms. Allocated memory is still 98.6MB. Free memory was 63.2MB in the beginning and 61.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 692.63ms. Allocated memory is still 98.6MB. Free memory was 61.6MB in the beginning and 45.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21648.75ms. Allocated memory was 98.6MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 44.4MB in the beginning and 5.6GB in the end (delta: -5.6GB). Peak memory consumption was 924.8MB. Max. memory is 16.1GB. * Witness Printer took 4.13ms. Allocated memory is still 6.6GB. Free memory is still 5.6GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numberOfSeatsSold=0, numOfTickets=0, stopSales=0] [L736] 0 pthread_t salethreads[15]; VAL [\old(argc)=61, argc=61, argv={62:63}, argv={62:63}, numberOfSeatsSold=0, numOfTickets=0, salethreads={3:0}, stopSales=0] [L738] 0 numOfTickets = 15 VAL [\old(argc)=61, argc=61, argv={62:63}, argv={62:63}, numberOfSeatsSold=0, numOfTickets=15, salethreads={3:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=61, argc=61, argv={62:63}, argv={62:63}, numberOfSeatsSold=0, numOfTickets=15, salethreads={3:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=61, argc=61, argv={62:63}, argv={62:63}, numberOfSeatsSold=0, numOfTickets=15, salethreads={3:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=61, argc=61, argv={62:63}, argv={62:63}, i=0, numberOfSeatsSold=0, numOfTickets=15, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 15 VAL [\old(argc)=61, argc=61, argv={62:63}, argv={62:63}, i=0, numberOfSeatsSold=0, numOfTickets=15, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=61, arg={0:0}, argc=61, argv={62:63}, argv={62:63}, i=0, numberOfSeatsSold=0, numOfTickets=15, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=-1, salethreads={3:0}, stopSales=0] [L746] 0 i++ VAL [\old(argc)=61, arg={0:0}, argc=61, argv={62:63}, argv={62:63}, i=1, numberOfSeatsSold=0, numOfTickets=15, salethreads={3:0}, stopSales=0] [L746] COND TRUE 0 i < 15 VAL [\old(argc)=61, arg={0:0}, argc=61, argv={62:63}, argv={62:63}, i=1, numberOfSeatsSold=0, numOfTickets=15, salethreads={3:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=61, arg={0:0}, argc=61, argv={62:63}, argv={62:63}, i=1, numberOfSeatsSold=0, numOfTickets=15, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=0, salethreads={3:0}, stopSales=0] [L721] 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=15, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=15, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=15, stopSales=0] [L721] 2 !stopSales VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=15, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=15, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=15, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (15 - (((15 / 10) == 0) ? 1 : (15 / 10)))) VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=15, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=15, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=15, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 100 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.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 9 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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, 117 locations, 18 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: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 207 IncrementalHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 21 mSDtfsCounter, 207 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=4, InterpolantAutomatonStates: 20, 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.4s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 311 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/3 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, 134 locations, 22 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: 18.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 33 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=7, InterpolantAutomatonStates: 30, 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.6s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 339 ConstructedInterpolants, 0 QuantifiedInterpolants, 519 SizeOfPredicates, 2 NumberOfNonLiveVariables, 111 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10/13 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 21:09:16,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20ede300-61a2-4b98-acde-9a84b30c9b4f/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