./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-deagle/airline-10.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for data races
Using default analysis
Version 5e519f3a
Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/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_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-deagle/airline-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/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_14593205-eccc-44a1-8844-53558d4d5b68/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 8e894693d2d051395e42cf40effac907db7b5be7a8f5722374b3e5b36cc0228a
--- Real Ultimate output ---
[0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset.
This is Ultimate 0.2.2-dev-5e519f3
[2022-11-02 20:04:24,809 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-11-02 20:04:24,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-11-02 20:04:24,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-11-02 20:04:24,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-11-02 20:04:24,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-11-02 20:04:24,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-11-02 20:04:24,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-11-02 20:04:24,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-11-02 20:04:24,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-11-02 20:04:24,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-11-02 20:04:24,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-11-02 20:04:24,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-11-02 20:04:24,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-11-02 20:04:24,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-11-02 20:04:24,875 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-11-02 20:04:24,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-11-02 20:04:24,877 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-11-02 20:04:24,879 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-11-02 20:04:24,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-11-02 20:04:24,884 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-11-02 20:04:24,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-11-02 20:04:24,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-11-02 20:04:24,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-11-02 20:04:24,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-11-02 20:04:24,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-11-02 20:04:24,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-11-02 20:04:24,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-11-02 20:04:24,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-11-02 20:04:24,916 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-11-02 20:04:24,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-11-02 20:04:24,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-11-02 20:04:24,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-11-02 20:04:24,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-11-02 20:04:24,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-11-02 20:04:24,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-11-02 20:04:24,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-11-02 20:04:24,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-11-02 20:04:24,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-11-02 20:04:24,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-11-02 20:04:24,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-11-02 20:04:24,931 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2022-11-02 20:04:24,975 INFO L113 SettingsManager]: Loading preferences was successful
[2022-11-02 20:04:24,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-11-02 20:04:24,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-11-02 20:04:24,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-11-02 20:04:24,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2022-11-02 20:04:24,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2022-11-02 20:04:24,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-11-02 20:04:24,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2022-11-02 20:04:24,978 INFO L138 SettingsManager]: * Use SBE=true
[2022-11-02 20:04:24,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-11-02 20:04:24,979 INFO L138 SettingsManager]: * sizeof long=4
[2022-11-02 20:04:24,979 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2022-11-02 20:04:24,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-11-02 20:04:24,979 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-11-02 20:04:24,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-11-02 20:04:24,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-11-02 20:04:24,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-11-02 20:04:24,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-11-02 20:04:24,980 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true
[2022-11-02 20:04:24,981 INFO L138 SettingsManager]: * sizeof long double=12
[2022-11-02 20:04:24,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-11-02 20:04:24,981 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-11-02 20:04:24,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-11-02 20:04:24,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-11-02 20:04:24,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-11-02 20:04:24,986 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-11-02 20:04:24,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:04:24,988 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-11-02 20:04:24,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2022-11-02 20:04:24,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2022-11-02 20:04:24,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2022-11-02 20:04:24,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2022-11-02 20:04:24,990 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2022-11-02 20:04:24,990 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2022-11-02 20:04:24,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-11-02 20:04:24,991 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_14593205-eccc-44a1-8844-53558d4d5b68/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_14593205-eccc-44a1-8844-53558d4d5b68/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 -> 8e894693d2d051395e42cf40effac907db7b5be7a8f5722374b3e5b36cc0228a
[2022-11-02 20:04:25,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-11-02 20:04:25,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-11-02 20:04:25,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-11-02 20:04:25,311 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-11-02 20:04:25,312 INFO L275 PluginConnector]: CDTParser initialized
[2022-11-02 20:04:25,314 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread-deagle/airline-10.i
[2022-11-02 20:04:25,419 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/data/8dffaedeb/7fa41432a69e4af0a324457c7a999973/FLAGa0e62e862
[2022-11-02 20:04:26,129 INFO L306 CDTParser]: Found 1 translation units.
[2022-11-02 20:04:26,129 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/sv-benchmarks/c/pthread-deagle/airline-10.i
[2022-11-02 20:04:26,171 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/data/8dffaedeb/7fa41432a69e4af0a324457c7a999973/FLAGa0e62e862
[2022-11-02 20:04:26,358 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/data/8dffaedeb/7fa41432a69e4af0a324457c7a999973
[2022-11-02 20:04:26,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-11-02 20:04:26,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2022-11-02 20:04:26,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-11-02 20:04:26,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-11-02 20:04:26,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-11-02 20:04:26,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:04:26" (1/1) ...
[2022-11-02 20:04:26,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c1306c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:26, skipping insertion in model container
[2022-11-02 20:04:26,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:04:26" (1/1) ...
[2022-11-02 20:04:26,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-11-02 20:04:26,429 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-11-02 20:04:26,861 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_14593205-eccc-44a1-8844-53558d4d5b68/sv-benchmarks/c/pthread-deagle/airline-10.i[32101,32114]
[2022-11-02 20:04:26,863 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:04:26,872 INFO L203 MainTranslator]: Completed pre-run
[2022-11-02 20:04:26,952 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_14593205-eccc-44a1-8844-53558d4d5b68/sv-benchmarks/c/pthread-deagle/airline-10.i[32101,32114]
[2022-11-02 20:04:26,968 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-11-02 20:04:27,020 INFO L208 MainTranslator]: Completed translation
[2022-11-02 20:04:27,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27 WrapperNode
[2022-11-02 20:04:27,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-11-02 20:04:27,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-11-02 20:04:27,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-11-02 20:04:27,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2022-11-02 20:04:27,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,059 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,096 INFO L138 Inliner]: procedures = 162, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 80
[2022-11-02 20:04:27,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-11-02 20:04:27,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-11-02 20:04:27,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-11-02 20:04:27,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-11-02 20:04:27,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,152 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-11-02 20:04:27,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-11-02 20:04:27,159 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-11-02 20:04:27,159 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-11-02 20:04:27,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (1/1) ...
[2022-11-02 20:04:27,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-11-02 20:04:27,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:04:27,207 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-11-02 20:04:27,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-11-02 20:04:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-11-02 20:04:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-11-02 20:04:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2022-11-02 20:04:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-11-02 20:04:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2022-11-02 20:04:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure salethread
[2022-11-02 20:04:27,273 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread
[2022-11-02 20:04:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-11-02 20:04:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-11-02 20:04:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2022-11-02 20:04:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-11-02 20:04:27,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-11-02 20:04:27,277 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2022-11-02 20:04:27,523 INFO L235 CfgBuilder]: Building ICFG
[2022-11-02 20:04:27,541 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-11-02 20:04:27,879 INFO L276 CfgBuilder]: Performing block encoding
[2022-11-02 20:04:27,926 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-11-02 20:04:27,926 INFO L300 CfgBuilder]: Removed 2 assume(true) statements.
[2022-11-02 20:04:27,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:27 BoogieIcfgContainer
[2022-11-02 20:04:27,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-11-02 20:04:27,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-11-02 20:04:27,934 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-11-02 20:04:27,938 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-11-02 20:04:27,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:04:26" (1/3) ...
[2022-11-02 20:04:27,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209307ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:04:27, skipping insertion in model container
[2022-11-02 20:04:27,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:04:27" (2/3) ...
[2022-11-02 20:04:27,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209307ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:04:27, skipping insertion in model container
[2022-11-02 20:04:27,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:27" (3/3) ...
[2022-11-02 20:04:27,943 INFO L112 eAbstractionObserver]: Analyzing ICFG airline-10.i
[2022-11-02 20:04:27,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2022-11-02 20:04:27,968 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2022-11-02 20:04:27,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2022-11-02 20:04:27,969 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2022-11-02 20:04:28,049 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2022-11-02 20:04:28,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 88 transitions, 184 flow
[2022-11-02 20:04:28,221 INFO L130 PetriNetUnfolder]: 9/119 cut-off events.
[2022-11-02 20:04:28,242 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2022-11-02 20:04:28,250 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 20:04:28,250 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 88 transitions, 184 flow
[2022-11-02 20:04:28,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 88 transitions, 184 flow
[2022-11-02 20:04:28,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:04:28,302 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;@77bf3b4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:04:28,303 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations.
[2022-11-02 20:04:28,310 INFO L130 PetriNetUnfolder]: 0/21 cut-off events.
[2022-11-02 20:04:28,310 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-02 20:04:28,311 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:28,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:04:28,320 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 20:04:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:28,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1346301244, now seen corresponding path program 1 times
[2022-11-02 20:04:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:28,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632995336]
[2022-11-02 20:04:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:28,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:28,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632995336]
[2022-11-02 20:04:28,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632995336] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:28,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:28,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-02 20:04:28,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113585196]
[2022-11-02 20:04:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:28,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-11-02 20:04:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:28,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-11-02 20:04:28,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-11-02 20:04:28,686 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 88
[2022-11-02 20:04:28,690 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 20:04:28,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:28,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 88
[2022-11-02 20:04:28,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:28,799 INFO L130 PetriNetUnfolder]: 3/106 cut-off events.
[2022-11-02 20:04:28,799 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2022-11-02 20:04:28,800 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 20:04:28,802 INFO L137 encePairwiseOnDemand]: 80/88 looper letters, 7 selfloop transitions, 0 changer transitions 0/79 dead transitions.
[2022-11-02 20:04:28,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 79 transitions, 180 flow
[2022-11-02 20:04:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-11-02 20:04:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2022-11-02 20:04:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 159 transitions.
[2022-11-02 20:04:28,825 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9034090909090909
[2022-11-02 20:04:28,826 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 159 transitions.
[2022-11-02 20:04:28,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 159 transitions.
[2022-11-02 20:04:28,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:28,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 159 transitions.
[2022-11-02 20:04:28,840 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 20:04:28,845 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 20:04:28,845 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 20:04:28,848 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 184 flow. Second operand 2 states and 159 transitions.
[2022-11-02 20:04:28,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 79 transitions, 180 flow
[2022-11-02 20:04:28,853 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 20:04:28,859 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 166 flow
[2022-11-02 20:04:28,862 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 20:04:28,867 INFO L287 CegarLoopForPetriNet]: 85 programPoint places, -5 predicate places.
[2022-11-02 20:04:28,867 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 166 flow
[2022-11-02 20:04:28,868 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 20:04:28,868 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:28,868 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 20:04:28,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-11-02 20:04:28,869 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 20:04:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1828019146, now seen corresponding path program 1 times
[2022-11-02 20:04:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:28,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125742666]
[2022-11-02 20:04:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:29,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:29,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125742666]
[2022-11-02 20:04:29,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125742666] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:29,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:29,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:04:29,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189813751]
[2022-11-02 20:04:29,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:29,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:29,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:29,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:29,017 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 88
[2022-11-02 20:04:29,018 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 20:04:29,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:29,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 88
[2022-11-02 20:04:29,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:29,099 INFO L130 PetriNetUnfolder]: 12/148 cut-off events.
[2022-11-02 20:04:29,099 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2022-11-02 20:04:29,106 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 20:04:29,108 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 16 selfloop transitions, 2 changer transitions 0/83 dead transitions.
[2022-11-02 20:04:29,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 210 flow
[2022-11-02 20:04:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions.
[2022-11-02 20:04:29,117 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8106060606060606
[2022-11-02 20:04:29,118 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions.
[2022-11-02 20:04:29,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions.
[2022-11-02 20:04:29,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:29,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions.
[2022-11-02 20:04:29,124 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 20:04:29,126 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 20:04:29,126 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 20:04:29,126 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 166 flow. Second operand 3 states and 214 transitions.
[2022-11-02 20:04:29,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 210 flow
[2022-11-02 20:04:29,128 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 20:04:29,134 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 174 flow
[2022-11-02 20:04:29,135 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 20:04:29,137 INFO L287 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places.
[2022-11-02 20:04:29,138 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 174 flow
[2022-11-02 20:04:29,138 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 20:04:29,139 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:29,139 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 20:04:29,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-11-02 20:04:29,140 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2022-11-02 20:04:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -311906661, now seen corresponding path program 1 times
[2022-11-02 20:04:29,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:29,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527725570]
[2022-11-02 20:04:29,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:29,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:29,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527725570]
[2022-11-02 20:04:29,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527725570] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:29,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:29,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:04:29,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908135755]
[2022-11-02 20:04:29,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:29,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:29,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:29,266 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 88
[2022-11-02 20:04:29,267 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 20:04:29,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:29,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 88
[2022-11-02 20:04:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:29,321 INFO L130 PetriNetUnfolder]: 1/131 cut-off events.
[2022-11-02 20:04:29,338 INFO L131 PetriNetUnfolder]: For 8/14 co-relation queries the response was YES.
[2022-11-02 20:04:29,338 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 20:04:29,339 INFO L137 encePairwiseOnDemand]: 85/88 looper letters, 8 selfloop transitions, 2 changer transitions 0/79 dead transitions.
[2022-11-02 20:04:29,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 197 flow
[2022-11-02 20:04:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:29,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions.
[2022-11-02 20:04:29,342 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8257575757575758
[2022-11-02 20:04:29,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions.
[2022-11-02 20:04:29,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions.
[2022-11-02 20:04:29,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:29,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions.
[2022-11-02 20:04:29,345 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 20:04:29,346 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 20:04:29,347 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 20:04:29,347 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 174 flow. Second operand 3 states and 218 transitions.
[2022-11-02 20:04:29,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 197 flow
[2022-11-02 20:04:29,348 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 20:04:29,350 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 172 flow
[2022-11-02 20:04:29,351 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 20:04:29,352 INFO L287 CegarLoopForPetriNet]: 85 programPoint places, -3 predicate places.
[2022-11-02 20:04:29,352 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 172 flow
[2022-11-02 20:04:29,352 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 20:04:29,352 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:29,353 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 20:04:29,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-11-02 20:04:29,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] ===
[2022-11-02 20:04:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:29,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1996792538, now seen corresponding path program 1 times
[2022-11-02 20:04:29,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:29,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491631737]
[2022-11-02 20:04:29,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:29,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:29,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:29,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491631737]
[2022-11-02 20:04:29,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491631737] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:29,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:29,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:04:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762215482]
[2022-11-02 20:04:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:29,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:29,475 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 88
[2022-11-02 20:04:29,476 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 20:04:29,476 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:29,476 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 88
[2022-11-02 20:04:29,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:29,600 INFO L130 PetriNetUnfolder]: 7/188 cut-off events.
[2022-11-02 20:04:29,600 INFO L131 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES.
[2022-11-02 20:04:29,602 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 20:04:29,604 INFO L137 encePairwiseOnDemand]: 82/88 looper letters, 11 selfloop transitions, 3 changer transitions 11/81 dead transitions.
[2022-11-02 20:04:29,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 213 flow
[2022-11-02 20:04:29,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:29,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions.
[2022-11-02 20:04:29,613 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182
[2022-11-02 20:04:29,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 216 transitions.
[2022-11-02 20:04:29,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 216 transitions.
[2022-11-02 20:04:29,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:29,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 216 transitions.
[2022-11-02 20:04:29,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-11-02 20:04:29,622 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 20:04:29,622 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 20:04:29,623 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 172 flow. Second operand 3 states and 216 transitions.
[2022-11-02 20:04:29,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 213 flow
[2022-11-02 20:04:29,624 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 20:04:29,626 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 168 flow
[2022-11-02 20:04:29,627 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 20:04:29,628 INFO L287 CegarLoopForPetriNet]: 85 programPoint places, -2 predicate places.
[2022-11-02 20:04:29,628 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 168 flow
[2022-11-02 20:04:29,628 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 20:04:29,629 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:29,629 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 20:04:29,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2022-11-02 20:04:29,629 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 20:04:29,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash 476877077, now seen corresponding path program 1 times
[2022-11-02 20:04:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:29,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064558088]
[2022-11-02 20:04:29,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:04:29,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 20:04:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:04:29,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-02 20:04:29,755 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 20:04:29,756 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining)
[2022-11-02 20:04:29,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining)
[2022-11-02 20:04:29,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining)
[2022-11-02 20:04:29,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining)
[2022-11-02 20:04:29,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining)
[2022-11-02 20:04:29,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 14 remaining)
[2022-11-02 20:04:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining)
[2022-11-02 20:04:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining)
[2022-11-02 20:04:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining)
[2022-11-02 20:04:29,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining)
[2022-11-02 20:04:29,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining)
[2022-11-02 20:04:29,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining)
[2022-11-02 20:04:29,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining)
[2022-11-02 20:04:29,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining)
[2022-11-02 20:04:29,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2022-11-02 20:04:29,763 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2022-11-02 20:04:29,767 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2022-11-02 20:04:29,767 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2022-11-02 20:04:29,790 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2022-11-02 20:04:29,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 108 transitions, 234 flow
[2022-11-02 20:04:29,830 INFO L130 PetriNetUnfolder]: 18/209 cut-off events.
[2022-11-02 20:04:29,830 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2022-11-02 20:04:29,832 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 20:04:29,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 108 transitions, 234 flow
[2022-11-02 20:04:29,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 108 transitions, 234 flow
[2022-11-02 20:04:29,836 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:04:29,838 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;@77bf3b4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:04:29,838 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2022-11-02 20:04:29,841 INFO L130 PetriNetUnfolder]: 0/20 cut-off events.
[2022-11-02 20:04:29,841 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-02 20:04:29,842 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:29,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:04:29,842 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 20:04:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1695734104, now seen corresponding path program 1 times
[2022-11-02 20:04:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:29,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595528803]
[2022-11-02 20:04:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:29,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:29,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595528803]
[2022-11-02 20:04:29,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595528803] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:29,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:29,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-02 20:04:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185160128]
[2022-11-02 20:04:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:29,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-11-02 20:04:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:29,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-11-02 20:04:29,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-11-02 20:04:29,873 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108
[2022-11-02 20:04:29,874 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 20:04:29,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:29,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108
[2022-11-02 20:04:29,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:29,934 INFO L130 PetriNetUnfolder]: 16/208 cut-off events.
[2022-11-02 20:04:29,935 INFO L131 PetriNetUnfolder]: For 36/41 co-relation queries the response was YES.
[2022-11-02 20:04:29,936 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 20:04:29,938 INFO L137 encePairwiseOnDemand]: 98/108 looper letters, 11 selfloop transitions, 0 changer transitions 0/97 dead transitions.
[2022-11-02 20:04:29,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 97 transitions, 234 flow
[2022-11-02 20:04:29,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-11-02 20:04:29,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2022-11-02 20:04:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 193 transitions.
[2022-11-02 20:04:29,940 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185
[2022-11-02 20:04:29,940 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 193 transitions.
[2022-11-02 20:04:29,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 193 transitions.
[2022-11-02 20:04:29,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:29,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 193 transitions.
[2022-11-02 20:04:29,942 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 20:04:29,943 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 20:04:29,943 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 20:04:29,943 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 234 flow. Second operand 2 states and 193 transitions.
[2022-11-02 20:04:29,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 97 transitions, 234 flow
[2022-11-02 20:04:29,945 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 20:04:29,947 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 212 flow
[2022-11-02 20:04:29,948 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 20:04:29,949 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, -7 predicate places.
[2022-11-02 20:04:29,949 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 212 flow
[2022-11-02 20:04:29,949 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 20:04:29,949 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:29,949 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 20:04:29,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2022-11-02 20:04:29,950 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 20:04:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash -708223178, now seen corresponding path program 1 times
[2022-11-02 20:04:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:29,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113437319]
[2022-11-02 20:04:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:30,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:30,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113437319]
[2022-11-02 20:04:30,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113437319] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:30,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:30,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:04:30,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036019960]
[2022-11-02 20:04:30,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:30,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:30,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:30,030 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108
[2022-11-02 20:04:30,031 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 20:04:30,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:30,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108
[2022-11-02 20:04:30,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:30,183 INFO L130 PetriNetUnfolder]: 68/423 cut-off events.
[2022-11-02 20:04:30,183 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES.
[2022-11-02 20:04:30,185 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 20:04:30,188 INFO L137 encePairwiseOnDemand]: 105/108 looper letters, 22 selfloop transitions, 2 changer transitions 0/103 dead transitions.
[2022-11-02 20:04:30,188 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 272 flow
[2022-11-02 20:04:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions.
[2022-11-02 20:04:30,191 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.808641975308642
[2022-11-02 20:04:30,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions.
[2022-11-02 20:04:30,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions.
[2022-11-02 20:04:30,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:30,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions.
[2022-11-02 20:04:30,193 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 20:04:30,195 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 20:04:30,195 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 20:04:30,196 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 212 flow. Second operand 3 states and 262 transitions.
[2022-11-02 20:04:30,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 272 flow
[2022-11-02 20:04:30,198 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 20:04:30,201 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 224 flow
[2022-11-02 20:04:30,201 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 20:04:30,202 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, -4 predicate places.
[2022-11-02 20:04:30,202 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 224 flow
[2022-11-02 20:04:30,203 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 20:04:30,203 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:30,203 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 20:04:30,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2022-11-02 20:04:30,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2022-11-02 20:04:30,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:30,205 INFO L85 PathProgramCache]: Analyzing trace with hash -441666231, now seen corresponding path program 1 times
[2022-11-02 20:04:30,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:30,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880380364]
[2022-11-02 20:04:30,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:30,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:30,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:30,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880380364]
[2022-11-02 20:04:30,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880380364] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:30,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:30,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:04:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910718001]
[2022-11-02 20:04:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:30,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:30,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:30,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:30,257 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108
[2022-11-02 20:04:30,258 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 20:04:30,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:30,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108
[2022-11-02 20:04:30,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:30,428 INFO L130 PetriNetUnfolder]: 52/631 cut-off events.
[2022-11-02 20:04:30,429 INFO L131 PetriNetUnfolder]: For 111/313 co-relation queries the response was YES.
[2022-11-02 20:04:30,432 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 20:04:30,435 INFO L137 encePairwiseOnDemand]: 100/108 looper letters, 22 selfloop transitions, 6 changer transitions 0/109 dead transitions.
[2022-11-02 20:04:30,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 109 transitions, 313 flow
[2022-11-02 20:04:30,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions.
[2022-11-02 20:04:30,437 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334
[2022-11-02 20:04:30,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 270 transitions.
[2022-11-02 20:04:30,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 270 transitions.
[2022-11-02 20:04:30,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:30,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 270 transitions.
[2022-11-02 20:04:30,439 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 20:04:30,440 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 20:04:30,441 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 20:04:30,441 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 224 flow. Second operand 3 states and 270 transitions.
[2022-11-02 20:04:30,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 109 transitions, 313 flow
[2022-11-02 20:04:30,443 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 20:04:30,445 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 274 flow
[2022-11-02 20:04:30,445 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 20:04:30,446 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, -1 predicate places.
[2022-11-02 20:04:30,447 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 274 flow
[2022-11-02 20:04:30,447 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 20:04:30,447 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:30,447 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 20:04:30,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2022-11-02 20:04:30,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2022-11-02 20:04:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2101498532, now seen corresponding path program 1 times
[2022-11-02 20:04:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:30,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050519288]
[2022-11-02 20:04:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:30,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:30,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050519288]
[2022-11-02 20:04:30,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050519288] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:30,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:30,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:04:30,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498967521]
[2022-11-02 20:04:30,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:30,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:30,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:30,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:30,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:30,509 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 108
[2022-11-02 20:04:30,510 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 20:04:30,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:30,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 108
[2022-11-02 20:04:30,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:30,902 INFO L130 PetriNetUnfolder]: 266/1644 cut-off events.
[2022-11-02 20:04:30,903 INFO L131 PetriNetUnfolder]: For 364/746 co-relation queries the response was YES.
[2022-11-02 20:04:30,909 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 20:04:30,918 INFO L137 encePairwiseOnDemand]: 97/108 looper letters, 27 selfloop transitions, 8 changer transitions 0/117 dead transitions.
[2022-11-02 20:04:30,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 117 transitions, 389 flow
[2022-11-02 20:04:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:30,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions.
[2022-11-02 20:04:30,920 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8240740740740741
[2022-11-02 20:04:30,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions.
[2022-11-02 20:04:30,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions.
[2022-11-02 20:04:30,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:30,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions.
[2022-11-02 20:04:30,922 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 20:04:30,924 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 20:04:30,924 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 20:04:30,926 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 274 flow. Second operand 3 states and 267 transitions.
[2022-11-02 20:04:30,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 117 transitions, 389 flow
[2022-11-02 20:04:30,935 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 20:04:30,938 INFO L231 Difference]: Finished difference. Result has 105 places, 112 transitions, 332 flow
[2022-11-02 20:04:30,938 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 20:04:30,942 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places.
[2022-11-02 20:04:30,942 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 332 flow
[2022-11-02 20:04:30,943 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 20:04:30,943 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:30,944 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 20:04:30,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2022-11-02 20:04:30,946 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 20:04:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash 210032464, now seen corresponding path program 1 times
[2022-11-02 20:04:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:30,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083874119]
[2022-11-02 20:04:30,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:30,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:31,143 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 20:04:31,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:31,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083874119]
[2022-11-02 20:04:31,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083874119] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:04:31,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605365323]
[2022-11-02 20:04:31,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:31,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:04:31,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:04:31,148 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:04:31,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-11-02 20:04:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:31,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-11-02 20:04:31,306 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:04:31,392 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 20:04:31,394 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-11-02 20:04:31,483 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 20:04:31,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605365323] provided 0 perfect and 2 imperfect interpolant sequences
[2022-11-02 20:04:31,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-11-02 20:04:31,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2022-11-02 20:04:31,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394779561]
[2022-11-02 20:04:31,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-11-02 20:04:31,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-11-02 20:04:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-11-02 20:04:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:04:31,490 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108
[2022-11-02 20:04:31,492 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 20:04:31,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:31,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108
[2022-11-02 20:04:31,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:31,813 INFO L130 PetriNetUnfolder]: 196/645 cut-off events.
[2022-11-02 20:04:31,814 INFO L131 PetriNetUnfolder]: For 427/570 co-relation queries the response was YES.
[2022-11-02 20:04:31,817 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 20:04:31,822 INFO L137 encePairwiseOnDemand]: 103/108 looper letters, 50 selfloop transitions, 7 changer transitions 0/117 dead transitions.
[2022-11-02 20:04:31,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 512 flow
[2022-11-02 20:04:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:04:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-11-02 20:04:31,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 745 transitions.
[2022-11-02 20:04:31,826 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7664609053497943
[2022-11-02 20:04:31,826 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 745 transitions.
[2022-11-02 20:04:31,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 745 transitions.
[2022-11-02 20:04:31,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:31,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 745 transitions.
[2022-11-02 20:04:31,830 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 20:04:31,832 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 20:04:31,833 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 20:04:31,833 INFO L175 Difference]: Start difference. First operand has 105 places, 112 transitions, 332 flow. Second operand 9 states and 745 transitions.
[2022-11-02 20:04:31,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 512 flow
[2022-11-02 20:04:31,837 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 20:04:31,840 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 252 flow
[2022-11-02 20:04:31,840 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 20:04:31,842 INFO L287 CegarLoopForPetriNet]: 104 programPoint places, -20 predicate places.
[2022-11-02 20:04:31,846 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 252 flow
[2022-11-02 20:04:31,847 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 20:04:31,847 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:31,848 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 20:04:31,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2022-11-02 20:04:32,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2022-11-02 20:04:32,067 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 20:04:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:32,067 INFO L85 PathProgramCache]: Analyzing trace with hash 616978764, now seen corresponding path program 1 times
[2022-11-02 20:04:32,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:32,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582417462]
[2022-11-02 20:04:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:32,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:04:32,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 20:04:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:04:32,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-02 20:04:32,121 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 20:04:32,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2022-11-02 20:04:32,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2022-11-02 20:04:32,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2022-11-02 20:04:32,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2022-11-02 20:04:32,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2022-11-02 20:04:32,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2022-11-02 20:04:32,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2022-11-02 20:04:32,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2022-11-02 20:04:32,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2022-11-02 20:04:32,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2022-11-02 20:04:32,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2022-11-02 20:04:32,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2022-11-02 20:04:32,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2022-11-02 20:04:32,125 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2022-11-02 20:04:32,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2022-11-02 20:04:32,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2022-11-02 20:04:32,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2022-11-02 20:04:32,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2022-11-02 20:04:32,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2022-11-02 20:04:32,127 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2022-11-02 20:04:32,128 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2022-11-02 20:04:32,128 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2022-11-02 20:04:32,162 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2022-11-02 20:04:32,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 128 transitions, 286 flow
[2022-11-02 20:04:32,218 INFO L130 PetriNetUnfolder]: 34/360 cut-off events.
[2022-11-02 20:04:32,218 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2022-11-02 20:04:32,221 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 20:04:32,221 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 128 transitions, 286 flow
[2022-11-02 20:04:32,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 128 transitions, 286 flow
[2022-11-02 20:04:32,226 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-11-02 20:04:32,227 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;@77bf3b4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2022-11-02 20:04:32,228 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2022-11-02 20:04:32,230 INFO L130 PetriNetUnfolder]: 0/20 cut-off events.
[2022-11-02 20:04:32,231 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2022-11-02 20:04:32,231 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:32,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:04:32,232 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 20:04:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash -369850584, now seen corresponding path program 1 times
[2022-11-02 20:04:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:32,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331673253]
[2022-11-02 20:04:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:32,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:32,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331673253]
[2022-11-02 20:04:32,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331673253] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:32,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:32,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2022-11-02 20:04:32,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596604418]
[2022-11-02 20:04:32,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:32,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-11-02 20:04:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-11-02 20:04:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-11-02 20:04:32,252 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 128
[2022-11-02 20:04:32,253 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 20:04:32,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:32,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 128
[2022-11-02 20:04:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:32,357 INFO L130 PetriNetUnfolder]: 84/453 cut-off events.
[2022-11-02 20:04:32,357 INFO L131 PetriNetUnfolder]: For 191/217 co-relation queries the response was YES.
[2022-11-02 20:04:32,360 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 20:04:32,364 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 15 selfloop transitions, 0 changer transitions 0/115 dead transitions.
[2022-11-02 20:04:32,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 290 flow
[2022-11-02 20:04:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-11-02 20:04:32,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2022-11-02 20:04:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 227 transitions.
[2022-11-02 20:04:32,366 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.88671875
[2022-11-02 20:04:32,366 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 227 transitions.
[2022-11-02 20:04:32,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 227 transitions.
[2022-11-02 20:04:32,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:32,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 227 transitions.
[2022-11-02 20:04:32,368 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 20:04:32,369 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 20:04:32,370 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 20:04:32,370 INFO L175 Difference]: Start difference. First operand has 123 places, 128 transitions, 286 flow. Second operand 2 states and 227 transitions.
[2022-11-02 20:04:32,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 290 flow
[2022-11-02 20:04:32,371 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 20:04:32,374 INFO L231 Difference]: Finished difference. Result has 114 places, 115 transitions, 260 flow
[2022-11-02 20:04:32,374 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 20:04:32,375 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -9 predicate places.
[2022-11-02 20:04:32,375 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 260 flow
[2022-11-02 20:04:32,376 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 20:04:32,376 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:32,376 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 20:04:32,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2022-11-02 20:04:32,376 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 20:04:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:32,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1058045878, now seen corresponding path program 1 times
[2022-11-02 20:04:32,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:32,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634924734]
[2022-11-02 20:04:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:32,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:32,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:32,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634924734]
[2022-11-02 20:04:32,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634924734] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:32,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:32,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-11-02 20:04:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489019081]
[2022-11-02 20:04:32,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:32,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:32,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:32,418 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128
[2022-11-02 20:04:32,419 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 20:04:32,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:32,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128
[2022-11-02 20:04:32,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:32,714 INFO L130 PetriNetUnfolder]: 258/1209 cut-off events.
[2022-11-02 20:04:32,715 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES.
[2022-11-02 20:04:32,721 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 20:04:32,728 INFO L137 encePairwiseOnDemand]: 125/128 looper letters, 26 selfloop transitions, 2 changer transitions 0/121 dead transitions.
[2022-11-02 20:04:32,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 121 transitions, 328 flow
[2022-11-02 20:04:32,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions.
[2022-11-02 20:04:32,730 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334
[2022-11-02 20:04:32,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions.
[2022-11-02 20:04:32,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions.
[2022-11-02 20:04:32,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:32,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions.
[2022-11-02 20:04:32,732 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 20:04:32,734 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 20:04:32,734 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 20:04:32,734 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 260 flow. Second operand 3 states and 308 transitions.
[2022-11-02 20:04:32,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 121 transitions, 328 flow
[2022-11-02 20:04:32,736 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 20:04:32,738 INFO L231 Difference]: Finished difference. Result has 117 places, 116 transitions, 272 flow
[2022-11-02 20:04:32,738 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 20:04:32,739 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -6 predicate places.
[2022-11-02 20:04:32,739 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 116 transitions, 272 flow
[2022-11-02 20:04:32,739 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 20:04:32,739 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:32,740 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 20:04:32,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2022-11-02 20:04:32,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2022-11-02 20:04:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash 836136859, now seen corresponding path program 1 times
[2022-11-02 20:04:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:32,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353022389]
[2022-11-02 20:04:32,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:32,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:32,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353022389]
[2022-11-02 20:04:32,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353022389] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:32,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:32,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:04:32,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601871127]
[2022-11-02 20:04:32,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:32,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:32,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:32,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:32,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:32,783 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 128
[2022-11-02 20:04:32,784 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 20:04:32,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:32,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 128
[2022-11-02 20:04:32,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:33,499 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 20:04:33,499 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event
[2022-11-02 20:04:33,499 INFO L386 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event
[2022-11-02 20:04:33,500 INFO L386 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event
[2022-11-02 20:04:33,500 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event
[2022-11-02 20:04:33,500 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 20:04:33,500 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2022-11-02 20:04:33,501 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2022-11-02 20:04:33,501 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2022-11-02 20:04:33,501 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event
[2022-11-02 20:04:33,501 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 20:04:33,502 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2022-11-02 20:04:33,502 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2022-11-02 20:04:33,502 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event
[2022-11-02 20:04:33,502 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2022-11-02 20:04:33,559 INFO L130 PetriNetUnfolder]: 665/3818 cut-off events.
[2022-11-02 20:04:33,560 INFO L131 PetriNetUnfolder]: For 1383/3760 co-relation queries the response was YES.
[2022-11-02 20:04:33,584 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 20:04:33,674 INFO L137 encePairwiseOnDemand]: 116/128 looper letters, 32 selfloop transitions, 9 changer transitions 0/133 dead transitions.
[2022-11-02 20:04:33,674 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 409 flow
[2022-11-02 20:04:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:33,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions.
[2022-11-02 20:04:33,677 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8255208333333334
[2022-11-02 20:04:33,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions.
[2022-11-02 20:04:33,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions.
[2022-11-02 20:04:33,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:33,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions.
[2022-11-02 20:04:33,679 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 20:04:33,681 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 20:04:33,681 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 20:04:33,682 INFO L175 Difference]: Start difference. First operand has 117 places, 116 transitions, 272 flow. Second operand 3 states and 317 transitions.
[2022-11-02 20:04:33,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 409 flow
[2022-11-02 20:04:33,684 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 20:04:33,688 INFO L231 Difference]: Finished difference. Result has 120 places, 125 transitions, 348 flow
[2022-11-02 20:04:33,688 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 20:04:33,690 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -3 predicate places.
[2022-11-02 20:04:33,690 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 125 transitions, 348 flow
[2022-11-02 20:04:33,691 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 20:04:33,691 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:33,691 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 20:04:33,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2022-11-02 20:04:33,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2022-11-02 20:04:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1456596170, now seen corresponding path program 1 times
[2022-11-02 20:04:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:33,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601059896]
[2022-11-02 20:04:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-11-02 20:04:33,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:33,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601059896]
[2022-11-02 20:04:33,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601059896] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:33,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:33,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-11-02 20:04:33,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250389162]
[2022-11-02 20:04:33,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:33,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-11-02 20:04:33,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:33,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-11-02 20:04:33,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-11-02 20:04:33,745 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 128
[2022-11-02 20:04:33,745 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 20:04:33,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:33,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 128
[2022-11-02 20:04:33,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:35,748 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 20:04:35,748 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event
[2022-11-02 20:04:35,754 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event
[2022-11-02 20:04:35,754 INFO L386 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event
[2022-11-02 20:04:35,754 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event
[2022-11-02 20:04:36,014 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 20:04:36,014 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event
[2022-11-02 20:04:36,014 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event
[2022-11-02 20:04:36,015 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event
[2022-11-02 20:04:36,015 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2022-11-02 20:04:36,016 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 20:04:36,016 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event
[2022-11-02 20:04:36,016 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event
[2022-11-02 20:04:36,016 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event
[2022-11-02 20:04:36,017 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event
[2022-11-02 20:04:36,018 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 20:04:36,018 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event
[2022-11-02 20:04:36,018 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event
[2022-11-02 20:04:36,019 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event
[2022-11-02 20:04:36,019 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2022-11-02 20:04:36,020 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 20:04:36,020 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event
[2022-11-02 20:04:36,020 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event
[2022-11-02 20:04:36,020 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event
[2022-11-02 20:04:36,021 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event
[2022-11-02 20:04:36,077 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 20:04:36,078 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2022-11-02 20:04:36,078 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2022-11-02 20:04:36,078 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event
[2022-11-02 20:04:36,078 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2022-11-02 20:04:36,352 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 20:04:36,352 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2022-11-02 20:04:36,352 INFO L386 tUnfolder$Statistics]: existing Event has 69 ancestors and is cut-off event
[2022-11-02 20:04:36,352 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2022-11-02 20:04:36,353 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2022-11-02 20:04:36,470 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 20:04:36,470 INFO L383 tUnfolder$Statistics]: this new event has 98 ancestors and is cut-off event
[2022-11-02 20:04:36,470 INFO L386 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event
[2022-11-02 20:04:36,471 INFO L386 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event
[2022-11-02 20:04:36,471 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2022-11-02 20:04:36,471 INFO L386 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event
[2022-11-02 20:04:36,545 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 20:04:36,546 INFO L383 tUnfolder$Statistics]: this new event has 99 ancestors and is cut-off event
[2022-11-02 20:04:36,546 INFO L386 tUnfolder$Statistics]: existing Event has 99 ancestors and is cut-off event
[2022-11-02 20:04:36,546 INFO L386 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event
[2022-11-02 20:04:36,547 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event
[2022-11-02 20:04:36,547 INFO L386 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event
[2022-11-02 20:04:37,086 INFO L130 PetriNetUnfolder]: 4582/16344 cut-off events.
[2022-11-02 20:04:37,087 INFO L131 PetriNetUnfolder]: For 6389/11730 co-relation queries the response was YES.
[2022-11-02 20:04:37,205 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 20:04:37,310 INFO L137 encePairwiseOnDemand]: 113/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/147 dead transitions.
[2022-11-02 20:04:37,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 535 flow
[2022-11-02 20:04:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-11-02 20:04:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2022-11-02 20:04:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions.
[2022-11-02 20:04:37,313 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8177083333333334
[2022-11-02 20:04:37,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions.
[2022-11-02 20:04:37,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions.
[2022-11-02 20:04:37,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:37,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions.
[2022-11-02 20:04:37,316 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 20:04:37,317 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 20:04:37,318 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 20:04:37,318 INFO L175 Difference]: Start difference. First operand has 120 places, 125 transitions, 348 flow. Second operand 3 states and 314 transitions.
[2022-11-02 20:04:37,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 535 flow
[2022-11-02 20:04:37,337 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 20:04:37,341 INFO L231 Difference]: Finished difference. Result has 122 places, 136 transitions, 426 flow
[2022-11-02 20:04:37,342 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 20:04:37,345 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, -1 predicate places.
[2022-11-02 20:04:37,345 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 136 transitions, 426 flow
[2022-11-02 20:04:37,346 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 20:04:37,346 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:37,346 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 20:04:37,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2022-11-02 20:04:37,347 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 20:04:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:37,348 INFO L85 PathProgramCache]: Analyzing trace with hash -505216926, now seen corresponding path program 1 times
[2022-11-02 20:04:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:37,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729691390]
[2022-11-02 20:04:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:37,487 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 20:04:37,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:37,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729691390]
[2022-11-02 20:04:37,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729691390] provided 0 perfect and 1 imperfect interpolant sequences
[2022-11-02 20:04:37,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899801794]
[2022-11-02 20:04:37,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:37,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-11-02 20:04:37,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3
[2022-11-02 20:04:37,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-11-02 20:04:37,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-11-02 20:04:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:37,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-11-02 20:04:37,615 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-11-02 20:04:37,675 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 20:04:37,678 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-11-02 20:04:37,757 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 20:04:37,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899801794] provided 0 perfect and 2 imperfect interpolant sequences
[2022-11-02 20:04:37,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2022-11-02 20:04:37,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2022-11-02 20:04:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521523315]
[2022-11-02 20:04:37,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2022-11-02 20:04:37,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-11-02 20:04:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-11-02 20:04:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2022-11-02 20:04:37,764 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 128
[2022-11-02 20:04:37,766 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 20:04:37,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:37,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 128
[2022-11-02 20:04:37,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:38,872 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| 10), Black: 140#true, 101#L746-3true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)])
[2022-11-02 20:04:38,872 INFO L383 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event
[2022-11-02 20:04:38,872 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event
[2022-11-02 20:04:38,872 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event
[2022-11-02 20:04:38,873 INFO L386 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event
[2022-11-02 20:04:39,352 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 20:04:39,352 INFO L383 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event
[2022-11-02 20:04:39,352 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2022-11-02 20:04:39,352 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2022-11-02 20:04:39,353 INFO L386 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event
[2022-11-02 20:04:39,522 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 20:04:39,522 INFO L383 tUnfolder$Statistics]: this new event has 75 ancestors and is cut-off event
[2022-11-02 20:04:39,523 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event
[2022-11-02 20:04:39,523 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event
[2022-11-02 20:04:39,523 INFO L386 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event
[2022-11-02 20:04:39,710 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 20:04:39,710 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event
[2022-11-02 20:04:39,710 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event
[2022-11-02 20:04:39,711 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event
[2022-11-02 20:04:39,711 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event
[2022-11-02 20:04:39,711 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| 10), 10#L747true, Black: 140#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)])
[2022-11-02 20:04:39,711 INFO L383 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event
[2022-11-02 20:04:39,712 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event
[2022-11-02 20:04:39,712 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event
[2022-11-02 20:04:39,712 INFO L386 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event
[2022-11-02 20:04:40,244 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| 10), Black: 140#true, salethreadThread1of3ForFork0InUse, salethreadThread2of3ForFork0InUse, 93#L721-2true, salethreadThread3of3ForFork0InUse, 126#true, 142#(= |#race~numberOfSeatsSold~0| 0)])
[2022-11-02 20:04:40,244 INFO L383 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event
[2022-11-02 20:04:40,245 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event
[2022-11-02 20:04:40,245 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event
[2022-11-02 20:04:40,245 INFO L386 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event
[2022-11-02 20:04:40,993 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 20:04:40,993 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2022-11-02 20:04:40,994 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event
[2022-11-02 20:04:40,994 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event
[2022-11-02 20:04:40,994 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2022-11-02 20:04:40,994 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 20:04:40,994 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2022-11-02 20:04:40,994 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event
[2022-11-02 20:04:40,995 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event
[2022-11-02 20:04:40,995 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2022-11-02 20:04:41,662 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 20:04:41,663 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event
[2022-11-02 20:04:41,663 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event
[2022-11-02 20:04:41,663 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event
[2022-11-02 20:04:41,663 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event
[2022-11-02 20:04:42,434 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 20:04:42,434 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2022-11-02 20:04:42,435 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:42,435 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:42,435 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2022-11-02 20:04:42,435 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 20:04:42,435 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2022-11-02 20:04:42,436 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:42,436 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:42,436 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2022-11-02 20:04:42,523 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 20:04:42,523 INFO L383 tUnfolder$Statistics]: this new event has 105 ancestors and is cut-off event
[2022-11-02 20:04:42,523 INFO L386 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event
[2022-11-02 20:04:42,524 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event
[2022-11-02 20:04:42,524 INFO L386 tUnfolder$Statistics]: existing Event has 105 ancestors and is cut-off event
[2022-11-02 20:04:42,653 INFO L130 PetriNetUnfolder]: 6212/24965 cut-off events.
[2022-11-02 20:04:42,653 INFO L131 PetriNetUnfolder]: For 10982/13799 co-relation queries the response was YES.
[2022-11-02 20:04:42,797 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 20:04:42,934 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 73 selfloop transitions, 9 changer transitions 0/188 dead transitions.
[2022-11-02 20:04:42,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 188 transitions, 804 flow
[2022-11-02 20:04:42,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-11-02 20:04:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2022-11-02 20:04:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 888 transitions.
[2022-11-02 20:04:42,939 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334
[2022-11-02 20:04:42,939 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 888 transitions.
[2022-11-02 20:04:42,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 888 transitions.
[2022-11-02 20:04:42,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:42,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 888 transitions.
[2022-11-02 20:04:42,945 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 20:04:42,948 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 20:04:42,949 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 20:04:42,949 INFO L175 Difference]: Start difference. First operand has 122 places, 136 transitions, 426 flow. Second operand 9 states and 888 transitions.
[2022-11-02 20:04:42,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 188 transitions, 804 flow
[2022-11-02 20:04:43,096 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 20:04:43,099 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 454 flow
[2022-11-02 20:04:43,100 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 20:04:43,101 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 8 predicate places.
[2022-11-02 20:04:43,102 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 454 flow
[2022-11-02 20:04:43,103 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 20:04:43,103 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:43,103 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 20:04:43,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-11-02 20:04:43,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2022-11-02 20:04:43,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2022-11-02 20:04:43,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1053784385, now seen corresponding path program 1 times
[2022-11-02 20:04:43,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:43,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287165474]
[2022-11-02 20:04:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:43,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:43,507 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 20:04:43,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:43,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287165474]
[2022-11-02 20:04:43,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287165474] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:43,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:43,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:04:43,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518533339]
[2022-11-02 20:04:43,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:43,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:04:43,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:43,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:04:43,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:04:43,511 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128
[2022-11-02 20:04:43,512 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 20:04:43,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:43,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128
[2022-11-02 20:04:43,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:46,259 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| 10), 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 20:04:46,260 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event
[2022-11-02 20:04:46,260 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event
[2022-11-02 20:04:46,260 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event
[2022-11-02 20:04:46,260 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event
[2022-11-02 20:04:46,260 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| 10), 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 20:04:46,261 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event
[2022-11-02 20:04:46,261 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event
[2022-11-02 20:04:46,261 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event
[2022-11-02 20:04:46,261 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event
[2022-11-02 20:04:46,267 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| 10), 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 20:04:46,268 INFO L383 tUnfolder$Statistics]: this new event has 85 ancestors and is not cut-off event
[2022-11-02 20:04:46,268 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event
[2022-11-02 20:04:46,268 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is not cut-off event
[2022-11-02 20:04:46,268 INFO L386 tUnfolder$Statistics]: existing Event has 85 ancestors and is not cut-off event
[2022-11-02 20:04:46,435 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| 10), 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 20:04:46,435 INFO L383 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event
[2022-11-02 20:04:46,435 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event
[2022-11-02 20:04:46,435 INFO L386 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event
[2022-11-02 20:04:46,436 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event
[2022-11-02 20:04:47,790 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| 10), 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 20:04:47,790 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event
[2022-11-02 20:04:47,791 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:47,791 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:47,791 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:47,814 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| 10), 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 20:04:47,814 INFO L383 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event
[2022-11-02 20:04:47,815 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event
[2022-11-02 20:04:47,815 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event
[2022-11-02 20:04:47,815 INFO L386 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event
[2022-11-02 20:04:47,904 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| 10), 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 20:04:47,905 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2022-11-02 20:04:47,905 INFO L386 tUnfolder$Statistics]: existing Event has 107 ancestors and is cut-off event
[2022-11-02 20:04:47,905 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:47,905 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:48,848 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| 10), 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 20:04:48,848 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event
[2022-11-02 20:04:48,848 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event
[2022-11-02 20:04:48,849 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event
[2022-11-02 20:04:48,849 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event
[2022-11-02 20:04:48,956 INFO L130 PetriNetUnfolder]: 7626/31979 cut-off events.
[2022-11-02 20:04:48,957 INFO L131 PetriNetUnfolder]: For 7994/14839 co-relation queries the response was YES.
[2022-11-02 20:04:49,129 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 20:04:49,258 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 69 selfloop transitions, 7 changer transitions 0/190 dead transitions.
[2022-11-02 20:04:49,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 190 transitions, 803 flow
[2022-11-02 20:04:49,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-11-02 20:04:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2022-11-02 20:04:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions.
[2022-11-02 20:04:49,261 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.825
[2022-11-02 20:04:49,261 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions.
[2022-11-02 20:04:49,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions.
[2022-11-02 20:04:49,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:49,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions.
[2022-11-02 20:04:49,264 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 20:04:49,266 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 20:04:49,266 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 20:04:49,267 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 454 flow. Second operand 5 states and 528 transitions.
[2022-11-02 20:04:49,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 190 transitions, 803 flow
[2022-11-02 20:04:49,276 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 20:04:49,279 INFO L231 Difference]: Finished difference. Result has 137 places, 148 transitions, 511 flow
[2022-11-02 20:04:49,280 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 20:04:49,281 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 14 predicate places.
[2022-11-02 20:04:49,282 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 148 transitions, 511 flow
[2022-11-02 20:04:49,282 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 20:04:49,282 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:49,283 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 20:04:49,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2022-11-02 20:04:49,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2022-11-02 20:04:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -213244023, now seen corresponding path program 1 times
[2022-11-02 20:04:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:49,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881346964]
[2022-11-02 20:04:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:49,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-11-02 20:04:49,424 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 20:04:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-11-02 20:04:49,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881346964]
[2022-11-02 20:04:49,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881346964] provided 1 perfect and 0 imperfect interpolant sequences
[2022-11-02 20:04:49,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-11-02 20:04:49,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-11-02 20:04:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42982671]
[2022-11-02 20:04:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-11-02 20:04:49,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-11-02 20:04:49,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-11-02 20:04:49,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-11-02 20:04:49,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-11-02 20:04:49,428 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 128
[2022-11-02 20:04:49,429 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 20:04:49,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2022-11-02 20:04:49,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 128
[2022-11-02 20:04:49,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2022-11-02 20:04:53,566 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| 10), 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 20:04:53,567 INFO L383 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event
[2022-11-02 20:04:53,567 INFO L386 tUnfolder$Statistics]: existing Event has 102 ancestors and is cut-off event
[2022-11-02 20:04:53,567 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2022-11-02 20:04:53,567 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event
[2022-11-02 20:04:54,704 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| 10), 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 20:04:54,704 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event
[2022-11-02 20:04:54,704 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event
[2022-11-02 20:04:54,704 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event
[2022-11-02 20:04:54,704 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event
[2022-11-02 20:04:55,040 INFO L130 PetriNetUnfolder]: 7497/33062 cut-off events.
[2022-11-02 20:04:55,040 INFO L131 PetriNetUnfolder]: For 16020/21828 co-relation queries the response was YES.
[2022-11-02 20:04:55,204 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 20:04:55,307 INFO L137 encePairwiseOnDemand]: 122/128 looper letters, 62 selfloop transitions, 10 changer transitions 0/186 dead transitions.
[2022-11-02 20:04:55,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 186 transitions, 838 flow
[2022-11-02 20:04:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-11-02 20:04:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2022-11-02 20:04:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions.
[2022-11-02 20:04:55,309 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8203125
[2022-11-02 20:04:55,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions.
[2022-11-02 20:04:55,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions.
[2022-11-02 20:04:55,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-11-02 20:04:55,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions.
[2022-11-02 20:04:55,312 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 20:04:55,314 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 20:04:55,315 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 20:04:55,315 INFO L175 Difference]: Start difference. First operand has 137 places, 148 transitions, 511 flow. Second operand 5 states and 525 transitions.
[2022-11-02 20:04:55,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 186 transitions, 838 flow
[2022-11-02 20:04:55,355 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 20:04:55,358 INFO L231 Difference]: Finished difference. Result has 143 places, 152 transitions, 574 flow
[2022-11-02 20:04:55,359 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 20:04:55,359 INFO L287 CegarLoopForPetriNet]: 123 programPoint places, 20 predicate places.
[2022-11-02 20:04:55,360 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 152 transitions, 574 flow
[2022-11-02 20:04:55,360 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 20:04:55,360 INFO L200 CegarLoopForPetriNet]: Found error trace
[2022-11-02 20:04:55,361 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 20:04:55,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2022-11-02 20:04:55,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr0ASSERT_VIOLATIONDATA_RACE, salethreadErr1ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2022-11-02 20:04:55,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-11-02 20:04:55,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1287448103, now seen corresponding path program 1 times
[2022-11-02 20:04:55,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-11-02 20:04:55,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633856300]
[2022-11-02 20:04:55,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-11-02 20:04:55,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-11-02 20:04:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:04:55,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-11-02 20:04:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-11-02 20:04:55,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-11-02 20:04:55,425 INFO L359 BasicCegarLoop]: Counterexample is feasible
[2022-11-02 20:04:55,426 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining)
[2022-11-02 20:04:55,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining)
[2022-11-02 20:04:55,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining)
[2022-11-02 20:04:55,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining)
[2022-11-02 20:04:55,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining)
[2022-11-02 20:04:55,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining)
[2022-11-02 20:04:55,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining)
[2022-11-02 20:04:55,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining)
[2022-11-02 20:04:55,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining)
[2022-11-02 20:04:55,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining)
[2022-11-02 20:04:55,428 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 22 remaining)
[2022-11-02 20:04:55,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining)
[2022-11-02 20:04:55,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining)
[2022-11-02 20:04:55,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining)
[2022-11-02 20:04:55,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining)
[2022-11-02 20:04:55,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining)
[2022-11-02 20:04:55,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining)
[2022-11-02 20:04:55,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining)
[2022-11-02 20:04:55,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining)
[2022-11-02 20:04:55,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining)
[2022-11-02 20:04:55,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining)
[2022-11-02 20:04:55,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining)
[2022-11-02 20:04:55,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2022-11-02 20:04:55,432 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2022-11-02 20:04:55,439 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances
[2022-11-02 20:04:55,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-11-02 20:04:55,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 08:04:55 BasicIcfg
[2022-11-02 20:04:55,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-11-02 20:04:55,544 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2022-11-02 20:04:55,544 INFO L271 PluginConnector]: Initializing Witness Printer...
[2022-11-02 20:04:55,544 INFO L275 PluginConnector]: Witness Printer initialized
[2022-11-02 20:04:55,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:04:27" (3/4) ...
[2022-11-02 20:04:55,548 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2022-11-02 20:04:55,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-11-02 20:04:55,549 INFO L158 Benchmark]: Toolchain (without parser) took 29185.57ms. Allocated memory was 144.7MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 110.2MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 765.6MB. Max. memory is 16.1GB.
[2022-11-02 20:04:55,550 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:04:55,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.30ms. Allocated memory is still 144.7MB. Free memory was 110.0MB in the beginning and 110.1MB in the end (delta: -188.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2022-11-02 20:04:55,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.89ms. Allocated memory is still 144.7MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-02 20:04:55,551 INFO L158 Benchmark]: Boogie Preprocessor took 60.56ms. Allocated memory is still 144.7MB. Free memory was 108.0MB in the beginning and 106.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2022-11-02 20:04:55,551 INFO L158 Benchmark]: RCFGBuilder took 771.49ms. Allocated memory is still 144.7MB. Free memory was 106.2MB in the beginning and 89.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2022-11-02 20:04:55,552 INFO L158 Benchmark]: TraceAbstraction took 27610.16ms. Allocated memory was 144.7MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 89.4MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 747.4MB. Max. memory is 16.1GB.
[2022-11-02 20:04:55,552 INFO L158 Benchmark]: Witness Printer took 4.87ms. Allocated memory is still 8.5GB. Free memory is still 7.7GB. There was no memory consumed. Max. memory is 16.1GB.
[2022-11-02 20:04:55,554 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.33ms. Allocated memory is still 96.5MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 656.30ms. Allocated memory is still 144.7MB. Free memory was 110.0MB in the beginning and 110.1MB in the end (delta: -188.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 73.89ms. Allocated memory is still 144.7MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 60.56ms. Allocated memory is still 144.7MB. Free memory was 108.0MB in the beginning and 106.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 771.49ms. Allocated memory is still 144.7MB. Free memory was 106.2MB in the beginning and 89.9MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 27610.16ms. Allocated memory was 144.7MB in the beginning and 8.5GB in the end (delta: 8.3GB). Free memory was 89.4MB in the beginning and 7.7GB in the end (delta: -7.6GB). Peak memory consumption was 747.4MB. Max. memory is 16.1GB.
* Witness Printer took 4.87ms. Allocated memory is still 8.5GB. Free memory is still 7.7GB. 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[10];
VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=0, salethreads={3:0}, stopSales=0]
[L738] 0 numOfTickets = 10
VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0]
[L741] 0 numberOfSeatsSold = 0
VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0]
[L744] 0 stopSales = 0
VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0]
[L746] 0 int i = 0;
VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0]
[L746] COND TRUE 0 i < 10
VAL [\old(argc)=49, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0]
[L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0))
VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=0, numberOfSeatsSold=0, numOfTickets=10, pthread_create(&salethreads[i], 0, salethread, ((void *)0))=-1, salethreads={3:0}, stopSales=0]
[L746] 0 i++
VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0]
[L746] COND TRUE 0 i < 10
VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=10, salethreads={3:0}, stopSales=0]
[L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0))
VAL [\old(argc)=49, arg={0:0}, argc=49, argv={50:51}, argv={50:51}, i=1, numberOfSeatsSold=0, numOfTickets=10, 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=10, stopSales=0]
[L721] COND TRUE 1 !stopSales
VAL [arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0]
[L722] 1 int _numberOfSeatsSold = numberOfSeatsSold;
VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0]
[L721] 2 !stopSales
VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0]
[L721] COND TRUE 2 !stopSales
VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0]
[L722] 2 int _numberOfSeatsSold = numberOfSeatsSold;
VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0]
[L723] COND FALSE 1 !(_numberOfSeatsSold >= (10 - (((10 / 10) == 0) ? 1 : (10 / 10))))
VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=0, numOfTickets=10, stopSales=0]
[L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1
VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=10, stopSales=0]
[L722] 2 int _numberOfSeatsSold = numberOfSeatsSold;
VAL [_numberOfSeatsSold=0, arg={0:0}, arg={0:0}, numberOfSeatsSold=1, numOfTickets=10, 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.7s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, 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.4s 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: 2.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.2s 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s 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: 23.3s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.4s 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 20:04:55,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14593205-eccc-44a1-8844-53558d4d5b68/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