./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/per-thread-index-bitmask-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/per-thread-index-bitmask-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 974d17413865f39a607640a826612ee43ba82182a41f559c5bb885b5b3327e06
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:41:31,225 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:41:31,227 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:41:31,265 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:41:31,285 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:41:31,288 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:41:31,289 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:41:31,292 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:41:31,293 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:41:31,297 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:41:31,298 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:41:31,299 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:41:31,304 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:41:31,307 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:41:31,309 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:41:31,310 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:41:31,312 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:41:31,312 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:41:31,313 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:41:31,335 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:41:31,337 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:41:31,339 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:41:31,340 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:41:31,340 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:41:31,347 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:41:31,347 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:41:31,348 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:41:31,349 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:41:31,349 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:41:31,350 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:41:31,350 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:41:31,351 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:41:31,353 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:41:31,354 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:41:31,355 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:41:31,355 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:41:31,356 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:41:31,356 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:41:31,356 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:41:31,357 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:41:31,357 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:41:31,358 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:41:31,403 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:41:31,403 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:41:31,404 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:41:31,404 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:41:31,404 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:41:31,405 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:41:31,405 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:41:31,405 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:41:31,405 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:41:31,406 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:41:31,406 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:41:31,407 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:41:31,407 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-26 08:41:31,407 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:41:31,407 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:41:31,407 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:41:31,407 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:41:31,407 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:41:31,408 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:41:31,408 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:41:31,408 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:41:31,408 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:41:31,408 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:41:31,408 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:41:31,409 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:41:31,409 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:41:31,409 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:41:31,409 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:41:31,409 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:41:31,410 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:41:31,410 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-26 08:41:31,410 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-26 08:41:31,411 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:41:31,411 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:41:31,411 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:41:31,411 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:41:31,411 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:41:31,411 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 -> 974d17413865f39a607640a826612ee43ba82182a41f559c5bb885b5b3327e06
[2023-10-26 08:41:31,811 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:41:31,844 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:41:31,846 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:41:31,847 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:41:31,847 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:41:31,848 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-10-26 08:41:33,500 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:41:33,922 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:41:33,934 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-10-26 08:41:33,961 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/7b2b24f10/058bccd23e0c476eba0cf9a96711412c/FLAG2daa7530e
[2023-10-26 08:41:33,990 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/7b2b24f10/058bccd23e0c476eba0cf9a96711412c
[2023-10-26 08:41:33,992 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:41:33,994 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:41:33,996 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:41:33,996 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:41:33,999 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:41:34,010 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:41:33" (1/1) ...
[2023-10-26 08:41:34,013 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d59150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34, skipping insertion in model container
[2023-10-26 08:41:34,013 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:41:33" (1/1) ...
[2023-10-26 08:41:34,018 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:41:34,098 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:41:34,358 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:41:34,773 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-26 08:41:34,789 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:41:34,796 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:41:34,836 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:41:34,865 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-26 08:41:34,888 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:41:34,976 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:41:34,976 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34 WrapperNode
[2023-10-26 08:41:34,977 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:41:34,978 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:41:34,978 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:41:34,978 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:41:34,984 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:41:34" (1/1) ...
[2023-10-26 08:41:35,032 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:41:34" (1/1) ...
[2023-10-26 08:41:35,083 INFO  L138                Inliner]: procedures = 278, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103
[2023-10-26 08:41:35,083 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:41:35,084 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:41:35,085 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:41:35,085 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:41:35,094 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,095 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,112 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,113 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,122 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,138 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,154 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,166 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,169 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:41:35,170 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:41:35,170 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:41:35,170 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:41:35,171 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (1/1) ...
[2023-10-26 08:41:35,175 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:41:35,193 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:41:35,207 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:41:35,247 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:41:35,255 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:41:35,256 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:41:35,256 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:41:35,256 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-26 08:41:35,268 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-26 08:41:35,268 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-26 08:41:35,269 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:41:35,269 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2023-10-26 08:41:35,269 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:41:35,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:41:35,269 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:41:35,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:41:35,271 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:41:35,482 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:41:35,484 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:41:35,980 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:41:36,000 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:41:36,002 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:41:36,008 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:41:36 BoogieIcfgContainer
[2023-10-26 08:41:36,008 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:41:36,010 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:41:36,010 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:41:36,012 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:41:36,019 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:41:33" (1/3) ...
[2023-10-26 08:41:36,021 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a2684a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:41:36, skipping insertion in model container
[2023-10-26 08:41:36,021 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:34" (2/3) ...
[2023-10-26 08:41:36,022 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a2684a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:41:36, skipping insertion in model container
[2023-10-26 08:41:36,022 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:41:36" (3/3) ...
[2023-10-26 08:41:36,023 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2023-10-26 08:41:36,029 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:41:36,038 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:41:36,039 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2023-10-26 08:41:36,039 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:41:36,186 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:41:36,255 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2023-10-26 08:41:36,406 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2023-10-26 08:41:36,421 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:41:36,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 7/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 413 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2023-10-26 08:41:36,426 INFO  L82        GeneralOperation]: Start removeDead. Operand has 147 places, 149 transitions, 306 flow
[2023-10-26 08:41:36,434 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 306 flow
[2023-10-26 08:41:36,438 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:41:36,467 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 306 flow
[2023-10-26 08:41:36,479 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 306 flow
[2023-10-26 08:41:36,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2023-10-26 08:41:36,539 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2023-10-26 08:41:36,555 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:41:36,556 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 7/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 413 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 108. Up to 4 conditions per place. 
[2023-10-26 08:41:36,561 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3942
[2023-10-26 08:41:40,012 INFO  L134        LiptonReduction]: Checked pairs total: 25074
[2023-10-26 08:41:40,013 INFO  L136        LiptonReduction]: Total number of compositions: 96
[2023-10-26 08:41:40,025 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:41:40,054 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;@232e5cb6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:41:40,054 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-10-26 08:41:40,055 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-26 08:41:40,056 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:41:40,056 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:40,056 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-26 08:41:40,057 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:40,060 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:40,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 480, now seen corresponding path program 1 times
[2023-10-26 08:41:40,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:40,082 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822399260]
[2023-10-26 08:41:40,083 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:40,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:40,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:40,227 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:41:40,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:40,228 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822399260]
[2023-10-26 08:41:40,228 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822399260] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:40,228 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:40,229 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-26 08:41:40,232 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385299179]
[2023-10-26 08:41:40,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:40,239 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-26 08:41:40,240 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:40,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-26 08:41:40,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-26 08:41:40,297 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 245
[2023-10-26 08:41:40,300 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 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:41:40,301 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:40,301 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 245
[2023-10-26 08:41:40,302 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:40,481 INFO  L130       PetriNetUnfolder]: 85/397 cut-off events.
[2023-10-26 08:41:40,482 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-26 08:41:40,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 606 conditions, 397 events. 85/397 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2129 event pairs, 84 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 536. Up to 203 conditions per place. 
[2023-10-26 08:41:40,487 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 23 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2023-10-26 08:41:40,487 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 186 flow
[2023-10-26 08:41:40,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-26 08:41:40,490 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-26 08:41:40,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions.
[2023-10-26 08:41:40,518 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6326530612244898
[2023-10-26 08:41:40,518 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 310 transitions.
[2023-10-26 08:41:40,519 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions.
[2023-10-26 08:41:40,521 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:40,523 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions.
[2023-10-26 08:41:40,528 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 155.0) internal successors, (310), 2 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:41:40,552 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 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:41:40,553 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 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:41:40,555 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 310 transitions.
[2023-10-26 08:41:40,555 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 186 flow
[2023-10-26 08:41:40,557 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:41:40,559 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2023-10-26 08:41:40,561 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2023-10-26 08:41:40,564 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2023-10-26 08:41:40,565 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2023-10-26 08:41:40,566 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 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:41:40,575 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:40,575 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-26 08:41:40,576 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-26 08:41:40,576 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:40,577 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:40,577 INFO  L85        PathProgramCache]: Analyzing trace with hash 472525, now seen corresponding path program 1 times
[2023-10-26 08:41:40,577 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:40,578 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590563726]
[2023-10-26 08:41:40,578 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:40,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:40,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:40,790 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:41:40,790 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:40,795 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590563726]
[2023-10-26 08:41:40,795 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590563726] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:40,795 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:40,796 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:41:40,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138323758]
[2023-10-26 08:41:40,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:40,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:41:40,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:40,798 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:41:40,798 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:41:40,833 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 245
[2023-10-26 08:41:40,849 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 140 flow. Second operand  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:41:40,850 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:40,850 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 245
[2023-10-26 08:41:40,850 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:41,012 INFO  L130       PetriNetUnfolder]: 132/476 cut-off events.
[2023-10-26 08:41:41,013 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-26 08:41:41,015 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 797 conditions, 476 events. 132/476 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2444 event pairs, 67 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 793. Up to 172 conditions per place. 
[2023-10-26 08:41:41,017 INFO  L137   encePairwiseOnDemand]: 234/245 looper letters, 43 selfloop transitions, 8 changer transitions 0/88 dead transitions.
[2023-10-26 08:41:41,018 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 286 flow
[2023-10-26 08:41:41,018 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:41:41,018 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:41:41,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions.
[2023-10-26 08:41:41,020 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6122448979591837
[2023-10-26 08:41:41,020 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 450 transitions.
[2023-10-26 08:41:41,020 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions.
[2023-10-26 08:41:41,021 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:41,021 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions.
[2023-10-26 08:41:41,022 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 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:41:41,025 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 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:41:41,026 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 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:41:41,041 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 450 transitions.
[2023-10-26 08:41:41,041 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 286 flow
[2023-10-26 08:41:41,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:41:41,045 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2023-10-26 08:41:41,045 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2023-10-26 08:41:41,046 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2023-10-26 08:41:41,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2023-10-26 08:41:41,046 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:41:41,046 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:41,047 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:41,047 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-26 08:41:41,047 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:41,049 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:41,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738520444, now seen corresponding path program 1 times
[2023-10-26 08:41:41,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:41,051 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823768420]
[2023-10-26 08:41:41,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:41,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:41,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:41,349 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:41:41,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:41,350 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823768420]
[2023-10-26 08:41:41,350 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823768420] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:41,351 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:41,351 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:41:41,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489287400]
[2023-10-26 08:41:41,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:41,352 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:41:41,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:41,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:41:41,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:41:41,403 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 245
[2023-10-26 08:41:41,406 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 210 flow. Second operand  has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 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:41:41,411 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:41,411 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 245
[2023-10-26 08:41:41,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:41,583 INFO  L130       PetriNetUnfolder]: 104/565 cut-off events.
[2023-10-26 08:41:41,585 INFO  L131       PetriNetUnfolder]: For 92/94 co-relation queries the response was YES.
[2023-10-26 08:41:41,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 960 conditions, 565 events. 104/565 cut-off events. For 92/94 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3403 event pairs, 15 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 954. Up to 218 conditions per place. 
[2023-10-26 08:41:41,587 INFO  L137   encePairwiseOnDemand]: 241/245 looper letters, 41 selfloop transitions, 3 changer transitions 1/91 dead transitions.
[2023-10-26 08:41:41,587 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 350 flow
[2023-10-26 08:41:41,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:41:41,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:41:41,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions.
[2023-10-26 08:41:41,589 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5969387755102041
[2023-10-26 08:41:41,589 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 585 transitions.
[2023-10-26 08:41:41,589 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions.
[2023-10-26 08:41:41,589 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:41,589 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions.
[2023-10-26 08:41:41,591 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 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:41:41,592 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 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:41:41,593 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 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:41:41,593 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 4 states and 585 transitions.
[2023-10-26 08:41:41,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 350 flow
[2023-10-26 08:41:41,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 08:41:41,599 INFO  L231             Difference]: Finished difference. Result has 76 places, 75 transitions, 210 flow
[2023-10-26 08:41:41,599 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=76, PETRI_TRANSITIONS=75}
[2023-10-26 08:41:41,606 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 7 predicate places.
[2023-10-26 08:41:41,606 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 210 flow
[2023-10-26 08:41:41,607 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 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:41:41,607 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:41,607 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:41,607 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-26 08:41:41,610 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:41,611 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:41,611 INFO  L85        PathProgramCache]: Analyzing trace with hash -1699318889, now seen corresponding path program 1 times
[2023-10-26 08:41:41,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:41,611 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131589798]
[2023-10-26 08:41:41,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:41,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:41,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:42,060 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:41:42,060 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:42,061 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131589798]
[2023-10-26 08:41:42,061 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131589798] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:42,061 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:42,062 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:41:42,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234605343]
[2023-10-26 08:41:42,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:42,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:41:42,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:42,063 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:41:42,064 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:41:42,265 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 245
[2023-10-26 08:41:42,266 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 210 flow. Second operand  has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 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:41:42,266 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:42,266 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 245
[2023-10-26 08:41:42,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:42,643 INFO  L130       PetriNetUnfolder]: 395/1189 cut-off events.
[2023-10-26 08:41:42,644 INFO  L131       PetriNetUnfolder]: For 92/95 co-relation queries the response was YES.
[2023-10-26 08:41:42,645 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 1189 events. 395/1189 cut-off events. For 92/95 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7813 event pairs, 125 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 2343. Up to 524 conditions per place. 
[2023-10-26 08:41:42,649 INFO  L137   encePairwiseOnDemand]: 222/245 looper letters, 88 selfloop transitions, 29 changer transitions 0/143 dead transitions.
[2023-10-26 08:41:42,649 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 143 transitions, 606 flow
[2023-10-26 08:41:42,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:41:42,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:41:42,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions.
[2023-10-26 08:41:42,658 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5591836734693878
[2023-10-26 08:41:42,661 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 822 transitions.
[2023-10-26 08:41:42,661 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions.
[2023-10-26 08:41:42,662 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:42,662 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions.
[2023-10-26 08:41:42,663 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 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:41:42,665 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 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:41:42,668 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 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:41:42,681 INFO  L175             Difference]: Start difference. First operand has 76 places, 75 transitions, 210 flow. Second operand 6 states and 822 transitions.
[2023-10-26 08:41:42,681 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 143 transitions, 606 flow
[2023-10-26 08:41:42,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 143 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:41:42,687 INFO  L231             Difference]: Finished difference. Result has 85 places, 104 transitions, 428 flow
[2023-10-26 08:41:42,687 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=85, PETRI_TRANSITIONS=104}
[2023-10-26 08:41:42,688 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 16 predicate places.
[2023-10-26 08:41:42,688 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 428 flow
[2023-10-26 08:41:42,689 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.33333333333333) internal successors, (716), 6 states have internal predecessors, (716), 0 states have call successors, (0), 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:41:42,689 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:42,689 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:42,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-26 08:41:42,690 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:42,690 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:42,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 120947037, now seen corresponding path program 1 times
[2023-10-26 08:41:42,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:42,691 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180212781]
[2023-10-26 08:41:42,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:42,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:42,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:42,726 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:41:42,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:42,727 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180212781]
[2023-10-26 08:41:42,727 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180212781] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:42,727 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:42,727 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:41:42,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539113981]
[2023-10-26 08:41:42,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:42,728 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:41:42,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:42,741 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:41:42,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:41:42,759 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2023-10-26 08:41:42,759 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 104 transitions, 428 flow. Second operand  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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:41:42,760 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:42,760 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2023-10-26 08:41:42,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:42,961 INFO  L130       PetriNetUnfolder]: 206/854 cut-off events.
[2023-10-26 08:41:42,962 INFO  L131       PetriNetUnfolder]: For 246/261 co-relation queries the response was YES.
[2023-10-26 08:41:42,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 854 events. 206/854 cut-off events. For 246/261 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5761 event pairs, 90 based on Foata normal form. 3/834 useless extension candidates. Maximal degree in co-relation 1942. Up to 353 conditions per place. 
[2023-10-26 08:41:42,966 INFO  L137   encePairwiseOnDemand]: 240/245 looper letters, 39 selfloop transitions, 6 changer transitions 0/114 dead transitions.
[2023-10-26 08:41:42,971 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 114 transitions, 548 flow
[2023-10-26 08:41:42,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:41:42,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:41:42,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions.
[2023-10-26 08:41:42,973 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5904761904761905
[2023-10-26 08:41:42,973 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 434 transitions.
[2023-10-26 08:41:42,973 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions.
[2023-10-26 08:41:42,973 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:42,973 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions.
[2023-10-26 08:41:42,974 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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:41:42,975 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 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:41:42,976 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 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:41:42,977 INFO  L175             Difference]: Start difference. First operand has 85 places, 104 transitions, 428 flow. Second operand 3 states and 434 transitions.
[2023-10-26 08:41:42,977 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 114 transitions, 548 flow
[2023-10-26 08:41:42,982 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 114 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:41:43,000 INFO  L231             Difference]: Finished difference. Result has 88 places, 108 transitions, 470 flow
[2023-10-26 08:41:43,000 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=88, PETRI_TRANSITIONS=108}
[2023-10-26 08:41:43,002 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2023-10-26 08:41:43,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 108 transitions, 470 flow
[2023-10-26 08:41:43,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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:41:43,003 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:43,003 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:43,003 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-26 08:41:43,003 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:43,003 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:43,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -957762772, now seen corresponding path program 1 times
[2023-10-26 08:41:43,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:43,004 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403119432]
[2023-10-26 08:41:43,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:43,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:43,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:43,054 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:41:43,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:43,055 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403119432]
[2023-10-26 08:41:43,055 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403119432] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:43,055 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:43,055 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:41:43,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368144250]
[2023-10-26 08:41:43,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:43,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:41:43,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:43,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:41:43,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:41:43,069 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 245
[2023-10-26 08:41:43,069 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 108 transitions, 470 flow. Second operand  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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:41:43,069 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:43,069 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 245
[2023-10-26 08:41:43,070 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:43,257 INFO  L130       PetriNetUnfolder]: 221/839 cut-off events.
[2023-10-26 08:41:43,257 INFO  L131       PetriNetUnfolder]: For 364/387 co-relation queries the response was YES.
[2023-10-26 08:41:43,259 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 839 events. 221/839 cut-off events. For 364/387 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5449 event pairs, 32 based on Foata normal form. 23/838 useless extension candidates. Maximal degree in co-relation 2026. Up to 361 conditions per place. 
[2023-10-26 08:41:43,261 INFO  L137   encePairwiseOnDemand]: 241/245 looper letters, 46 selfloop transitions, 2 changer transitions 1/119 dead transitions.
[2023-10-26 08:41:43,272 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 612 flow
[2023-10-26 08:41:43,272 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:41:43,272 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:41:43,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions.
[2023-10-26 08:41:43,274 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6095238095238096
[2023-10-26 08:41:43,274 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 448 transitions.
[2023-10-26 08:41:43,274 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions.
[2023-10-26 08:41:43,274 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:43,274 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions.
[2023-10-26 08:41:43,281 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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:41:43,283 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 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:41:43,283 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 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:41:43,283 INFO  L175             Difference]: Start difference. First operand has 88 places, 108 transitions, 470 flow. Second operand 3 states and 448 transitions.
[2023-10-26 08:41:43,283 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 612 flow
[2023-10-26 08:41:43,286 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 604 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:41:43,288 INFO  L231             Difference]: Finished difference. Result has 88 places, 107 transitions, 468 flow
[2023-10-26 08:41:43,288 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=88, PETRI_TRANSITIONS=107}
[2023-10-26 08:41:43,290 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2023-10-26 08:41:43,305 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 468 flow
[2023-10-26 08:41:43,305 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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:41:43,307 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:43,307 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:43,307 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-26 08:41:43,307 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:43,308 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:43,308 INFO  L85        PathProgramCache]: Analyzing trace with hash -949124360, now seen corresponding path program 1 times
[2023-10-26 08:41:43,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:43,309 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473739810]
[2023-10-26 08:41:43,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:43,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:43,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:43,802 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:41:43,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:43,802 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473739810]
[2023-10-26 08:41:43,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473739810] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:43,803 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:43,804 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:41:43,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293828999]
[2023-10-26 08:41:43,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:43,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:41:43,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:43,805 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:41:43,805 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:41:43,946 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245
[2023-10-26 08:41:43,947 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 468 flow. Second operand  has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 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:41:43,947 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:43,947 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245
[2023-10-26 08:41:43,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:44,598 INFO  L130       PetriNetUnfolder]: 565/1518 cut-off events.
[2023-10-26 08:41:44,599 INFO  L131       PetriNetUnfolder]: For 805/819 co-relation queries the response was YES.
[2023-10-26 08:41:44,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 1518 events. 565/1518 cut-off events. For 805/819 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10302 event pairs, 170 based on Foata normal form. 2/1446 useless extension candidates. Maximal degree in co-relation 4201. Up to 966 conditions per place. 
[2023-10-26 08:41:44,606 INFO  L137   encePairwiseOnDemand]: 222/245 looper letters, 127 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2023-10-26 08:41:44,621 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 241 transitions, 1452 flow
[2023-10-26 08:41:44,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:41:44,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:41:44,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions.
[2023-10-26 08:41:44,624 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5829931972789115
[2023-10-26 08:41:44,624 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 857 transitions.
[2023-10-26 08:41:44,624 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions.
[2023-10-26 08:41:44,625 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:44,625 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions.
[2023-10-26 08:41:44,626 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 142.83333333333334) internal successors, (857), 6 states have internal predecessors, (857), 0 states have call successors, (0), 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:41:44,628 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 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:41:44,628 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 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:41:44,629 INFO  L175             Difference]: Start difference. First operand has 88 places, 107 transitions, 468 flow. Second operand 6 states and 857 transitions.
[2023-10-26 08:41:44,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 241 transitions, 1452 flow
[2023-10-26 08:41:44,641 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1436 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-10-26 08:41:44,645 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2023-10-26 08:41:44,645 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=95, PETRI_TRANSITIONS=188}
[2023-10-26 08:41:44,647 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-10-26 08:41:44,647 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2023-10-26 08:41:44,647 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 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:41:44,648 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:44,648 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:44,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-26 08:41:44,648 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:44,649 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:44,649 INFO  L85        PathProgramCache]: Analyzing trace with hash 1013407062, now seen corresponding path program 1 times
[2023-10-26 08:41:44,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:44,659 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188164263]
[2023-10-26 08:41:44,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:44,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:44,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:45,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:41:45,306 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:45,306 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188164263]
[2023-10-26 08:41:45,307 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188164263] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:45,307 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:45,307 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-26 08:41:45,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311554991]
[2023-10-26 08:41:45,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:45,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-26 08:41:45,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:45,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-26 08:41:45,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-26 08:41:45,737 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245
[2023-10-26 08:41:45,738 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 188 transitions, 1212 flow. Second operand  has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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:41:45,738 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:45,738 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245
[2023-10-26 08:41:45,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:46,202 INFO  L130       PetriNetUnfolder]: 524/1426 cut-off events.
[2023-10-26 08:41:46,202 INFO  L131       PetriNetUnfolder]: For 1458/1470 co-relation queries the response was YES.
[2023-10-26 08:41:46,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 1426 events. 524/1426 cut-off events. For 1458/1470 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9589 event pairs, 212 based on Foata normal form. 39/1421 useless extension candidates. Maximal degree in co-relation 4995. Up to 1052 conditions per place. 
[2023-10-26 08:41:46,210 INFO  L137   encePairwiseOnDemand]: 236/245 looper letters, 158 selfloop transitions, 7 changer transitions 1/209 dead transitions.
[2023-10-26 08:41:46,211 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 209 transitions, 1668 flow
[2023-10-26 08:41:46,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:41:46,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:41:46,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions.
[2023-10-26 08:41:46,214 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5102040816326531
[2023-10-26 08:41:46,214 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 875 transitions.
[2023-10-26 08:41:46,214 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions.
[2023-10-26 08:41:46,215 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:46,215 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions.
[2023-10-26 08:41:46,216 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 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:41:46,227 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 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:41:46,228 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 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:41:46,228 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 875 transitions.
[2023-10-26 08:41:46,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 209 transitions, 1668 flow
[2023-10-26 08:41:46,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 209 transitions, 1614 flow, removed 27 selfloop flow, removed 0 redundant places.
[2023-10-26 08:41:46,267 INFO  L231             Difference]: Finished difference. Result has 102 places, 189 transitions, 1208 flow
[2023-10-26 08:41:46,268 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1208, PETRI_PLACES=102, PETRI_TRANSITIONS=189}
[2023-10-26 08:41:46,269 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 33 predicate places.
[2023-10-26 08:41:46,270 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 189 transitions, 1208 flow
[2023-10-26 08:41:46,270 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 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:41:46,270 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:46,271 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:46,271 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-26 08:41:46,273 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:46,273 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:46,273 INFO  L85        PathProgramCache]: Analyzing trace with hash -1627961114, now seen corresponding path program 1 times
[2023-10-26 08:41:46,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:46,273 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030095173]
[2023-10-26 08:41:46,273 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:46,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:46,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:46,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:41:46,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:46,832 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030095173]
[2023-10-26 08:41:46,832 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030095173] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:46,833 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:46,833 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-26 08:41:46,833 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935832274]
[2023-10-26 08:41:46,833 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:46,833 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-26 08:41:46,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:46,834 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-26 08:41:46,834 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-26 08:41:47,279 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2023-10-26 08:41:47,280 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 189 transitions, 1208 flow. Second operand  has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 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:41:47,280 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:47,280 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2023-10-26 08:41:47,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:47,861 INFO  L130       PetriNetUnfolder]: 540/1423 cut-off events.
[2023-10-26 08:41:47,861 INFO  L131       PetriNetUnfolder]: For 1470/1481 co-relation queries the response was YES.
[2023-10-26 08:41:47,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5119 conditions, 1423 events. 540/1423 cut-off events. For 1470/1481 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9344 event pairs, 165 based on Foata normal form. 33/1409 useless extension candidates. Maximal degree in co-relation 5096. Up to 634 conditions per place. 
[2023-10-26 08:41:47,869 INFO  L137   encePairwiseOnDemand]: 232/245 looper letters, 254 selfloop transitions, 62 changer transitions 1/343 dead transitions.
[2023-10-26 08:41:47,878 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 343 transitions, 2754 flow
[2023-10-26 08:41:47,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-10-26 08:41:47,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-10-26 08:41:47,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions.
[2023-10-26 08:41:47,891 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.55
[2023-10-26 08:41:47,891 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions.
[2023-10-26 08:41:47,891 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions.
[2023-10-26 08:41:47,891 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:47,892 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions.
[2023-10-26 08:41:47,893 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 134.75) internal successors, (1078), 8 states have internal predecessors, (1078), 0 states have call successors, (0), 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:41:47,895 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 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:41:47,896 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 0 states have call successors, (0), 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:41:47,896 INFO  L175             Difference]: Start difference. First operand has 102 places, 189 transitions, 1208 flow. Second operand 8 states and 1078 transitions.
[2023-10-26 08:41:47,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 343 transitions, 2754 flow
[2023-10-26 08:41:47,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 343 transitions, 2724 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-10-26 08:41:47,930 INFO  L231             Difference]: Finished difference. Result has 114 places, 216 transitions, 1638 flow
[2023-10-26 08:41:47,931 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1638, PETRI_PLACES=114, PETRI_TRANSITIONS=216}
[2023-10-26 08:41:47,931 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 45 predicate places.
[2023-10-26 08:41:47,931 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 216 transitions, 1638 flow
[2023-10-26 08:41:47,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 115.875) internal successors, (927), 8 states have internal predecessors, (927), 0 states have call successors, (0), 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:41:47,932 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:47,932 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:47,932 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-26 08:41:47,932 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:47,933 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:47,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -776168387, now seen corresponding path program 1 times
[2023-10-26 08:41:47,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:47,935 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881668377]
[2023-10-26 08:41:47,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:47,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:47,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:48,003 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:41:48,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:48,005 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881668377]
[2023-10-26 08:41:48,006 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881668377] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:48,006 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:48,006 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:41:48,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632207859]
[2023-10-26 08:41:48,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:48,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:41:48,007 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:48,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:41:48,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:41:48,025 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 245
[2023-10-26 08:41:48,026 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 216 transitions, 1638 flow. Second operand  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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:41:48,026 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:48,026 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 245
[2023-10-26 08:41:48,026 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:48,318 INFO  L130       PetriNetUnfolder]: 407/1207 cut-off events.
[2023-10-26 08:41:48,318 INFO  L131       PetriNetUnfolder]: For 3288/3310 co-relation queries the response was YES.
[2023-10-26 08:41:48,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4814 conditions, 1207 events. 407/1207 cut-off events. For 3288/3310 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7975 event pairs, 93 based on Foata normal form. 6/1169 useless extension candidates. Maximal degree in co-relation 4785. Up to 449 conditions per place. 
[2023-10-26 08:41:48,324 INFO  L137   encePairwiseOnDemand]: 239/245 looper letters, 46 selfloop transitions, 10 changer transitions 28/233 dead transitions.
[2023-10-26 08:41:48,324 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 233 transitions, 1857 flow
[2023-10-26 08:41:48,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:41:48,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:41:48,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2023-10-26 08:41:48,326 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6
[2023-10-26 08:41:48,326 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2023-10-26 08:41:48,326 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2023-10-26 08:41:48,326 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:48,326 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2023-10-26 08:41:48,328 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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:41:48,329 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 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:41:48,330 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 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:41:48,330 INFO  L175             Difference]: Start difference. First operand has 114 places, 216 transitions, 1638 flow. Second operand 3 states and 441 transitions.
[2023-10-26 08:41:48,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 233 transitions, 1857 flow
[2023-10-26 08:41:48,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 233 transitions, 1853 flow, removed 2 selfloop flow, removed 0 redundant places.
[2023-10-26 08:41:48,380 INFO  L231             Difference]: Finished difference. Result has 117 places, 199 transitions, 1501 flow
[2023-10-26 08:41:48,381 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=117, PETRI_TRANSITIONS=199}
[2023-10-26 08:41:48,382 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 48 predicate places.
[2023-10-26 08:41:48,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 199 transitions, 1501 flow
[2023-10-26 08:41:48,382 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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:41:48,382 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:48,382 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:48,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-26 08:41:48,383 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:48,383 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:48,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -1511156484, now seen corresponding path program 1 times
[2023-10-26 08:41:48,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:48,383 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541981150]
[2023-10-26 08:41:48,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:48,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:48,413 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:41:48,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:41:48,825 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-26 08:41:48,829 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541981150]
[2023-10-26 08:41:48,829 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541981150] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:41:48,829 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:41:48,829 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:41:48,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120997681]
[2023-10-26 08:41:48,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:41:48,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:41:48,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-26 08:41:48,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:41:48,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:41:49,116 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 245
[2023-10-26 08:41:49,117 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 199 transitions, 1501 flow. Second operand  has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 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:41:49,117 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:41:49,117 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 245
[2023-10-26 08:41:49,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:41:49,535 INFO  L130       PetriNetUnfolder]: 476/1312 cut-off events.
[2023-10-26 08:41:49,535 INFO  L131       PetriNetUnfolder]: For 3861/3912 co-relation queries the response was YES.
[2023-10-26 08:41:49,538 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5592 conditions, 1312 events. 476/1312 cut-off events. For 3861/3912 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8483 event pairs, 121 based on Foata normal form. 13/1287 useless extension candidates. Maximal degree in co-relation 5561. Up to 718 conditions per place. 
[2023-10-26 08:41:49,565 INFO  L137   encePairwiseOnDemand]: 234/245 looper letters, 92 selfloop transitions, 41 changer transitions 35/265 dead transitions.
[2023-10-26 08:41:49,565 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 265 transitions, 2356 flow
[2023-10-26 08:41:49,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:41:49,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:41:49,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions.
[2023-10-26 08:41:49,567 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5761904761904761
[2023-10-26 08:41:49,568 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 847 transitions.
[2023-10-26 08:41:49,568 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions.
[2023-10-26 08:41:49,568 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:41:49,568 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions.
[2023-10-26 08:41:49,570 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 141.16666666666666) internal successors, (847), 6 states have internal predecessors, (847), 0 states have call successors, (0), 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:41:49,572 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 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:41:49,574 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 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:41:49,574 INFO  L175             Difference]: Start difference. First operand has 117 places, 199 transitions, 1501 flow. Second operand 6 states and 847 transitions.
[2023-10-26 08:41:49,574 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 265 transitions, 2356 flow
[2023-10-26 08:41:49,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 265 transitions, 2329 flow, removed 1 selfloop flow, removed 4 redundant places.
[2023-10-26 08:41:49,638 INFO  L231             Difference]: Finished difference. Result has 122 places, 222 transitions, 1887 flow
[2023-10-26 08:41:49,638 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1887, PETRI_PLACES=122, PETRI_TRANSITIONS=222}
[2023-10-26 08:41:49,639 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 53 predicate places.
[2023-10-26 08:41:49,639 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 222 transitions, 1887 flow
[2023-10-26 08:41:49,639 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 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:41:49,639 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:41:49,640 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:49,640 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-26 08:41:49,640 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:41:49,640 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:41:49,640 INFO  L85        PathProgramCache]: Analyzing trace with hash 880579718, now seen corresponding path program 1 times
[2023-10-26 08:41:49,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-26 08:41:49,641 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276987926]
[2023-10-26 08:41:49,641 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:41:49,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-26 08:41:49,673 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:41:49,674 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:41:49,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:41:49,763 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-26 08:41:49,763 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:41:49,764 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2023-10-26 08:41:49,779 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-10-26 08:41:49,779 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-10-26 08:41:49,779 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-10-26 08:41:49,779 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-10-26 08:41:49,779 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-10-26 08:41:49,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-10-26 08:41:49,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-10-26 08:41:49,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-10-26 08:41:49,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2023-10-26 08:41:49,780 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-10-26 08:41:49,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-10-26 08:41:49,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-10-26 08:41:49,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-10-26 08:41:49,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-10-26 08:41:49,781 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-10-26 08:41:49,782 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-10-26 08:41:49,782 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-10-26 08:41:49,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-26 08:41:49,782 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:41:49,787 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-10-26 08:41:49,787 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-26 08:41:49,875 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:41:49 BasicIcfg
[2023-10-26 08:41:49,875 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-26 08:41:49,876 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-26 08:41:49,876 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-26 08:41:49,876 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-26 08:41:49,877 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:41:36" (3/4) ...
[2023-10-26 08:41:49,879 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-26 08:41:49,879 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-26 08:41:49,879 INFO  L158              Benchmark]: Toolchain (without parser) took 15885.43ms. Allocated memory was 45.7MB in the beginning and 86.1MB in the end (delta: 40.4MB). Free memory was 23.6MB in the beginning and 41.9MB in the end (delta: -18.3MB). Peak memory consumption was 22.1MB. Max. memory is 15.6GB.
[2023-10-26 08:41:49,879 INFO  L158              Benchmark]: CDTParser took 7.43ms. Allocated memory is still 40.7MB. Free memory was 15.8MB in the beginning and 15.8MB in the end (delta: 26.2kB). Peak memory consumption was 26.2kB. Max. memory is 15.6GB.
[2023-10-26 08:41:49,880 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 980.67ms. Allocated memory is still 45.7MB. Free memory was 23.3MB in the beginning and 16.3MB in the end (delta: 7.0MB). Peak memory consumption was 14.1MB. Max. memory is 15.6GB.
[2023-10-26 08:41:49,880 INFO  L158              Benchmark]: Boogie Procedure Inliner took 106.12ms. Allocated memory is still 45.7MB. Free memory was 16.1MB in the beginning and 13.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.5MB. Max. memory is 15.6GB.
[2023-10-26 08:41:49,880 INFO  L158              Benchmark]: Boogie Preprocessor took 84.83ms. Allocated memory is still 45.7MB. Free memory was 13.6MB in the beginning and 11.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.2MB. Max. memory is 15.6GB.
[2023-10-26 08:41:49,881 INFO  L158              Benchmark]: RCFGBuilder took 838.48ms. Allocated memory is still 45.7MB. Free memory was 11.2MB in the beginning and 16.4MB in the end (delta: -5.2MB). Peak memory consumption was 4.5MB. Max. memory is 15.6GB.
[2023-10-26 08:41:49,881 INFO  L158              Benchmark]: TraceAbstraction took 13865.86ms. Allocated memory was 45.7MB in the beginning and 86.1MB in the end (delta: 40.4MB). Free memory was 15.7MB in the beginning and 42.4MB in the end (delta: -26.7MB). Peak memory consumption was 36.1MB. Max. memory is 15.6GB.
[2023-10-26 08:41:49,897 INFO  L158              Benchmark]: Witness Printer took 2.81ms. Allocated memory is still 86.1MB. Free memory was 42.4MB in the beginning and 41.9MB in the end (delta: 474.6kB). Peak memory consumption was 474.6kB. Max. memory is 15.6GB.
[2023-10-26 08:41:49,900 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 7.43ms. Allocated memory is still 40.7MB. Free memory was 15.8MB in the beginning and 15.8MB in the end (delta: 26.2kB). Peak memory consumption was 26.2kB. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 980.67ms. Allocated memory is still 45.7MB. Free memory was 23.3MB in the beginning and 16.3MB in the end (delta: 7.0MB). Peak memory consumption was 14.1MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 106.12ms. Allocated memory is still 45.7MB. Free memory was 16.1MB in the beginning and 13.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.5MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 84.83ms. Allocated memory is still 45.7MB. Free memory was 13.6MB in the beginning and 11.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.2MB. Max. memory is 15.6GB.
 * RCFGBuilder took 838.48ms. Allocated memory is still 45.7MB. Free memory was 11.2MB in the beginning and 16.4MB in the end (delta: -5.2MB). Peak memory consumption was 4.5MB. Max. memory is 15.6GB.
 * TraceAbstraction took 13865.86ms. Allocated memory was 45.7MB in the beginning and 86.1MB in the end (delta: 40.4MB). Free memory was 15.7MB in the beginning and 42.4MB in the end (delta: -26.7MB). Peak memory consumption was 36.1MB. Max. memory is 15.6GB.
 * Witness Printer took 2.81ms. Allocated memory is still 86.1MB. Free memory was 42.4MB in the beginning and 41.9MB in the end (delta: 474.6kB). Peak memory consumption was 474.6kB. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.5s, 147 PlacesBefore, 69 PlacesAfterwards, 149 TransitionsBefore, 67 TransitionsAfterwards, 3942 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 96 TotalNumberOfCompositions, 25074 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5875, independent: 5008, independent conditional: 0, independent unconditional: 5008, dependent: 867, dependent conditional: 0, dependent unconditional: 867, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1716, independent: 1611, independent conditional: 0, independent unconditional: 1611, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5875, independent: 3397, independent conditional: 0, independent unconditional: 3397, dependent: 762, dependent conditional: 0, dependent unconditional: 762, unknown: 1716, unknown conditional: 0, unknown unconditional: 1716] , Statistics on independence cache: Total cache size (in pairs): 373, Positive cache size: 319, Positive conditional cache size: 0, Positive unconditional cache size: 319, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - UnprovableResult [Line: 1052]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: overapproximation of shiftLeft at line 1042, overapproximation of bitwiseOr at line 1042, overapproximation of bitwiseAnd at line 1053, overapproximation of bitwiseComplement at line 1053. 
Possible FailurePath: 
[L1037]               0  int threads_mask = -1;
[L1038]               0  int *datas;
[L1046]               0  int threads_total = __VERIFIER_nondet_int();
[L1047]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1034]  COND FALSE   0  !(!cond)
[L1047]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1048]  CALL         0  assume_abort_if_not(threads_total < 32)
[L1034]  COND FALSE   0  !(!cond)
[L1048]  RET          0  assume_abort_if_not(threads_total < 32)
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1050]               0  datas = malloc(threads_total * sizeof(int))
[L1051]               0  int i = 0;
         VAL             [datas={-2:0}, i=0, threads_mask=-1, threads_total=31, tids={8:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1052]  EXPR         0  ffs(threads_mask)
[L1052]               0  int j = ffs(threads_mask) - 1;
[L1053]               0  threads_mask &= ~(1 << j)
[L1054]  EXPR         0  \read(*tids)
         VAL             [\read(*tids)={-3:0}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1054]  EXPR         0  tids[i]
         VAL             [\read(*tids)={-3:0}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1054]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, j)
         VAL             [\read(*tids)={-3:0}, arg={0:3}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1040]               1  int j = arg;
[L1041]  EXPR         1  datas[j]
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1]
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=-5, arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1]
[L1051]               0  i++
         VAL             [__VERIFIER_nondet_int()=-5, arg={0:3}, arg={0:3}, datas={-2:0}, i=1, j=3, j=3, threads_mask=-1, threads_total=31, tids={8:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1042]               1  threads_mask |= 1 << j
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, j=3, threads_mask=-1, threads_mask |= 1 << j=131]
[L1052]               0  ffs(threads_mask)
         VAL             [arg={0:3}, arg={0:3}, datas={-2:0}, i=1, j=3, j=3, threads_mask=-1, threads_mask |= 1 << j=131, threads_total=31, tids={8:0}]

  - UnprovableResult [Line: 1050]: 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: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1059]: 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: 1060]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 173 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1020 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2648 IncrementalHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 361 mSolverCounterUnsat, 27 mSDtfsCounter, 2648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1887occurred in iteration=11, InterpolantAutomatonStates: 51, 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.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 936 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-10-26 08:41:49,927 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
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
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/per-thread-index-bitmask-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.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 974d17413865f39a607640a826612ee43ba82182a41f559c5bb885b5b3327e06
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-26 08:41:52,969 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-26 08:41:52,971 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-26 08:41:53,041 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-26 08:41:53,041 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-26 08:41:53,043 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-26 08:41:53,045 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-26 08:41:53,047 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-26 08:41:53,050 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-26 08:41:53,054 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-26 08:41:53,055 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-26 08:41:53,057 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-26 08:41:53,057 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-26 08:41:53,059 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-26 08:41:53,074 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-26 08:41:53,075 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-26 08:41:53,076 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-26 08:41:53,077 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-26 08:41:53,078 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-26 08:41:53,082 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-26 08:41:53,083 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-26 08:41:53,085 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-26 08:41:53,086 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-26 08:41:53,086 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-26 08:41:53,092 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-26 08:41:53,092 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-26 08:41:53,092 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-26 08:41:53,094 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-26 08:41:53,094 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-26 08:41:53,146 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-26 08:41:53,146 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-26 08:41:53,146 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-26 08:41:53,147 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-26 08:41:53,147 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-26 08:41:53,148 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-26 08:41:53,148 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-26 08:41:53,149 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-26 08:41:53,149 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-26 08:41:53,149 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-26 08:41:53,149 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-26 08:41:53,150 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-26 08:41:53,153 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf
[2023-10-26 08:41:53,179 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-26 08:41:53,179 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-26 08:41:53,180 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-26 08:41:53,180 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-26 08:41:53,181 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-26 08:41:53,181 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-26 08:41:53,182 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-26 08:41:53,182 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-26 08:41:53,182 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-26 08:41:53,182 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-26 08:41:53,183 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-26 08:41:53,183 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-26 08:41:53,183 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-26 08:41:53,183 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-26 08:41:53,184 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-26 08:41:53,184 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-26 08:41:53,184 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-26 08:41:53,184 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-26 08:41:53,184 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-10-26 08:41:53,184 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-10-26 08:41:53,185 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-26 08:41:53,185 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-26 08:41:53,185 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-26 08:41:53,185 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-26 08:41:53,185 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-26 08:41:53,186 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-26 08:41:53,186 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-26 08:41:53,186 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:41:53,186 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-26 08:41:53,186 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-26 08:41:53,187 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-26 08:41:53,197 INFO  L138        SettingsManager]:  * Trace refinement strategy=WOLF
[2023-10-26 08:41:53,197 INFO  L138        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-10-26 08:41:53,198 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-26 08:41:53,198 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-26 08:41:53,198 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-26 08:41:53,198 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-26 08:41:53,199 INFO  L138        SettingsManager]:  * Logic for external solver=AUFBV
[2023-10-26 08:41:53,199 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-26 08:41:53,199 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 -> 974d17413865f39a607640a826612ee43ba82182a41f559c5bb885b5b3327e06
[2023-10-26 08:41:53,652 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-26 08:41:53,691 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-26 08:41:53,693 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-26 08:41:53,694 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-26 08:41:53,699 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-26 08:41:53,700 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-10-26 08:41:55,603 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-26 08:41:56,028 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-26 08:41:56,028 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-10-26 08:41:56,058 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/28814e976/246a4a46149444759f8de61f59ef7d9e/FLAG5d7cb0b22
[2023-10-26 08:41:56,073 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/28814e976/246a4a46149444759f8de61f59ef7d9e
[2023-10-26 08:41:56,075 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-26 08:41:56,081 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-26 08:41:56,084 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-26 08:41:56,084 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-26 08:41:56,086 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-26 08:41:56,102 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:41:56" (1/1) ...
[2023-10-26 08:41:56,103 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c83c533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:56, skipping insertion in model container
[2023-10-26 08:41:56,103 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:41:56" (1/1) ...
[2023-10-26 08:41:56,109 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-26 08:41:56,198 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-26 08:41:56,464 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:41:56,849 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-26 08:41:56,874 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:41:56,894 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-26 08:41:56,931 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-26 08:41:56,984 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-10-26 08:41:56,989 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-26 08:41:57,087 INFO  L208         MainTranslator]: Completed translation
[2023-10-26 08:41:57,088 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57 WrapperNode
[2023-10-26 08:41:57,088 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-26 08:41:57,089 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-26 08:41:57,089 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-26 08:41:57,089 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-26 08:41:57,095 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:41:57" (1/1) ...
[2023-10-26 08:41:57,149 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:41:57" (1/1) ...
[2023-10-26 08:41:57,184 INFO  L138                Inliner]: procedures = 279, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102
[2023-10-26 08:41:57,185 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-26 08:41:57,185 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-26 08:41:57,185 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-26 08:41:57,185 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-26 08:41:57,199 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,200 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,215 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,215 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,239 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,255 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,267 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,275 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,278 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-26 08:41:57,282 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-26 08:41:57,283 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-26 08:41:57,283 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-26 08:41:57,283 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (1/1) ...
[2023-10-26 08:41:57,297 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-26 08:41:57,316 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-26 08:41:57,354 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:41:57,374 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:41:57,381 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2023-10-26 08:41:57,381 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-26 08:41:57,382 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-26 08:41:57,382 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-26 08:41:57,382 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-10-26 08:41:57,383 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-26 08:41:57,383 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-26 08:41:57,383 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2023-10-26 08:41:57,383 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-26 08:41:57,383 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-26 08:41:57,383 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-26 08:41:57,384 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-26 08:41:57,385 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:41:57,661 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-26 08:41:57,675 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-26 08:41:58,240 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-26 08:41:58,250 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-26 08:41:58,250 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-26 08:41:58,252 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:41:58 BoogieIcfgContainer
[2023-10-26 08:41:58,253 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-26 08:41:58,269 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-26 08:41:58,270 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-26 08:41:58,272 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-26 08:41:58,272 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:41:56" (1/3) ...
[2023-10-26 08:41:58,273 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31224298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:41:58, skipping insertion in model container
[2023-10-26 08:41:58,274 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:41:57" (2/3) ...
[2023-10-26 08:41:58,275 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31224298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:41:58, skipping insertion in model container
[2023-10-26 08:41:58,275 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:41:58" (3/3) ...
[2023-10-26 08:41:58,276 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2023-10-26 08:41:58,283 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-26 08:41:58,291 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-26 08:41:58,305 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2023-10-26 08:41:58,305 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-26 08:41:58,437 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-26 08:41:58,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2023-10-26 08:41:58,659 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2023-10-26 08:41:58,659 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:41:58,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 218 conditions, 212 events. 7/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 410 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. 
[2023-10-26 08:41:58,663 INFO  L82        GeneralOperation]: Start removeDead. Operand has 145 places, 147 transitions, 302 flow
[2023-10-26 08:41:58,671 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 147 transitions, 302 flow
[2023-10-26 08:41:58,674 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-26 08:41:58,692 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 147 transitions, 302 flow
[2023-10-26 08:41:58,698 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 147 transitions, 302 flow
[2023-10-26 08:41:58,699 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2023-10-26 08:41:58,756 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2023-10-26 08:41:58,773 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-26 08:41:58,775 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 218 conditions, 212 events. 7/212 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 410 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 107. Up to 4 conditions per place. 
[2023-10-26 08:41:58,779 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3744
[2023-10-26 08:42:03,734 INFO  L134        LiptonReduction]: Checked pairs total: 25082
[2023-10-26 08:42:03,745 INFO  L136        LiptonReduction]: Total number of compositions: 95
[2023-10-26 08:42:03,778 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-26 08:42:03,783 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;@5488d2c3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-26 08:42:03,785 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-10-26 08:42:03,798 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-10-26 08:42:03,799 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-26 08:42:03,799 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:03,799 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-26 08:42:03,800 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:03,804 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:03,804 INFO  L85        PathProgramCache]: Analyzing trace with hash 473, now seen corresponding path program 1 times
[2023-10-26 08:42:03,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:03,822 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7733788]
[2023-10-26 08:42:03,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:03,823 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:03,823 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:03,831 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:03,918 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2023-10-26 08:42:03,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:03,962 INFO  L263         TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-10-26 08:42:03,965 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:03,967 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:42:03,968 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:03,968 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:03,969 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7733788]
[2023-10-26 08:42:03,985 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [7733788] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:03,985 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:03,986 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-26 08:42:03,987 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453863368]
[2023-10-26 08:42:03,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:03,994 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-26 08:42:03,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:04,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-26 08:42:04,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-26 08:42:04,031 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 242
[2023-10-26 08:42:04,035 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 142 flow. Second operand  has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:42:04,035 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:04,036 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 242
[2023-10-26 08:42:04,036 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:04,299 INFO  L130       PetriNetUnfolder]: 73/385 cut-off events.
[2023-10-26 08:42:04,299 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-26 08:42:04,300 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 569 conditions, 385 events. 73/385 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2075 event pairs, 72 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 499. Up to 178 conditions per place. 
[2023-10-26 08:42:04,302 INFO  L137   encePairwiseOnDemand]: 241/242 looper letters, 22 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2023-10-26 08:42:04,302 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 184 flow
[2023-10-26 08:42:04,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-26 08:42:04,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-26 08:42:04,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions.
[2023-10-26 08:42:04,335 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6301652892561983
[2023-10-26 08:42:04,336 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 305 transitions.
[2023-10-26 08:42:04,336 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions.
[2023-10-26 08:42:04,338 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:04,351 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions.
[2023-10-26 08:42:04,365 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 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:42:04,369 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 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:42:04,370 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 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:42:04,371 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 305 transitions.
[2023-10-26 08:42:04,394 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 184 flow
[2023-10-26 08:42:04,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:42:04,398 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2023-10-26 08:42:04,399 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=140, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2023-10-26 08:42:04,402 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2023-10-26 08:42:04,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2023-10-26 08:42:04,413 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 141.5) internal successors, (283), 2 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-26 08:42:04,414 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:04,414 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-10-26 08:42:04,432 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:04,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:04,623 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:04,623 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:04,623 INFO  L85        PathProgramCache]: Analyzing trace with hash 467532, now seen corresponding path program 1 times
[2023-10-26 08:42:04,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:04,624 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690926984]
[2023-10-26 08:42:04,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:04,624 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:04,625 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:04,627 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:04,683 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2023-10-26 08:42:04,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:04,754 INFO  L263         TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-26 08:42:04,754 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:04,790 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:42:04,790 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:04,790 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:04,790 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690926984]
[2023-10-26 08:42:04,791 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [690926984] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:04,791 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:04,792 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:42:04,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407936788]
[2023-10-26 08:42:04,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:04,793 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:42:04,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:04,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:42:04,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:42:04,827 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 242
[2023-10-26 08:42:04,828 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 140 flow. Second operand  has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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:42:04,828 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:04,828 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 242
[2023-10-26 08:42:04,829 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:05,128 INFO  L130       PetriNetUnfolder]: 119/458 cut-off events.
[2023-10-26 08:42:05,129 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-26 08:42:05,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 752 conditions, 458 events. 119/458 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2370 event pairs, 58 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 748. Up to 153 conditions per place. 
[2023-10-26 08:42:05,136 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 41 selfloop transitions, 8 changer transitions 0/87 dead transitions.
[2023-10-26 08:42:05,139 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 280 flow
[2023-10-26 08:42:05,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:42:05,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:42:05,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions.
[2023-10-26 08:42:05,148 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6088154269972452
[2023-10-26 08:42:05,151 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 442 transitions.
[2023-10-26 08:42:05,162 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions.
[2023-10-26 08:42:05,164 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:05,167 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions.
[2023-10-26 08:42:05,168 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 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:42:05,171 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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:42:05,173 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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:42:05,173 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 442 transitions.
[2023-10-26 08:42:05,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 280 flow
[2023-10-26 08:42:05,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:42:05,176 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2023-10-26 08:42:05,177 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=73, PETRI_TRANSITIONS=74}
[2023-10-26 08:42:05,178 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2023-10-26 08:42:05,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2023-10-26 08:42:05,179 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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:42:05,179 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:05,179 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:05,204 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:05,387 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:05,387 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:05,388 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:05,388 INFO  L85        PathProgramCache]: Analyzing trace with hash -1212481378, now seen corresponding path program 1 times
[2023-10-26 08:42:05,389 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:05,390 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325600278]
[2023-10-26 08:42:05,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:05,390 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:05,390 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:05,413 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:05,446 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2023-10-26 08:42:05,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:05,515 INFO  L263         TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-26 08:42:05,515 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:05,527 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:42:05,527 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:05,527 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:05,527 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325600278]
[2023-10-26 08:42:05,531 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325600278] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:05,531 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:05,531 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:42:05,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538534549]
[2023-10-26 08:42:05,532 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:05,532 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:42:05,532 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:05,533 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:42:05,533 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:42:05,575 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2023-10-26 08:42:05,576 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 210 flow. Second operand  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:42:05,576 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:05,576 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2023-10-26 08:42:05,577 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:05,764 INFO  L130       PetriNetUnfolder]: 106/443 cut-off events.
[2023-10-26 08:42:05,764 INFO  L131       PetriNetUnfolder]: For 96/98 co-relation queries the response was YES.
[2023-10-26 08:42:05,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 853 conditions, 443 events. 106/443 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2329 event pairs, 78 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 847. Up to 229 conditions per place. 
[2023-10-26 08:42:05,769 INFO  L137   encePairwiseOnDemand]: 237/242 looper letters, 33 selfloop transitions, 6 changer transitions 0/83 dead transitions.
[2023-10-26 08:42:05,769 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 316 flow
[2023-10-26 08:42:05,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:42:05,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:42:05,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2023-10-26 08:42:05,778 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5867768595041323
[2023-10-26 08:42:05,779 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2023-10-26 08:42:05,779 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2023-10-26 08:42:05,779 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:05,779 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2023-10-26 08:42:05,780 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:42:05,783 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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:42:05,784 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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:42:05,784 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 3 states and 426 transitions.
[2023-10-26 08:42:05,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 316 flow
[2023-10-26 08:42:05,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-26 08:42:05,804 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 236 flow
[2023-10-26 08:42:05,805 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=74, PETRI_TRANSITIONS=78}
[2023-10-26 08:42:05,806 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places.
[2023-10-26 08:42:05,806 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 236 flow
[2023-10-26 08:42:05,806 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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:42:05,806 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:05,806 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:05,817 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:06,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:06,015 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:06,016 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:06,016 INFO  L85        PathProgramCache]: Analyzing trace with hash -1425225994, now seen corresponding path program 1 times
[2023-10-26 08:42:06,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:06,017 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833638500]
[2023-10-26 08:42:06,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:06,018 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:06,018 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:06,029 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:06,087 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2023-10-26 08:42:06,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:06,148 INFO  L263         TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-10-26 08:42:06,150 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:06,215 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:42:06,250 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22
[2023-10-26 08:42:06,286 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:06,292 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36
[2023-10-26 08:42:06,353 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:06,353 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50
[2023-10-26 08:42:06,405 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:42:06,405 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:06,405 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:06,406 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833638500]
[2023-10-26 08:42:06,406 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [833638500] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:06,406 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:06,406 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:42:06,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7297151]
[2023-10-26 08:42:06,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:06,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:42:06,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:06,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:42:06,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:42:06,906 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242
[2023-10-26 08:42:06,907 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 236 flow. Second operand  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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:42:06,907 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:06,907 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242
[2023-10-26 08:42:06,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:07,521 INFO  L130       PetriNetUnfolder]: 407/1192 cut-off events.
[2023-10-26 08:42:07,522 INFO  L131       PetriNetUnfolder]: For 254/258 co-relation queries the response was YES.
[2023-10-26 08:42:07,527 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1192 events. 407/1192 cut-off events. For 254/258 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7853 event pairs, 134 based on Foata normal form. 0/1130 useless extension candidates. Maximal degree in co-relation 2435. Up to 530 conditions per place. 
[2023-10-26 08:42:07,534 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 89 selfloop transitions, 29 changer transitions 0/146 dead transitions.
[2023-10-26 08:42:07,534 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 146 transitions, 641 flow
[2023-10-26 08:42:07,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:42:07,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:42:07,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions.
[2023-10-26 08:42:07,549 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5578512396694215
[2023-10-26 08:42:07,550 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 810 transitions.
[2023-10-26 08:42:07,550 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions.
[2023-10-26 08:42:07,550 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:07,550 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions.
[2023-10-26 08:42:07,552 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 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:42:07,554 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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:42:07,555 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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:42:07,555 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 236 flow. Second operand 6 states and 810 transitions.
[2023-10-26 08:42:07,555 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 146 transitions, 641 flow
[2023-10-26 08:42:07,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-26 08:42:07,562 INFO  L231             Difference]: Finished difference. Result has 83 places, 107 transitions, 450 flow
[2023-10-26 08:42:07,562 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=83, PETRI_TRANSITIONS=107}
[2023-10-26 08:42:07,563 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places.
[2023-10-26 08:42:07,563 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 107 transitions, 450 flow
[2023-10-26 08:42:07,564 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 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:42:07,564 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:07,564 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:07,586 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:07,772 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:07,772 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:07,773 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:07,773 INFO  L85        PathProgramCache]: Analyzing trace with hash 452500327, now seen corresponding path program 1 times
[2023-10-26 08:42:07,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:07,774 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292472732]
[2023-10-26 08:42:07,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:07,775 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:07,775 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:07,784 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:07,834 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2023-10-26 08:42:07,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:07,889 INFO  L263         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-26 08:42:07,890 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:07,898 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:42:07,898 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:07,899 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:07,901 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292472732]
[2023-10-26 08:42:07,901 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292472732] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:07,901 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:07,901 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:42:07,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943165848]
[2023-10-26 08:42:07,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:07,903 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:42:07,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:07,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:42:07,904 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:42:07,920 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 242
[2023-10-26 08:42:07,921 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 107 transitions, 450 flow. Second operand  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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:42:07,921 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:07,921 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 242
[2023-10-26 08:42:07,921 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:08,168 INFO  L130       PetriNetUnfolder]: 215/860 cut-off events.
[2023-10-26 08:42:08,168 INFO  L131       PetriNetUnfolder]: For 277/293 co-relation queries the response was YES.
[2023-10-26 08:42:08,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2000 conditions, 860 events. 215/860 cut-off events. For 277/293 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5647 event pairs, 32 based on Foata normal form. 19/843 useless extension candidates. Maximal degree in co-relation 1989. Up to 338 conditions per place. 
[2023-10-26 08:42:08,172 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 44 selfloop transitions, 2 changer transitions 0/118 dead transitions.
[2023-10-26 08:42:08,172 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 118 transitions, 578 flow
[2023-10-26 08:42:08,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:42:08,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:42:08,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2023-10-26 08:42:08,177 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6074380165289256
[2023-10-26 08:42:08,178 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2023-10-26 08:42:08,178 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2023-10-26 08:42:08,178 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:08,178 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2023-10-26 08:42:08,179 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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:42:08,180 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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:42:08,181 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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:42:08,186 INFO  L175             Difference]: Start difference. First operand has 83 places, 107 transitions, 450 flow. Second operand 3 states and 441 transitions.
[2023-10-26 08:42:08,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 118 transitions, 578 flow
[2023-10-26 08:42:08,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 118 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:42:08,192 INFO  L231             Difference]: Finished difference. Result has 84 places, 107 transitions, 460 flow
[2023-10-26 08:42:08,192 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=84, PETRI_TRANSITIONS=107}
[2023-10-26 08:42:08,194 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 15 predicate places.
[2023-10-26 08:42:08,194 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 107 transitions, 460 flow
[2023-10-26 08:42:08,194 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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:42:08,194 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:08,194 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:08,219 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:08,402 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:08,402 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:08,403 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:08,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -1792765839, now seen corresponding path program 1 times
[2023-10-26 08:42:08,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:08,404 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989997519]
[2023-10-26 08:42:08,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:08,404 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:08,404 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:08,417 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:08,465 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2023-10-26 08:42:08,515 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:08,516 INFO  L263         TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-10-26 08:42:08,528 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:08,597 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:42:08,614 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:08,614 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:08,614 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989997519]
[2023-10-26 08:42:08,615 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [989997519] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:08,615 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:08,615 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-26 08:42:08,615 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726014661]
[2023-10-26 08:42:08,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:08,616 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-26 08:42:08,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:08,617 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-26 08:42:08,617 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-26 08:42:08,735 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 242
[2023-10-26 08:42:08,736 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 107 transitions, 460 flow. Second operand  has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 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:42:08,736 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:08,736 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 242
[2023-10-26 08:42:08,736 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:09,035 INFO  L130       PetriNetUnfolder]: 193/868 cut-off events.
[2023-10-26 08:42:09,038 INFO  L131       PetriNetUnfolder]: For 297/307 co-relation queries the response was YES.
[2023-10-26 08:42:09,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 868 events. 193/868 cut-off events. For 297/307 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6181 event pairs, 18 based on Foata normal form. 2/832 useless extension candidates. Maximal degree in co-relation 2026. Up to 292 conditions per place. 
[2023-10-26 08:42:09,056 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 42 selfloop transitions, 2 changer transitions 4/123 dead transitions.
[2023-10-26 08:42:09,056 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 613 flow
[2023-10-26 08:42:09,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-26 08:42:09,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-26 08:42:09,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions.
[2023-10-26 08:42:09,059 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5981404958677686
[2023-10-26 08:42:09,059 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 579 transitions.
[2023-10-26 08:42:09,059 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions.
[2023-10-26 08:42:09,059 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:09,059 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions.
[2023-10-26 08:42:09,061 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 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:42:09,062 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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:42:09,063 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 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:42:09,063 INFO  L175             Difference]: Start difference. First operand has 84 places, 107 transitions, 460 flow. Second operand 4 states and 579 transitions.
[2023-10-26 08:42:09,063 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 613 flow
[2023-10-26 08:42:09,067 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 123 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-26 08:42:09,081 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 470 flow
[2023-10-26 08:42:09,082 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=89, PETRI_TRANSITIONS=107}
[2023-10-26 08:42:09,084 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 20 predicate places.
[2023-10-26 08:42:09,084 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 470 flow
[2023-10-26 08:42:09,085 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 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:42:09,086 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:09,086 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:09,096 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:09,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:09,294 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:09,294 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:09,294 INFO  L85        PathProgramCache]: Analyzing trace with hash -680468640, now seen corresponding path program 1 times
[2023-10-26 08:42:09,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:09,295 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422112885]
[2023-10-26 08:42:09,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:09,295 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:09,296 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:09,297 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:09,351 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2023-10-26 08:42:09,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:09,439 INFO  L263         TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-10-26 08:42:09,441 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:09,451 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2023-10-26 08:42:09,466 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2023-10-26 08:42:09,514 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:09,514 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2023-10-26 08:42:09,583 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:09,584 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2023-10-26 08:42:09,661 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:42:09,662 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:09,662 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:09,662 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422112885]
[2023-10-26 08:42:09,662 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [422112885] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:09,662 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:09,662 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:42:09,662 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344159538]
[2023-10-26 08:42:09,662 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:09,663 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:42:09,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:09,663 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:42:09,663 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:42:10,142 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2023-10-26 08:42:10,143 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 107 transitions, 470 flow. Second operand  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 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:42:10,143 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:10,143 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2023-10-26 08:42:10,143 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:11,431 INFO  L130       PetriNetUnfolder]: 565/1517 cut-off events.
[2023-10-26 08:42:11,431 INFO  L131       PetriNetUnfolder]: For 805/820 co-relation queries the response was YES.
[2023-10-26 08:42:11,434 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 1517 events. 565/1517 cut-off events. For 805/820 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 10258 event pairs, 170 based on Foata normal form. 2/1445 useless extension candidates. Maximal degree in co-relation 4210. Up to 966 conditions per place. 
[2023-10-26 08:42:11,450 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 127 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2023-10-26 08:42:11,450 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 241 transitions, 1458 flow
[2023-10-26 08:42:11,450 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:42:11,451 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:42:11,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions.
[2023-10-26 08:42:11,453 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5819559228650137
[2023-10-26 08:42:11,453 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 845 transitions.
[2023-10-26 08:42:11,453 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions.
[2023-10-26 08:42:11,453 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:11,454 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions.
[2023-10-26 08:42:11,455 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 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:42:11,471 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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:42:11,472 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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:42:11,472 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 470 flow. Second operand 6 states and 845 transitions.
[2023-10-26 08:42:11,472 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 241 transitions, 1458 flow
[2023-10-26 08:42:11,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1436 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-10-26 08:42:11,486 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2023-10-26 08:42:11,502 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1212, PETRI_PLACES=95, PETRI_TRANSITIONS=188}
[2023-10-26 08:42:11,502 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-10-26 08:42:11,503 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2023-10-26 08:42:11,503 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 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:42:11,503 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:11,503 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:11,528 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:11,711 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:11,712 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:11,712 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:11,712 INFO  L85        PathProgramCache]: Analyzing trace with hash -1641426374, now seen corresponding path program 1 times
[2023-10-26 08:42:11,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:11,713 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782628844]
[2023-10-26 08:42:11,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:11,713 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:11,713 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:11,730 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:11,770 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2023-10-26 08:42:11,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:11,858 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core
[2023-10-26 08:42:11,860 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:12,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:42:12,098 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-26 08:42:12,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-26 08:42:12,373 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:12,373 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782628844]
[2023-10-26 08:42:12,373 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782628844] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-26 08:42:12,373 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-10-26 08:42:12,373 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9
[2023-10-26 08:42:12,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519027671]
[2023-10-26 08:42:12,373 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-10-26 08:42:12,374 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-26 08:42:12,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:12,374 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-26 08:42:12,374 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2023-10-26 08:42:12,925 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2023-10-26 08:42:12,926 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 188 transitions, 1212 flow. Second operand  has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 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:42:12,928 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:12,928 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2023-10-26 08:42:12,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:13,378 INFO  L130       PetriNetUnfolder]: 271/947 cut-off events.
[2023-10-26 08:42:13,379 INFO  L131       PetriNetUnfolder]: For 907/937 co-relation queries the response was YES.
[2023-10-26 08:42:13,380 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2844 conditions, 947 events. 271/947 cut-off events. For 907/937 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6320 event pairs, 52 based on Foata normal form. 4/924 useless extension candidates. Maximal degree in co-relation 2826. Up to 234 conditions per place. 
[2023-10-26 08:42:13,383 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 43 selfloop transitions, 6 changer transitions 12/184 dead transitions.
[2023-10-26 08:42:13,397 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 184 transitions, 1209 flow
[2023-10-26 08:42:13,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:42:13,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:42:13,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 959 transitions.
[2023-10-26 08:42:13,400 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5661157024793388
[2023-10-26 08:42:13,400 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 959 transitions.
[2023-10-26 08:42:13,400 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 959 transitions.
[2023-10-26 08:42:13,401 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:13,401 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 959 transitions.
[2023-10-26 08:42:13,403 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 137.0) internal successors, (959), 7 states have internal predecessors, (959), 0 states have call successors, (0), 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:42:13,405 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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:42:13,406 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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:42:13,407 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 959 transitions.
[2023-10-26 08:42:13,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 184 transitions, 1209 flow
[2023-10-26 08:42:13,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 184 transitions, 1149 flow, removed 27 selfloop flow, removed 2 redundant places.
[2023-10-26 08:42:13,428 INFO  L231             Difference]: Finished difference. Result has 100 places, 153 transitions, 935 flow
[2023-10-26 08:42:13,428 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=935, PETRI_PLACES=100, PETRI_TRANSITIONS=153}
[2023-10-26 08:42:13,430 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 31 predicate places.
[2023-10-26 08:42:13,430 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 935 flow
[2023-10-26 08:42:13,430 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 133.6) internal successors, (1336), 10 states have internal predecessors, (1336), 0 states have call successors, (0), 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:42:13,430 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:13,431 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:13,443 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:13,638 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:13,639 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:13,639 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:13,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 1826499191, now seen corresponding path program 1 times
[2023-10-26 08:42:13,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:13,640 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406223020]
[2023-10-26 08:42:13,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:13,640 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:13,640 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:13,644 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:13,704 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2023-10-26 08:42:13,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:13,812 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2023-10-26 08:42:13,815 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:14,055 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2023-10-26 08:42:14,074 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22
[2023-10-26 08:42:14,131 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:14,132 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36
[2023-10-26 08:42:14,220 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:14,220 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 50
[2023-10-26 08:42:14,324 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:42:14,325 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2023-10-26 08:42:14,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:42:14,423 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:14,423 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:14,423 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406223020]
[2023-10-26 08:42:14,424 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406223020] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:14,424 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:14,424 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-26 08:42:14,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626891531]
[2023-10-26 08:42:14,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:14,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-26 08:42:14,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:14,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-26 08:42:14,424 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-26 08:42:17,327 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2023-10-26 08:42:17,328 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 153 transitions, 935 flow. Second operand  has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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:42:17,328 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:17,328 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2023-10-26 08:42:17,328 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:18,313 INFO  L130       PetriNetUnfolder]: 384/1088 cut-off events.
[2023-10-26 08:42:18,329 INFO  L131       PetriNetUnfolder]: For 1083/1091 co-relation queries the response was YES.
[2023-10-26 08:42:18,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3739 conditions, 1088 events. 384/1088 cut-off events. For 1083/1091 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6878 event pairs, 168 based on Foata normal form. 26/1085 useless extension candidates. Maximal degree in co-relation 3719. Up to 792 conditions per place. 
[2023-10-26 08:42:18,334 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 114 selfloop transitions, 5 changer transitions 0/160 dead transitions.
[2023-10-26 08:42:18,335 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 160 transitions, 1217 flow
[2023-10-26 08:42:18,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:42:18,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:42:18,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions.
[2023-10-26 08:42:18,337 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.49763872491145217
[2023-10-26 08:42:18,337 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 843 transitions.
[2023-10-26 08:42:18,338 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions.
[2023-10-26 08:42:18,338 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:18,338 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions.
[2023-10-26 08:42:18,340 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 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:42:18,341 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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:42:18,342 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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:42:18,342 INFO  L175             Difference]: Start difference. First operand has 100 places, 153 transitions, 935 flow. Second operand 7 states and 843 transitions.
[2023-10-26 08:42:18,342 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 160 transitions, 1217 flow
[2023-10-26 08:42:18,442 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 160 transitions, 1194 flow, removed 1 selfloop flow, removed 5 redundant places.
[2023-10-26 08:42:18,443 INFO  L231             Difference]: Finished difference. Result has 95 places, 155 transitions, 962 flow
[2023-10-26 08:42:18,444 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=962, PETRI_PLACES=95, PETRI_TRANSITIONS=155}
[2023-10-26 08:42:18,444 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-10-26 08:42:18,444 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 155 transitions, 962 flow
[2023-10-26 08:42:18,444 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 states have internal predecessors, (936), 0 states have call successors, (0), 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:42:18,444 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:18,445 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:18,466 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:18,645 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:18,645 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:18,646 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:18,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1814981271, now seen corresponding path program 1 times
[2023-10-26 08:42:18,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:18,647 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082758259]
[2023-10-26 08:42:18,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:18,647 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:18,647 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:18,653 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:18,711 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2023-10-26 08:42:18,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:18,830 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2023-10-26 08:42:18,832 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:19,017 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13
[2023-10-26 08:42:19,086 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33
[2023-10-26 08:42:19,154 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:19,154 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 52
[2023-10-26 08:42:19,254 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:19,254 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 71
[2023-10-26 08:42:19,376 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-26 08:42:19,377 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58
[2023-10-26 08:42:19,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:42:19,507 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:19,507 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:19,507 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082758259]
[2023-10-26 08:42:19,507 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082758259] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:19,507 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:19,507 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-10-26 08:42:19,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496236495]
[2023-10-26 08:42:19,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:19,508 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-10-26 08:42:19,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:19,508 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-10-26 08:42:19,508 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-10-26 08:42:20,812 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242
[2023-10-26 08:42:20,813 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 155 transitions, 962 flow. Second operand  has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 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:42:20,813 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:20,813 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242
[2023-10-26 08:42:20,813 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:24,812 INFO  L130       PetriNetUnfolder]: 403/1095 cut-off events.
[2023-10-26 08:42:24,812 INFO  L131       PetriNetUnfolder]: For 1014/1023 co-relation queries the response was YES.
[2023-10-26 08:42:24,814 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 1095 events. 403/1095 cut-off events. For 1014/1023 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6778 event pairs, 132 based on Foata normal form. 20/1082 useless extension candidates. Maximal degree in co-relation 3753. Up to 521 conditions per place. 
[2023-10-26 08:42:24,825 INFO  L137   encePairwiseOnDemand]: 230/242 looper letters, 177 selfloop transitions, 48 changer transitions 0/249 dead transitions.
[2023-10-26 08:42:24,825 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 249 transitions, 1973 flow
[2023-10-26 08:42:24,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-26 08:42:24,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-26 08:42:24,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions.
[2023-10-26 08:42:24,829 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5330578512396694
[2023-10-26 08:42:24,829 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 903 transitions.
[2023-10-26 08:42:24,830 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions.
[2023-10-26 08:42:24,830 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:24,830 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions.
[2023-10-26 08:42:24,832 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 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:42:24,834 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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:42:24,835 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 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:42:24,835 INFO  L175             Difference]: Start difference. First operand has 95 places, 155 transitions, 962 flow. Second operand 7 states and 903 transitions.
[2023-10-26 08:42:24,835 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 249 transitions, 1973 flow
[2023-10-26 08:42:24,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 249 transitions, 1964 flow, removed 4 selfloop flow, removed 1 redundant places.
[2023-10-26 08:42:24,860 INFO  L231             Difference]: Finished difference. Result has 105 places, 167 transitions, 1233 flow
[2023-10-26 08:42:24,861 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=953, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1233, PETRI_PLACES=105, PETRI_TRANSITIONS=167}
[2023-10-26 08:42:24,862 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 36 predicate places.
[2023-10-26 08:42:24,862 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 167 transitions, 1233 flow
[2023-10-26 08:42:24,862 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 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:42:24,862 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:24,863 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:24,873 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:25,071 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:25,071 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:25,072 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:25,072 INFO  L85        PathProgramCache]: Analyzing trace with hash -86355948, now seen corresponding path program 1 times
[2023-10-26 08:42:25,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:25,072 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166180171]
[2023-10-26 08:42:25,073 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:25,073 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:25,073 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:25,076 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:25,135 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2023-10-26 08:42:25,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:25,211 INFO  L263         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-10-26 08:42:25,212 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:25,217 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:42:25,218 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:25,218 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:25,218 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166180171]
[2023-10-26 08:42:25,218 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [166180171] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:25,218 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:25,218 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-26 08:42:25,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857394808]
[2023-10-26 08:42:25,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:25,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-26 08:42:25,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:25,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-26 08:42:25,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-26 08:42:25,238 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 242
[2023-10-26 08:42:25,239 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 167 transitions, 1233 flow. Second operand  has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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:42:25,239 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:25,239 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 242
[2023-10-26 08:42:25,239 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:25,467 INFO  L130       PetriNetUnfolder]: 280/891 cut-off events.
[2023-10-26 08:42:25,467 INFO  L131       PetriNetUnfolder]: For 1922/1959 co-relation queries the response was YES.
[2023-10-26 08:42:25,469 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 891 events. 280/891 cut-off events. For 1922/1959 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5705 event pairs, 69 based on Foata normal form. 11/867 useless extension candidates. Maximal degree in co-relation 3217. Up to 294 conditions per place. 
[2023-10-26 08:42:25,472 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 39 selfloop transitions, 10 changer transitions 0/179 dead transitions.
[2023-10-26 08:42:25,477 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 179 transitions, 1381 flow
[2023-10-26 08:42:25,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-26 08:42:25,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-26 08:42:25,478 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions.
[2023-10-26 08:42:25,478 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5895316804407713
[2023-10-26 08:42:25,478 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 428 transitions.
[2023-10-26 08:42:25,478 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions.
[2023-10-26 08:42:25,479 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:25,479 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions.
[2023-10-26 08:42:25,480 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 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:42:25,481 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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:42:25,481 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 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:42:25,481 INFO  L175             Difference]: Start difference. First operand has 105 places, 167 transitions, 1233 flow. Second operand 3 states and 428 transitions.
[2023-10-26 08:42:25,481 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 179 transitions, 1381 flow
[2023-10-26 08:42:25,504 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 179 transitions, 1368 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-10-26 08:42:25,506 INFO  L231             Difference]: Finished difference. Result has 107 places, 173 transitions, 1292 flow
[2023-10-26 08:42:25,506 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1292, PETRI_PLACES=107, PETRI_TRANSITIONS=173}
[2023-10-26 08:42:25,506 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 38 predicate places.
[2023-10-26 08:42:25,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 173 transitions, 1292 flow
[2023-10-26 08:42:25,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 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:42:25,507 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:25,507 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:25,529 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:25,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:25,716 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:25,716 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:25,717 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426846396, now seen corresponding path program 1 times
[2023-10-26 08:42:25,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:25,717 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054740530]
[2023-10-26 08:42:25,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:25,718 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:25,718 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:25,720 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:25,779 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2023-10-26 08:42:25,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-26 08:42:25,874 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-10-26 08:42:25,880 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-26 08:42:25,884 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-26 08:42:25,896 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29
[2023-10-26 08:42:25,933 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:25,934 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46
[2023-10-26 08:42:25,987 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-26 08:42:25,988 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 63
[2023-10-26 08:42:26,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-26 08:42:26,060 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-26 08:42:26,060 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-10-26 08:42:26,060 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054740530]
[2023-10-26 08:42:26,060 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054740530] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-26 08:42:26,060 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-26 08:42:26,060 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-26 08:42:26,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63762982]
[2023-10-26 08:42:26,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-26 08:42:26,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-26 08:42:26,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-10-26 08:42:26,061 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-26 08:42:26,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-26 08:42:26,620 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 242
[2023-10-26 08:42:26,621 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 173 transitions, 1292 flow. Second operand  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 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:42:26,621 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-26 08:42:26,621 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 242
[2023-10-26 08:42:26,621 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-26 08:42:27,348 INFO  L130       PetriNetUnfolder]: 411/1111 cut-off events.
[2023-10-26 08:42:27,348 INFO  L131       PetriNetUnfolder]: For 2953/3001 co-relation queries the response was YES.
[2023-10-26 08:42:27,350 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 1111 events. 411/1111 cut-off events. For 2953/3001 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6802 event pairs, 104 based on Foata normal form. 12/1098 useless extension candidates. Maximal degree in co-relation 4516. Up to 586 conditions per place. 
[2023-10-26 08:42:27,353 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 85 selfloop transitions, 41 changer transitions 36/239 dead transitions.
[2023-10-26 08:42:27,353 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 239 transitions, 2072 flow
[2023-10-26 08:42:27,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-26 08:42:27,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-26 08:42:27,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2023-10-26 08:42:27,356 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5730027548209367
[2023-10-26 08:42:27,356 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2023-10-26 08:42:27,356 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2023-10-26 08:42:27,356 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-26 08:42:27,356 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2023-10-26 08:42:27,358 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 0 states have call successors, (0), 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:42:27,359 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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:42:27,360 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 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:42:27,360 INFO  L175             Difference]: Start difference. First operand has 107 places, 173 transitions, 1292 flow. Second operand 6 states and 832 transitions.
[2023-10-26 08:42:27,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 239 transitions, 2072 flow
[2023-10-26 08:42:27,385 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 2056 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-10-26 08:42:27,388 INFO  L231             Difference]: Finished difference. Result has 116 places, 195 transitions, 1624 flow
[2023-10-26 08:42:27,388 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1624, PETRI_PLACES=116, PETRI_TRANSITIONS=195}
[2023-10-26 08:42:27,389 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 47 predicate places.
[2023-10-26 08:42:27,389 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 195 transitions, 1624 flow
[2023-10-26 08:42:27,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 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:42:27,389 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-26 08:42:27,390 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:27,416 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:27,599 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:27,600 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-26 08:42:27,600 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-26 08:42:27,600 INFO  L85        PathProgramCache]: Analyzing trace with hash -1114213243, now seen corresponding path program 1 times
[2023-10-26 08:42:27,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-10-26 08:42:27,601 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179106851]
[2023-10-26 08:42:27,601 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-26 08:42:27,602 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:27,602 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-10-26 08:42:27,618 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-10-26 08:42:27,662 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2023-10-26 08:42:27,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:42:27,785 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-26 08:42:27,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-26 08:42:27,918 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-10-26 08:42:27,919 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-26 08:42:27,920 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2023-10-26 08:42:27,921 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-10-26 08:42:27,921 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-10-26 08:42:27,921 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-10-26 08:42:27,922 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-10-26 08:42:27,922 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-10-26 08:42:27,922 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-10-26 08:42:27,922 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-10-26 08:42:27,922 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-10-26 08:42:27,922 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2023-10-26 08:42:27,923 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-10-26 08:42:27,923 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-10-26 08:42:27,923 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-10-26 08:42:27,923 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-10-26 08:42:27,923 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-10-26 08:42:27,923 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-10-26 08:42:27,924 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-10-26 08:42:27,924 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-10-26 08:42:27,973 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0
[2023-10-26 08:42:28,124 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-10-26 08:42:28,125 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-26 08:42:28,132 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-10-26 08:42:28,133 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-10-26 08:42:28,197 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:42:28 BasicIcfg
[2023-10-26 08:42:28,200 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-10-26 08:42:28,202 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-10-26 08:42:28,202 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-10-26 08:42:28,202 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-10-26 08:42:28,203 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:41:58" (3/4) ...
[2023-10-26 08:42:28,205 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-10-26 08:42:28,205 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-10-26 08:42:28,206 INFO  L158              Benchmark]: Toolchain (without parser) took 32124.29ms. Allocated memory was 39.8MB in the beginning and 76.4MB in the end (delta: 36.6MB). Free memory was 17.3MB in the beginning and 32.8MB in the end (delta: -15.5MB). Peak memory consumption was 21.1MB. Max. memory is 15.6GB.
[2023-10-26 08:42:28,206 INFO  L158              Benchmark]: CDTParser took 0.15ms. Allocated memory is still 31.6MB. Free memory is still 11.2MB. There was no memory consumed. Max. memory is 15.6GB.
[2023-10-26 08:42:28,207 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 1004.75ms. Allocated memory is still 39.8MB. Free memory was 17.1MB in the beginning and 15.8MB in the end (delta: 1.2MB). Peak memory consumption was 10.3MB. Max. memory is 15.6GB.
[2023-10-26 08:42:28,207 INFO  L158              Benchmark]: Boogie Procedure Inliner took 95.81ms. Allocated memory is still 39.8MB. Free memory was 15.7MB in the beginning and 13.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.6MB. Max. memory is 15.6GB.
[2023-10-26 08:42:28,213 INFO  L158              Benchmark]: Boogie Preprocessor took 96.38ms. Allocated memory is still 39.8MB. Free memory was 13.0MB in the beginning and 10.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.6MB. Max. memory is 15.6GB.
[2023-10-26 08:42:28,214 INFO  L158              Benchmark]: RCFGBuilder took 970.48ms. Allocated memory is still 39.8MB. Free memory was 10.4MB in the beginning and 9.3MB in the end (delta: 1.2MB). Peak memory consumption was 6.0MB. Max. memory is 15.6GB.
[2023-10-26 08:42:28,215 INFO  L158              Benchmark]: TraceAbstraction took 29930.94ms. Allocated memory was 39.8MB in the beginning and 76.4MB in the end (delta: 36.6MB). Free memory was 8.6MB in the beginning and 33.2MB in the end (delta: -24.6MB). Peak memory consumption was 25.8MB. Max. memory is 15.6GB.
[2023-10-26 08:42:28,215 INFO  L158              Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 76.4MB. Free memory was 33.2MB in the beginning and 32.8MB in the end (delta: 414.8kB). Peak memory consumption was 414.8kB. Max. memory is 15.6GB.
[2023-10-26 08:42:28,221 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.15ms. Allocated memory is still 31.6MB. Free memory is still 11.2MB. There was no memory consumed. Max. memory is 15.6GB.
 * CACSL2BoogieTranslator took 1004.75ms. Allocated memory is still 39.8MB. Free memory was 17.1MB in the beginning and 15.8MB in the end (delta: 1.2MB). Peak memory consumption was 10.3MB. Max. memory is 15.6GB.
 * Boogie Procedure Inliner took 95.81ms. Allocated memory is still 39.8MB. Free memory was 15.7MB in the beginning and 13.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.6MB. Max. memory is 15.6GB.
 * Boogie Preprocessor took 96.38ms. Allocated memory is still 39.8MB. Free memory was 13.0MB in the beginning and 10.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.6MB. Max. memory is 15.6GB.
 * RCFGBuilder took 970.48ms. Allocated memory is still 39.8MB. Free memory was 10.4MB in the beginning and 9.3MB in the end (delta: 1.2MB). Peak memory consumption was 6.0MB. Max. memory is 15.6GB.
 * TraceAbstraction took 29930.94ms. Allocated memory was 39.8MB in the beginning and 76.4MB in the end (delta: 36.6MB). Free memory was 8.6MB in the beginning and 33.2MB in the end (delta: -24.6MB). Peak memory consumption was 25.8MB. Max. memory is 15.6GB.
 * Witness Printer took 3.19ms. Allocated memory is still 76.4MB. Free memory was 33.2MB in the beginning and 32.8MB in the end (delta: 414.8kB). Peak memory consumption was 414.8kB. Max. memory is 15.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 5.0s, 145 PlacesBefore, 69 PlacesAfterwards, 147 TransitionsBefore, 67 TransitionsAfterwards, 3744 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 95 TotalNumberOfCompositions, 25082 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6302, independent: 5432, independent conditional: 0, independent unconditional: 5432, dependent: 870, dependent conditional: 0, dependent unconditional: 870, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1627, independent: 1546, independent conditional: 0, independent unconditional: 1546, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6302, independent: 3886, independent conditional: 0, independent unconditional: 3886, dependent: 789, dependent conditional: 0, dependent unconditional: 789, unknown: 1627, unknown conditional: 0, unknown unconditional: 1627] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 340, Positive conditional cache size: 0, Positive unconditional cache size: 340, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 1052]: Data race detected
    Data race detected
The following path leads to a data race: 
[L1037]               0  int threads_mask = -1;
[L1038]               0  int *datas;
[L1046]               0  int threads_total = __VERIFIER_nondet_int();
[L1047]  CALL         0  assume_abort_if_not(threads_total >= 0)
[L1034]  COND FALSE   0  !(!cond)
[L1047]  RET          0  assume_abort_if_not(threads_total >= 0)
[L1048]  CALL         0  assume_abort_if_not(threads_total < 32)
[L1034]  COND FALSE   0  !(!cond)
[L1048]  RET          0  assume_abort_if_not(threads_total < 32)
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1049]               0  pthread_t *tids = malloc(threads_total * sizeof(pthread_t));
[L1050]               0  datas = malloc(threads_total * sizeof(int))
[L1051]               0  int i = 0;
         VAL             [datas={1:0}, i=0, threads_mask=-1, threads_total=3, tids={7:0}]
[L1051]  COND TRUE    0  i < threads_total
[L1052]  EXPR         0  ffs(threads_mask)
[L1052]               0  int j = ffs(threads_mask) - 1;
[L1053]               0  threads_mask &= ~(1 << j)
[L1054]  EXPR         0  \read(*tids)
         VAL             [\read(*tids)={5:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1054]  EXPR         0  tids[i]
         VAL             [\read(*tids)={5:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1054]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, j)
         VAL             [\read(*tids)={5:0}, arg={0:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1051]               0  i++
         VAL             [arg={0:0}, datas={1:0}, i=1, j=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1040]               1  int j = arg;
[L1041]  EXPR         1  datas[j]
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2]
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
         VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-2]
[L1051]  COND TRUE    0  i < threads_total
[L1041]               1  datas[j] = __VERIFIER_nondet_int()
[L1042]               1  threads_mask |= 1 << j
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, j=0, threads_mask=-1, threads_mask |= 1 << j=-1]
[L1052]               0  ffs(threads_mask)
         VAL             [arg={0:0}, arg={0:0}, datas={1:0}, i=1, j=0, j=0, threads_mask=-1, threads_mask |= 1 << j=-1, threads_total=3, tids={7:0}]

Now there is a data race on ~threads_mask~0 between 
	C: threads_mask |= 1 << j [1042]
and
	C: ffs(threads_mask) [1052]

  - UnprovableResult [Line: 1050]: 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: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1059]: 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: 1060]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1057]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1054]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1041]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 1042]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 170 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.6s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1300 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 944 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 365 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3001 IncrementalHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 365 mSolverCounterUnsat, 23 mSDtfsCounter, 3001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1624occurred in iteration=12, InterpolantAutomatonStates: 57, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 226 ConstructedInterpolants, 54 QuantifiedInterpolants, 1643 SizeOfPredicates, 14 NumberOfNonLiveVariables, 919 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 3/5 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:42:28,327 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
