./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/semaphore-posix-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/semaphore-posix-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --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 d87a8225f17a9e0b8d5a6edaefcb34036eb1eea97d985b1c80b4cadc5f4bc42e
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:55:00,984 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:55:00,986 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:55:01,054 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:55:01,054 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:55:01,057 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:55:01,058 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:55:01,060 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:55:01,061 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:55:01,065 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:55:01,066 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:55:01,067 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:55:01,068 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:55:01,069 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:55:01,070 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:55:01,071 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:55:01,072 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:55:01,073 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:55:01,074 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:55:01,089 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:55:01,090 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:55:01,092 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:55:01,092 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:55:01,093 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:55:01,098 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:55:01,099 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:55:01,099 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:55:01,100 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:55:01,100 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:55:01,101 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:55:01,102 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:55:01,103 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:55:01,104 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:55:01,105 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:55:01,106 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:55:01,121 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:55:01,122 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:55:01,122 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:55:01,122 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:55:01,124 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:55:01,124 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:55:01,125 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-26 08:55:01,160 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:55:01,161 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:55:01,161 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:55:01,161 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:55:01,162 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:55:01,162 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:55:01,163 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:55:01,163 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:55:01,163 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:55:01,163 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:55:01,164 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:55:01,164 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:55:01,164 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 08:55:01,164 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:55:01,165 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:55:01,177 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:55:01,177 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:55:01,178 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:55:01,178 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:55:01,178 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:55:01,178 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:55:01,178 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:55:01,179 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:55:01,179 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:55:01,179 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:55:01,179 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:55:01,179 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:55:01,180 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:55:01,180 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:55:01,180 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:55:01,180 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 08:55:01,180 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 08:55:01,181 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:55:01,181 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:55:01,182 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:55:01,182 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:55:01,182 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:55:01,182 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/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 -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
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 -> d87a8225f17a9e0b8d5a6edaefcb34036eb1eea97d985b1c80b4cadc5f4bc42e
[2023-10-26 08:55:01,586 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:55:01,613 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:55:01,615 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:55:01,630 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:55:01,630 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:55:01,632 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/semaphore-posix-race.i
[2023-10-26 08:55:03,360 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:55:03,765 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:55:03,765 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/semaphore-posix-race.i
[2023-10-26 08:55:03,779 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/8cac316e6/f792562a88c443a197f9d2508ec5b8dc/FLAG412a4d00d
[2023-10-26 08:55:03,808 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/8cac316e6/f792562a88c443a197f9d2508ec5b8dc
[2023-10-26 08:55:03,810 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:55:03,813 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:55:03,815 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:55:03,817 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:55:03,819 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:55:03,830 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:55:03" (1/1) ...
[2023-10-26 08:55:03,831 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c84a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:03, skipping insertion in model container
[2023-10-26 08:55:03,831 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:55:03" (1/1) ...
[2023-10-26 08:55:03,837 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:55:03,902 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:55:04,163 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:55:04,535 WARN  L623        FunctionHandler]: Unknown extern function sem_wait
[2023-10-26 08:55:04,559 WARN  L623        FunctionHandler]: Unknown extern function sem_post
[2023-10-26 08:55:04,561 WARN  L623        FunctionHandler]: Unknown extern function sem_init
[2023-10-26 08:55:04,569 WARN  L623        FunctionHandler]: Unknown extern function sem_post
[2023-10-26 08:55:04,589 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:55:04,616 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:55:04,640 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:55:04,666 WARN  L623        FunctionHandler]: Unknown extern function sem_wait
[2023-10-26 08:55:04,681 WARN  L623        FunctionHandler]: Unknown extern function sem_post
[2023-10-26 08:55:04,683 WARN  L623        FunctionHandler]: Unknown extern function sem_init
[2023-10-26 08:55:04,690 WARN  L623        FunctionHandler]: Unknown extern function sem_post
[2023-10-26 08:55:04,698 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:55:04,811 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:55:04,812 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04 WrapperNode
[2023-10-26 08:55:04,812 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:55:04,813 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:55:04,814 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:55:04,814 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:55:04,819 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:04,867 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:04,919 INFO  L138                Inliner]: procedures = 278, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99
[2023-10-26 08:55:04,928 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:55:04,929 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:55:04,929 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:55:04,929 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:55:04,937 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:04,938 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:04,963 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:04,964 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:04,970 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:05,002 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:05,004 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:05,005 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:05,015 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:55:05,016 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:55:05,016 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:55:05,017 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:55:05,017 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (1/1) ...
[2023-10-26 08:55:05,021 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:55:05,041 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:55:05,084 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-26 08:55:05,125 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-26 08:55:05,132 INFO  L130     BoogieDeclarations]: Found specification of procedure sem_init
[2023-10-26 08:55:05,145 INFO  L130     BoogieDeclarations]: Found specification of procedure sem_post
[2023-10-26 08:55:05,145 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:55:05,151 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:55:05,151 INFO  L130     BoogieDeclarations]: Found specification of procedure sem_wait
[2023-10-26 08:55:05,151 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:55:05,151 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-26 08:55:05,151 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:55:05,151 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:55:05,152 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:55:05,152 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-26 08:55:05,152 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-26 08:55:05,152 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:55:05,152 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:55:05,152 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:55:05,152 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:55:05,154 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-26 08:55:05,401 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:55:05,410 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:55:05,824 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:55:05,829 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:55:05,841 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:55:05,843 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:55:05 BoogieIcfgContainer
[2023-10-26 08:55:05,844 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:55:05,845 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:55:05,846 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:55:05,848 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:55:05,848 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:55:03" (1/3) ...
[2023-10-26 08:55:05,849 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658dbe0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:55:05, skipping insertion in model container
[2023-10-26 08:55:05,849 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:55:04" (2/3) ...
[2023-10-26 08:55:05,850 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658dbe0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:55:05, skipping insertion in model container
[2023-10-26 08:55:05,850 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:55:05" (3/3) ...
[2023-10-26 08:55:05,851 INFO  L112   eAbstractionObserver]: Analyzing ICFG semaphore-posix-race.i
[2023-10-26 08:55:05,864 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:55:05,873 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:55:05,889 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-10-26 08:55:05,889 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:55:05,985 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:55:06,047 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 126 transitions, 260 flow
[2023-10-26 08:55:06,175 INFO  L130       PetriNetUnfolder]: 6/175 cut-off events.
[2023-10-26 08:55:06,175 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:55:06,193 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 175 events. 6/175 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 312 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. 
[2023-10-26 08:55:06,194 INFO  L82        GeneralOperation]: Start removeDead. Operand has 125 places, 126 transitions, 260 flow
[2023-10-26 08:55:06,198 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 125 places, 126 transitions, 260 flow
[2023-10-26 08:55:06,200 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:55:06,210 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 126 transitions, 260 flow
[2023-10-26 08:55:06,219 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 126 transitions, 260 flow
[2023-10-26 08:55:06,220 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 125 places, 126 transitions, 260 flow
[2023-10-26 08:55:06,295 INFO  L130       PetriNetUnfolder]: 6/175 cut-off events.
[2023-10-26 08:55:06,295 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:55:06,296 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 175 events. 6/175 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 312 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. 
[2023-10-26 08:55:06,298 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1904
[2023-10-26 08:55:12,803 INFO  L134        LiptonReduction]: Checked pairs total: 1485
[2023-10-26 08:55:12,804 INFO  L136        LiptonReduction]: Total number of compositions: 129
[2023-10-26 08:55:12,830 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:55:12,851 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;@42efec1b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:55:12,851 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-26 08:55:12,853 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-10-26 08:55:12,854 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:55:12,854 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:12,855 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-26 08:55:12,855 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:55:12,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:12,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 14451, now seen corresponding path program 1 times
[2023-10-26 08:55:12,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:12,866 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856147780]
[2023-10-26 08:55:12,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:12,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:13,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:13,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:13,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:13,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856147780]
[2023-10-26 08:55:13,164 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856147780] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:55:13,165 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:55:13,165 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-26 08:55:13,166 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531504258]
[2023-10-26 08:55:13,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:55:13,183 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-26 08:55:13,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:13,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-26 08:55:13,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-26 08:55:13,227 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255
[2023-10-26 08:55:13,234 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 40 flow. Second operand  has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:13,234 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:13,235 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255
[2023-10-26 08:55:13,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:13,292 INFO  L130       PetriNetUnfolder]: 6/26 cut-off events.
[2023-10-26 08:55:13,292 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:55:13,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58 conditions, 26 events. 6/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 5 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 32. Up to 25 conditions per place. 
[2023-10-26 08:55:13,294 INFO  L137   encePairwiseOnDemand]: 250/255 looper letters, 5 selfloop transitions, 0 changer transitions 5/11 dead transitions.
[2023-10-26 08:55:13,295 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 11 transitions, 50 flow
[2023-10-26 08:55:13,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-26 08:55:13,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-26 08:55:13,320 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions.
[2023-10-26 08:55:13,324 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.503921568627451
[2023-10-26 08:55:13,324 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 257 transitions.
[2023-10-26 08:55:13,325 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions.
[2023-10-26 08:55:13,328 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:13,330 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions.
[2023-10-26 08:55:13,334 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:13,338 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:13,339 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:13,355 INFO  L175             Difference]: Start difference. First operand has 18 places, 16 transitions, 40 flow. Second operand 2 states and 257 transitions.
[2023-10-26 08:55:13,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 11 transitions, 50 flow
[2023-10-26 08:55:13,359 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 14 places, 11 transitions, 50 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:55:13,360 INFO  L231             Difference]: Finished difference. Result has 14 places, 6 transitions, 17 flow
[2023-10-26 08:55:13,362 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=17, PETRI_PLACES=14, PETRI_TRANSITIONS=6}
[2023-10-26 08:55:13,364 INFO  L288   CegarLoopForPetriNet]: 18 programPoint places, -4 predicate places.
[2023-10-26 08:55:13,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 14 places, 6 transitions, 17 flow
[2023-10-26 08:55:13,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:13,366 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:13,366 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-10-26 08:55:13,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:55:13,370 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-26 08:55:13,371 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:13,371 INFO  L85        PathProgramCache]: Analyzing trace with hash 469065154, now seen corresponding path program 1 times
[2023-10-26 08:55:13,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:13,372 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143014457]
[2023-10-26 08:55:13,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:13,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:13,489 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:55:13,490 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:55:13,563 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:55:13,593 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:55:13,593 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:55:13,594 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-26 08:55:13,595 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-26 08:55:13,605 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-26 08:55:13,606 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-26 08:55:13,607 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-26 08:55:13,607 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-26 08:55:13,607 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-26 08:55:13,607 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:55:13,608 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1]
[2023-10-26 08:55:13,611 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:55:13,611 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-26 08:55:13,653 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-26 08:55:13,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 145 transitions, 308 flow
[2023-10-26 08:55:13,722 INFO  L130       PetriNetUnfolder]: 11/293 cut-off events.
[2023-10-26 08:55:13,728 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:55:13,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 307 conditions, 293 events. 11/293 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 653 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. 
[2023-10-26 08:55:13,729 INFO  L82        GeneralOperation]: Start removeDead. Operand has 145 places, 145 transitions, 308 flow
[2023-10-26 08:55:13,732 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 145 transitions, 308 flow
[2023-10-26 08:55:13,732 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:55:13,732 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 145 transitions, 308 flow
[2023-10-26 08:55:13,732 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 145 transitions, 308 flow
[2023-10-26 08:55:13,745 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 145 transitions, 308 flow
[2023-10-26 08:55:13,781 INFO  L130       PetriNetUnfolder]: 11/293 cut-off events.
[2023-10-26 08:55:13,797 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-26 08:55:13,799 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 307 conditions, 293 events. 11/293 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 653 event pairs, 0 based on Foata normal form. 0/261 useless extension candidates. Maximal degree in co-relation 177. Up to 8 conditions per place. 
[2023-10-26 08:55:13,802 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4828
[2023-10-26 08:55:19,787 INFO  L134        LiptonReduction]: Checked pairs total: 6140
[2023-10-26 08:55:19,787 INFO  L136        LiptonReduction]: Total number of compositions: 136
[2023-10-26 08:55:19,789 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:55:19,790 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;@42efec1b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:55:19,790 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-26 08:55:19,792 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-10-26 08:55:19,792 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:55:19,792 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:19,792 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-26 08:55:19,793 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:55:19,793 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:19,800 INFO  L85        PathProgramCache]: Analyzing trace with hash 24054, now seen corresponding path program 1 times
[2023-10-26 08:55:19,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:19,801 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895034280]
[2023-10-26 08:55:19,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:19,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:19,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:19,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:19,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:19,865 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895034280]
[2023-10-26 08:55:19,865 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895034280] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:55:19,865 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:55:19,865 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-26 08:55:19,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483853161]
[2023-10-26 08:55:19,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:55:19,866 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-26 08:55:19,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:19,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-26 08:55:19,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-26 08:55:19,869 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 138 out of 281
[2023-10-26 08:55:19,870 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 70 flow. Second operand  has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:19,870 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:19,870 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 281
[2023-10-26 08:55:19,870 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:19,992 INFO  L130       PetriNetUnfolder]: 168/362 cut-off events.
[2023-10-26 08:55:19,992 INFO  L131       PetriNetUnfolder]: For 30/30 co-relation queries the response was YES.
[2023-10-26 08:55:19,995 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 712 conditions, 362 events. 168/362 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1552 event pairs, 162 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 147. Up to 315 conditions per place. 
[2023-10-26 08:55:19,996 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 17 selfloop transitions, 0 changer transitions 0/22 dead transitions.
[2023-10-26 08:55:20,009 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 96 flow
[2023-10-26 08:55:20,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-26 08:55:20,010 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-26 08:55:20,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 297 transitions.
[2023-10-26 08:55:20,012 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5284697508896797
[2023-10-26 08:55:20,012 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 297 transitions.
[2023-10-26 08:55:20,013 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 297 transitions.
[2023-10-26 08:55:20,013 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:20,013 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 297 transitions.
[2023-10-26 08:55:20,014 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 148.5) internal successors, (297), 2 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,016 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,016 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,017 INFO  L175             Difference]: Start difference. First operand has 29 places, 26 transitions, 70 flow. Second operand 2 states and 297 transitions.
[2023-10-26 08:55:20,017 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 96 flow
[2023-10-26 08:55:20,018 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 96 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:55:20,019 INFO  L231             Difference]: Finished difference. Result has 26 places, 22 transitions, 62 flow
[2023-10-26 08:55:20,019 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=26, PETRI_TRANSITIONS=22}
[2023-10-26 08:55:20,019 INFO  L288   CegarLoopForPetriNet]: 29 programPoint places, -3 predicate places.
[2023-10-26 08:55:20,020 INFO  L495      AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 62 flow
[2023-10-26 08:55:20,020 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,020 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:20,020 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-26 08:55:20,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:55:20,020 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:55:20,021 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:20,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 756661494, now seen corresponding path program 1 times
[2023-10-26 08:55:20,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:20,021 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68118793]
[2023-10-26 08:55:20,021 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:20,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:20,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:20,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:20,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:20,125 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68118793]
[2023-10-26 08:55:20,128 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68118793] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:55:20,129 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:55:20,129 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:55:20,129 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266278119]
[2023-10-26 08:55:20,130 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:55:20,130 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:55:20,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:20,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:55:20,148 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:55:20,161 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281
[2023-10-26 08:55:20,162 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 62 flow. Second operand  has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,162 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:20,162 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281
[2023-10-26 08:55:20,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:20,307 INFO  L130       PetriNetUnfolder]: 208/427 cut-off events.
[2023-10-26 08:55:20,308 INFO  L131       PetriNetUnfolder]: For 35/35 co-relation queries the response was YES.
[2023-10-26 08:55:20,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 850 conditions, 427 events. 208/427 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1875 event pairs, 147 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 845. Up to 316 conditions per place. 
[2023-10-26 08:55:20,311 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 25 selfloop transitions, 3 changer transitions 2/34 dead transitions.
[2023-10-26 08:55:20,311 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 154 flow
[2023-10-26 08:55:20,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:55:20,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:55:20,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions.
[2023-10-26 08:55:20,313 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5065243179122183
[2023-10-26 08:55:20,313 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 427 transitions.
[2023-10-26 08:55:20,313 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions.
[2023-10-26 08:55:20,313 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:20,318 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions.
[2023-10-26 08:55:20,319 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,321 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,321 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,321 INFO  L175             Difference]: Start difference. First operand has 26 places, 22 transitions, 62 flow. Second operand 3 states and 427 transitions.
[2023-10-26 08:55:20,321 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 154 flow
[2023-10-26 08:55:20,322 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:55:20,323 INFO  L231             Difference]: Finished difference. Result has 29 places, 24 transitions, 81 flow
[2023-10-26 08:55:20,323 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=29, PETRI_TRANSITIONS=24}
[2023-10-26 08:55:20,337 INFO  L288   CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places.
[2023-10-26 08:55:20,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 29 places, 24 transitions, 81 flow
[2023-10-26 08:55:20,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,338 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:20,339 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:55:20,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:55:20,339 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:55:20,339 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:20,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -1681885421, now seen corresponding path program 1 times
[2023-10-26 08:55:20,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:20,341 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529958175]
[2023-10-26 08:55:20,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:20,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:20,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:20,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:55:20,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:20,413 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529958175]
[2023-10-26 08:55:20,413 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529958175] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:55:20,413 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:55:20,414 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:55:20,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275421029]
[2023-10-26 08:55:20,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:55:20,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:55:20,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:20,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:55:20,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:55:20,427 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281
[2023-10-26 08:55:20,427 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 81 flow. Second operand  has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,427 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:20,427 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281
[2023-10-26 08:55:20,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:20,684 INFO  L130       PetriNetUnfolder]: 217/430 cut-off events.
[2023-10-26 08:55:20,684 INFO  L131       PetriNetUnfolder]: For 139/143 co-relation queries the response was YES.
[2023-10-26 08:55:20,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 430 events. 217/430 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1794 event pairs, 149 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 1031. Up to 342 conditions per place. 
[2023-10-26 08:55:20,686 INFO  L137   encePairwiseOnDemand]: 277/281 looper letters, 25 selfloop transitions, 4 changer transitions 2/35 dead transitions.
[2023-10-26 08:55:20,693 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 173 flow
[2023-10-26 08:55:20,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:55:20,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:55:20,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2023-10-26 08:55:20,695 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.505338078291815
[2023-10-26 08:55:20,695 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2023-10-26 08:55:20,695 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2023-10-26 08:55:20,696 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:20,696 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2023-10-26 08:55:20,697 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,698 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,699 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,699 INFO  L175             Difference]: Start difference. First operand has 29 places, 24 transitions, 81 flow. Second operand 3 states and 426 transitions.
[2023-10-26 08:55:20,699 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 173 flow
[2023-10-26 08:55:20,700 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:55:20,708 INFO  L231             Difference]: Finished difference. Result has 31 places, 26 transitions, 102 flow
[2023-10-26 08:55:20,708 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=31, PETRI_TRANSITIONS=26}
[2023-10-26 08:55:20,708 INFO  L288   CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places.
[2023-10-26 08:55:20,709 INFO  L495      AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 102 flow
[2023-10-26 08:55:20,709 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:20,709 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:20,709 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-10-26 08:55:20,709 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-26 08:55:20,710 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-26 08:55:20,710 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:20,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -603955878, now seen corresponding path program 1 times
[2023-10-26 08:55:20,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:20,715 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755930949]
[2023-10-26 08:55:20,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:20,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:20,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:55:20,768 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:55:20,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:55:20,813 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:55:20,813 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:55:20,814 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining)
[2023-10-26 08:55:20,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-10-26 08:55:20,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-10-26 08:55:20,815 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining)
[2023-10-26 08:55:20,817 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-10-26 08:55:20,817 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-10-26 08:55:20,817 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-10-26 08:55:20,817 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-10-26 08:55:20,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-26 08:55:20,818 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-26 08:55:20,818 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-26 08:55:20,818 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-26 08:55:20,844 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-26 08:55:20,860 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 165 places, 164 transitions, 358 flow
[2023-10-26 08:55:20,937 INFO  L130       PetriNetUnfolder]: 21/490 cut-off events.
[2023-10-26 08:55:20,937 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-26 08:55:20,938 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 518 conditions, 490 events. 21/490 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1435 event pairs, 1 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 301. Up to 16 conditions per place. 
[2023-10-26 08:55:20,938 INFO  L82        GeneralOperation]: Start removeDead. Operand has 165 places, 164 transitions, 358 flow
[2023-10-26 08:55:20,940 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 165 places, 164 transitions, 358 flow
[2023-10-26 08:55:20,940 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:55:20,940 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 164 transitions, 358 flow
[2023-10-26 08:55:20,941 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 164 transitions, 358 flow
[2023-10-26 08:55:20,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 165 places, 164 transitions, 358 flow
[2023-10-26 08:55:21,007 INFO  L130       PetriNetUnfolder]: 21/490 cut-off events.
[2023-10-26 08:55:21,016 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-10-26 08:55:21,017 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 518 conditions, 490 events. 21/490 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1435 event pairs, 1 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 301. Up to 16 conditions per place. 
[2023-10-26 08:55:21,038 INFO  L119        LiptonReduction]: Number of co-enabled transitions 8262
[2023-10-26 08:55:26,617 INFO  L134        LiptonReduction]: Checked pairs total: 11545
[2023-10-26 08:55:26,617 INFO  L136        LiptonReduction]: Total number of compositions: 149
[2023-10-26 08:55:26,619 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:55:26,619 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;@42efec1b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:55:26,619 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2023-10-26 08:55:26,620 INFO  L130       PetriNetUnfolder]: 0/3 cut-off events.
[2023-10-26 08:55:26,620 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:55:26,620 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:26,621 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1]
[2023-10-26 08:55:26,621 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:55:26,621 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:26,621 INFO  L85        PathProgramCache]: Analyzing trace with hash 34676, now seen corresponding path program 1 times
[2023-10-26 08:55:26,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:26,621 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163263748]
[2023-10-26 08:55:26,621 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:26,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:26,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:26,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:26,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:26,657 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163263748]
[2023-10-26 08:55:26,657 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163263748] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:55:26,657 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:55:26,657 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-10-26 08:55:26,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499562405]
[2023-10-26 08:55:26,658 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:55:26,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-26 08:55:26,658 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:26,659 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-26 08:55:26,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-26 08:55:26,659 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 313
[2023-10-26 08:55:26,660 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 94 flow. Second operand  has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:26,660 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:26,660 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 313
[2023-10-26 08:55:26,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:26,964 INFO  L130       PetriNetUnfolder]: 1241/2159 cut-off events.
[2023-10-26 08:55:26,977 INFO  L131       PetriNetUnfolder]: For 277/277 co-relation queries the response was YES.
[2023-10-26 08:55:26,981 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4296 conditions, 2159 events. 1241/2159 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11544 event pairs, 1210 based on Foata normal form. 0/1948 useless extension candidates. Maximal degree in co-relation 718. Up to 1932 conditions per place. 
[2023-10-26 08:55:26,999 INFO  L137   encePairwiseOnDemand]: 309/313 looper letters, 22 selfloop transitions, 0 changer transitions 0/28 dead transitions.
[2023-10-26 08:55:26,999 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 28 transitions, 130 flow
[2023-10-26 08:55:27,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-26 08:55:27,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-26 08:55:27,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 336 transitions.
[2023-10-26 08:55:27,001 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.536741214057508
[2023-10-26 08:55:27,001 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 336 transitions.
[2023-10-26 08:55:27,001 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 336 transitions.
[2023-10-26 08:55:27,001 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:27,001 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 336 transitions.
[2023-10-26 08:55:27,002 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 168.0) internal successors, (336), 2 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,003 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,004 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,004 INFO  L175             Difference]: Start difference. First operand has 36 places, 32 transitions, 94 flow. Second operand 2 states and 336 transitions.
[2023-10-26 08:55:27,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 28 transitions, 130 flow
[2023-10-26 08:55:27,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:55:27,026 INFO  L231             Difference]: Finished difference. Result has 33 places, 28 transitions, 86 flow
[2023-10-26 08:55:27,026 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=28}
[2023-10-26 08:55:27,028 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2023-10-26 08:55:27,029 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 86 flow
[2023-10-26 08:55:27,029 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 156.0) internal successors, (312), 2 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,030 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:27,030 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-26 08:55:27,030 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-26 08:55:27,030 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:55:27,030 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:27,030 INFO  L85        PathProgramCache]: Analyzing trace with hash 1986149906, now seen corresponding path program 1 times
[2023-10-26 08:55:27,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:27,031 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333674136]
[2023-10-26 08:55:27,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:27,031 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:27,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:27,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:55:27,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:27,073 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333674136]
[2023-10-26 08:55:27,073 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333674136] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:55:27,073 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:55:27,073 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:55:27,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525062975]
[2023-10-26 08:55:27,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:55:27,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:55:27,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:27,074 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:55:27,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:55:27,089 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 313
[2023-10-26 08:55:27,090 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 86 flow. Second operand  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,090 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:27,090 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 313
[2023-10-26 08:55:27,090 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:27,616 INFO  L130       PetriNetUnfolder]: 1697/2841 cut-off events.
[2023-10-26 08:55:27,616 INFO  L131       PetriNetUnfolder]: For 348/348 co-relation queries the response was YES.
[2023-10-26 08:55:27,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5693 conditions, 2841 events. 1697/2841 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15605 event pairs, 1246 based on Foata normal form. 0/2446 useless extension candidates. Maximal degree in co-relation 5687. Up to 2214 conditions per place. 
[2023-10-26 08:55:27,645 INFO  L137   encePairwiseOnDemand]: 308/313 looper letters, 36 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2023-10-26 08:55:27,645 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 218 flow
[2023-10-26 08:55:27,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:55:27,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:55:27,647 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions.
[2023-10-26 08:55:27,647 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.516506922257721
[2023-10-26 08:55:27,647 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 485 transitions.
[2023-10-26 08:55:27,647 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions.
[2023-10-26 08:55:27,647 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:27,648 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions.
[2023-10-26 08:55:27,648 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,650 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,666 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,666 INFO  L175             Difference]: Start difference. First operand has 33 places, 28 transitions, 86 flow. Second operand 3 states and 485 transitions.
[2023-10-26 08:55:27,666 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 218 flow
[2023-10-26 08:55:27,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:55:27,669 INFO  L231             Difference]: Finished difference. Result has 36 places, 31 transitions, 112 flow
[2023-10-26 08:55:27,669 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=36, PETRI_TRANSITIONS=31}
[2023-10-26 08:55:27,670 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places.
[2023-10-26 08:55:27,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 112 flow
[2023-10-26 08:55:27,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,671 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:27,671 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:55:27,671 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-26 08:55:27,671 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:55:27,672 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:27,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 1862432176, now seen corresponding path program 1 times
[2023-10-26 08:55:27,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:27,672 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801968593]
[2023-10-26 08:55:27,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:27,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:27,683 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:55:27,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-10-26 08:55:27,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:55:27,769 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801968593]
[2023-10-26 08:55:27,770 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801968593] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:55:27,770 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:55:27,770 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:55:27,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537652256]
[2023-10-26 08:55:27,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:55:27,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:55:27,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:55:27,771 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:55:27,771 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:55:27,789 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 148 out of 313
[2023-10-26 08:55:27,789 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 112 flow. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:27,790 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:55:27,797 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 313
[2023-10-26 08:55:27,797 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:55:28,308 INFO  L130       PetriNetUnfolder]: 2007/3363 cut-off events.
[2023-10-26 08:55:28,309 INFO  L131       PetriNetUnfolder]: For 1193/1246 co-relation queries the response was YES.
[2023-10-26 08:55:28,328 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7879 conditions, 3363 events. 2007/3363 cut-off events. For 1193/1246 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19290 event pairs, 1381 based on Foata normal form. 0/2863 useless extension candidates. Maximal degree in co-relation 7871. Up to 2668 conditions per place. 
[2023-10-26 08:55:28,338 INFO  L137   encePairwiseOnDemand]: 308/313 looper letters, 37 selfloop transitions, 5 changer transitions 0/47 dead transitions.
[2023-10-26 08:55:28,338 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 248 flow
[2023-10-26 08:55:28,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:55:28,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:55:28,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions.
[2023-10-26 08:55:28,349 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5154419595314164
[2023-10-26 08:55:28,349 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 484 transitions.
[2023-10-26 08:55:28,349 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions.
[2023-10-26 08:55:28,350 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:55:28,350 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions.
[2023-10-26 08:55:28,351 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:28,352 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:28,353 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:28,354 INFO  L175             Difference]: Start difference. First operand has 36 places, 31 transitions, 112 flow. Second operand 3 states and 484 transitions.
[2023-10-26 08:55:28,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 248 flow
[2023-10-26 08:55:28,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:55:28,356 INFO  L231             Difference]: Finished difference. Result has 38 places, 34 transitions, 141 flow
[2023-10-26 08:55:28,356 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=38, PETRI_TRANSITIONS=34}
[2023-10-26 08:55:28,357 INFO  L288   CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places.
[2023-10-26 08:55:28,357 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 141 flow
[2023-10-26 08:55:28,357 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:55:28,358 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:55:28,358 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:55:28,358 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-26 08:55:28,358 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2023-10-26 08:55:28,358 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:55:28,358 INFO  L85        PathProgramCache]: Analyzing trace with hash -1940880712, now seen corresponding path program 1 times
[2023-10-26 08:55:28,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:55:28,359 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098899503]
[2023-10-26 08:55:28,359 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:55:28,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:55:28,403 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:55:28,417 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:55:28,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:55:28,452 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:55:28,452 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:55:28,453 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining)
[2023-10-26 08:55:28,453 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2023-10-26 08:55:28,453 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2023-10-26 08:55:28,453 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2023-10-26 08:55:28,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2023-10-26 08:55:28,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining)
[2023-10-26 08:55:28,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2023-10-26 08:55:28,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2023-10-26 08:55:28,454 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2023-10-26 08:55:28,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-26 08:55:28,455 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-26 08:55:28,458 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances
[2023-10-26 08:55:28,473 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-26 08:55:28,532 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:55:28 BasicIcfg
[2023-10-26 08:55:28,532 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-26 08:55:28,532 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-26 08:55:28,532 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-26 08:55:28,533 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-26 08:55:28,533 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:55:05" (3/4) ...
[2023-10-26 08:55:28,535 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-26 08:55:28,535 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-26 08:55:28,535 INFO  L158              Benchmark]: Toolchain (without parser) took 24722.36ms. Allocated memory was 46.5MB in the beginning and 83.6MB in the end (delta: 37.1MB). Free memory was 24.1MB in the beginning and 13.2MB in the end (delta: 10.9MB). Peak memory consumption was 48.0MB. Max. memory is 15.6GB.
[2023-10-26 08:55:28,536 INFO  L158              Benchmark]: CDTParser took 0.14ms. Allocated memory is still 40.9MB. Free memory was 16.4MB in the beginning and 16.4MB in the end (delta: 31.9kB). Peak memory consumption was 31.9kB. Max. memory is 15.6GB.
[2023-10-26 08:55:28,536 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 997.45ms. Allocated memory is still 46.5MB. Free memory was 24.0MB in the beginning and 17.2MB in the end (delta: 6.8MB). Peak memory consumption was 14.6MB. Max. memory is 15.6GB.
[2023-10-26 08:55:28,549 INFO  L158              Benchmark]: Boogie Procedure Inliner took 115.02ms. Allocated memory is still 46.5MB. Free memory was 17.0MB in the beginning and 14.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.5MB. Max. memory is 15.6GB.
[2023-10-26 08:55:28,550 INFO  L158              Benchmark]: Boogie Preprocessor took 86.99ms. Allocated memory is still 46.5MB. Free memory was 14.3MB in the beginning and 12.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 15.6GB.
[2023-10-26 08:55:28,550 INFO  L158              Benchmark]: RCFGBuilder took 827.38ms. Allocated memory is still 46.5MB. Free memory was 12.2MB in the beginning and 19.6MB in the end (delta: -7.4MB). Peak memory consumption was 5.4MB. Max. memory is 15.6GB.
[2023-10-26 08:55:28,551 INFO  L158              Benchmark]: TraceAbstraction took 22686.56ms. Allocated memory was 46.5MB in the beginning and 83.6MB in the end (delta: 37.1MB). Free memory was 18.9MB in the beginning and 13.2MB in the end (delta: 5.7MB). Peak memory consumption was 42.8MB. Max. memory is 15.6GB.
[2023-10-26 08:55:28,551 INFO  L158              Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 83.6MB. Free memory is still 13.2MB. There was no memory consumed. Max. memory is 15.6GB.
[2023-10-26 08:55:28,553 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.14ms. Allocated memory is still 40.9MB. Free memory was 16.4MB in the beginning and 16.4MB in the end (delta: 31.9kB). Peak memory consumption was 31.9kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 997.45ms. Allocated memory is still 46.5MB. Free memory was 24.0MB in the beginning and 17.2MB in the end (delta: 6.8MB). Peak memory consumption was 14.6MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 115.02ms. Allocated memory is still 46.5MB. Free memory was 17.0MB in the beginning and 14.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.5MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 86.99ms. Allocated memory is still 46.5MB. Free memory was 14.3MB in the beginning and 12.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 15.6GB.
 * RCFGBuilder took 827.38ms. Allocated memory is still 46.5MB. Free memory was 12.2MB in the beginning and 19.6MB in the end (delta: -7.4MB). Peak memory consumption was 5.4MB. Max. memory is 15.6GB.
 * TraceAbstraction took 22686.56ms. Allocated memory was 46.5MB in the beginning and 83.6MB in the end (delta: 37.1MB). Free memory was 18.9MB in the beginning and 13.2MB in the end (delta: 5.7MB). Peak memory consumption was 42.8MB. Max. memory is 15.6GB.
 * Witness Printer took 2.76ms. Allocated memory is still 83.6MB. Free memory is still 13.2MB. There was no memory consumed. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 6.6s, 125 PlacesBefore, 18 PlacesAfterwards, 126 TransitionsBefore, 16 TransitionsAfterwards, 1904 CoEnabledTransitionPairs, 8 FixpointIterations, 51 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 129 TotalNumberOfCompositions, 1485 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1485, independent: 1485, independent conditional: 0, independent unconditional: 1485, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 967, independent: 967, independent conditional: 0, independent unconditional: 967, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1485, independent: 518, independent conditional: 0, independent unconditional: 518, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 967, unknown conditional: 0, unknown unconditional: 967] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 6.1s, 145 PlacesBefore, 29 PlacesAfterwards, 145 TransitionsBefore, 26 TransitionsAfterwards, 4828 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 136 TotalNumberOfCompositions, 6140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4386, independent: 4295, independent conditional: 0, independent unconditional: 4295, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2506, independent: 2494, independent conditional: 0, independent unconditional: 2494, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4386, independent: 1801, independent conditional: 0, independent unconditional: 1801, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 2506, unknown conditional: 0, unknown unconditional: 2506] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 5.7s, 165 PlacesBefore, 36 PlacesAfterwards, 164 TransitionsBefore, 32 TransitionsAfterwards, 8262 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 149 TotalNumberOfCompositions, 11545 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8323, independent: 8181, independent conditional: 0, independent unconditional: 8181, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4296, independent: 4271, independent conditional: 0, independent unconditional: 4271, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8323, independent: 3910, independent conditional: 0, independent unconditional: 3910, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 4296, unknown conditional: 0, unknown unconditional: 4296] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1039]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1035]               0  int data = 0;
[L1036]               0  sem_t data_sem;
[L1045]               0  int threads_total = __VERIFIER_nondet_int();
[L1046]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1032]  COND FALSE   0  !(!cond)
[L1046]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1047]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1047]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1048]               0  int i = 0;
         VAL             [data=0, data_sem={1:0}, i=0, threads_total=5, tids={17:0}]
[L1048]  COND TRUE    0  i < threads_total
[L1049]  EXPR         0  \read(*tids)
[L1049]  EXPR         0  tids[i]
[L1049]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [\read(*tids)={-3:0}, arg={0:0}, data=0, data_sem={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=-2, threads_total=5, tids={17:0}]
[L1048]               0  i++
         VAL             [arg={0:0}, data=0, data_sem={1:0}, i=1, threads_total=5, tids={17:0}]
[L1048]  COND TRUE    0  i < threads_total
[L1049]  EXPR         0  \read(*tids)
[L1049]  EXPR         0  tids[i]
[L1039]               1  data = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=26, data_sem={1:0}]
[L1049]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
         VAL             [\read(*tids)={-3:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=26, data_sem={1:0}, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=-1, threads_total=5, tids={17:0}]
[L1039]               2  data = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=-4, arg={0:0}, arg={0:0}, data=-4, data = __VERIFIER_nondet_int()=22, data_sem={1:0}]

Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements
	* C: tids[i] [1049]
	* C: tids[i] [1049]
	* C: tids[i] [1049]
	* C: tids[i] [1049]
and
	C: data = __VERIFIER_nondet_int() [1039]

  - UnprovableResult [Line: 1049]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1055]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1053]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1049]: 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, 141 locations, 7 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: 7.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 2, 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.1s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 1 ConstructedInterpolants, 0 QuantifiedInterpolants, 1 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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, 159 locations, 8 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: 7.2s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 8 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 8, 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.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 177 locations, 9 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: 7.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 22 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-10-26 08:55:28,647 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/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
