./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 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 12:09:40,616 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 12:09:40,618 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 12:09:40,640 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 12:09:40,641 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 12:09:40,642 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 12:09:40,643 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 12:09:40,644 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 12:09:40,645 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 12:09:40,646 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 12:09:40,646 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 12:09:40,647 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 12:09:40,648 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 12:09:40,648 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 12:09:40,649 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 12:09:40,650 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 12:09:40,651 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 12:09:40,651 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 12:09:40,653 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 12:09:40,654 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 12:09:40,655 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 12:09:40,656 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 12:09:40,657 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 12:09:40,658 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 12:09:40,660 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 12:09:40,660 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 12:09:40,660 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 12:09:40,661 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 12:09:40,661 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 12:09:40,662 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 12:09:40,662 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 12:09:40,663 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 12:09:40,664 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 12:09:40,664 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 12:09:40,665 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 12:09:40,665 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 12:09:40,666 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 12:09:40,666 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 12:09:40,666 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 12:09:40,667 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 12:09:40,667 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 12:09:40,668 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 12:09:40,685 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 12:09:40,685 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 12:09:40,685 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 12:09:40,686 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 12:09:40,686 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 12:09:40,686 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 12:09:40,687 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 12:09:40,687 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 12:09:40,687 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 12:09:40,688 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 12:09:40,688 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 12:09:40,688 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 12:09:40,688 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 12:09:40,688 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 12:09:40,688 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 12:09:40,689 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 12:09:40,689 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 12:09:40,689 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 12:09:40,689 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 12:09:40,689 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 12:09:40,690 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 12:09:40,690 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 12:09:40,690 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 12:09:40,690 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 12:09:40,690 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 12:09:40,690 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 12:09:40,691 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:09:40,691 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 12:09:40,691 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 12:09:40,691 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 12:09:40,691 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 12:09:40,692 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 12:09:40,692 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 12:09:40,692 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 12:09:40,692 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 12:09:40,692 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 12:09:40,692 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 12:09:40,693 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 -> 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
[2023-11-03 12:09:40,917 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 12:09:40,937 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 12:09:40,939 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 12:09:40,940 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 12:09:40,941 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 12:09:40,942 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-11-03 12:09:41,988 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 12:09:42,232 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 12:09:42,233 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-11-03 12:09:42,245 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/a326be662/643b2e0e81734968add7e39d100092f9/FLAG8a105d427
[2023-11-03 12:09:42,599 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/a326be662/643b2e0e81734968add7e39d100092f9
[2023-11-03 12:09:42,601 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 12:09:42,602 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 12:09:42,603 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 12:09:42,603 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 12:09:42,606 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 12:09:42,607 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:09:42" (1/1) ...
[2023-11-03 12:09:42,608 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fee9f3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:42, skipping insertion in model container
[2023-11-03 12:09:42,608 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:09:42" (1/1) ...
[2023-11-03 12:09:42,614 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 12:09:42,652 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 12:09:42,773 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:09:42,913 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-11-03 12:09:42,919 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:09:42,930 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 12:09:42,941 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:09:42,963 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-11-03 12:09:42,967 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:09:43,004 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 12:09:43,004 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43 WrapperNode
[2023-11-03 12:09:43,005 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 12:09:43,006 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 12:09:43,006 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 12:09:43,006 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 12:09:43,011 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,027 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,047 INFO  L138                Inliner]: procedures = 278, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 103
[2023-11-03 12:09:43,047 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 12:09:43,048 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 12:09:43,048 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 12:09:43,048 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 12:09:43,056 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,056 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,059 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,060 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,070 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,073 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,075 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,076 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,079 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 12:09:43,080 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 12:09:43,080 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 12:09:43,080 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 12:09:43,081 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (1/1) ...
[2023-11-03 12:09:43,087 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:09:43,098 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:09:43,115 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-11-03 12:09:43,118 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-11-03 12:09:43,141 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 12:09:43,142 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 12:09:43,142 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 12:09:43,143 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 12:09:43,144 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 12:09:43,266 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 12:09:43,268 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 12:09:43,534 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 12:09:43,542 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 12:09:43,542 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 12:09:43,544 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:09:43 BoogieIcfgContainer
[2023-11-03 12:09:43,544 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 12:09:43,546 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 12:09:43,546 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 12:09:43,548 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 12:09:43,548 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 12:09:42" (1/3) ...
[2023-11-03 12:09:43,549 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e4607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:09:43, skipping insertion in model container
[2023-11-03 12:09:43,549 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:43" (2/3) ...
[2023-11-03 12:09:43,549 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e4607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:09:43, skipping insertion in model container
[2023-11-03 12:09:43,549 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:09:43" (3/3) ...
[2023-11-03 12:09:43,551 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2023-11-03 12:09:43,557 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 12:09:43,565 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 12:09:43,565 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2023-11-03 12:09:43,565 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 12:09:43,624 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 12:09:43,659 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2023-11-03 12:09:43,727 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2023-11-03 12:09:43,727 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:09:43,732 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-11-03 12:09:43,732 INFO  L82        GeneralOperation]: Start removeDead. Operand has 147 places, 149 transitions, 306 flow
[2023-11-03 12:09:43,737 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 306 flow
[2023-11-03 12:09:43,740 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 12:09:43,747 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 306 flow
[2023-11-03 12:09:43,750 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 306 flow
[2023-11-03 12:09:43,750 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 306 flow
[2023-11-03 12:09:43,786 INFO  L130       PetriNetUnfolder]: 7/215 cut-off events.
[2023-11-03 12:09:43,787 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:09:43,787 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-11-03 12:09:43,789 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3942
[2023-11-03 12:09:46,098 INFO  L134        LiptonReduction]: Checked pairs total: 25074
[2023-11-03 12:09:46,098 INFO  L136        LiptonReduction]: Total number of compositions: 96
[2023-11-03 12:09:46,111 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 12:09:46,116 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;@37c29864, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 12:09:46,116 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-11-03 12:09:46,118 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-11-03 12:09:46,118 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 12:09:46,118 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:46,118 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 12:09:46,119 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-11-03 12:09:46,122 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:46,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 480, now seen corresponding path program 1 times
[2023-11-03 12:09:46,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:46,130 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815584019]
[2023-11-03 12:09:46,130 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:46,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:46,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:46,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:09:46,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:46,222 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815584019]
[2023-11-03 12:09:46,223 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815584019] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:46,223 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:46,223 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 12:09:46,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214356083]
[2023-11-03 12:09:46,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:46,233 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 12:09:46,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:46,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 12:09:46,253 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 12:09:46,255 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 245
[2023-11-03 12:09:46,257 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-11-03 12:09:46,257 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:46,257 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 245
[2023-11-03 12:09:46,258 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:46,370 INFO  L130       PetriNetUnfolder]: 85/397 cut-off events.
[2023-11-03 12:09:46,370 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-11-03 12:09:46,371 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-11-03 12:09:46,374 INFO  L137   encePairwiseOnDemand]: 244/245 looper letters, 23 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2023-11-03 12:09:46,374 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 186 flow
[2023-11-03 12:09:46,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 12:09:46,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 12:09:46,385 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 310 transitions.
[2023-11-03 12:09:46,387 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6326530612244898
[2023-11-03 12:09:46,388 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 310 transitions.
[2023-11-03 12:09:46,388 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 310 transitions.
[2023-11-03 12:09:46,390 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:46,391 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 310 transitions.
[2023-11-03 12:09:46,394 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-11-03 12:09:46,398 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-11-03 12:09:46,399 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-11-03 12:09:46,400 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 310 transitions.
[2023-11-03 12:09:46,401 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 186 flow
[2023-11-03 12:09:46,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:09:46,405 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2023-11-03 12:09:46,407 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-11-03 12:09:46,410 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2023-11-03 12:09:46,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2023-11-03 12:09:46,410 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-11-03 12:09:46,410 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:46,410 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-03 12:09:46,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 12:09:46,411 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-11-03 12:09:46,411 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:46,412 INFO  L85        PathProgramCache]: Analyzing trace with hash 472525, now seen corresponding path program 1 times
[2023-11-03 12:09:46,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:46,412 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346908352]
[2023-11-03 12:09:46,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:46,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:46,437 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:46,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:09:46,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:46,491 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346908352]
[2023-11-03 12:09:46,491 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346908352] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:46,491 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:46,491 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 12:09:46,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445237049]
[2023-11-03 12:09:46,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:46,493 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 12:09:46,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:46,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 12:09:46,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 12:09:46,513 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 245
[2023-11-03 12:09:46,514 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-11-03 12:09:46,514 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:46,514 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 245
[2023-11-03 12:09:46,514 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:46,613 INFO  L130       PetriNetUnfolder]: 132/476 cut-off events.
[2023-11-03 12:09:46,613 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-11-03 12:09:46,614 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-11-03 12:09:46,616 INFO  L137   encePairwiseOnDemand]: 234/245 looper letters, 43 selfloop transitions, 8 changer transitions 0/88 dead transitions.
[2023-11-03 12:09:46,616 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 286 flow
[2023-11-03 12:09:46,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 12:09:46,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 12:09:46,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions.
[2023-11-03 12:09:46,619 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6122448979591837
[2023-11-03 12:09:46,619 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 450 transitions.
[2023-11-03 12:09:46,620 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions.
[2023-11-03 12:09:46,620 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:46,620 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions.
[2023-11-03 12:09:46,622 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-11-03 12:09:46,624 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-11-03 12:09:46,624 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-11-03 12:09:46,624 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 450 transitions.
[2023-11-03 12:09:46,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 286 flow
[2023-11-03 12:09:46,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:09:46,626 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2023-11-03 12:09:46,627 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-11-03 12:09:46,627 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2023-11-03 12:09:46,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2023-11-03 12:09:46,628 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-11-03 12:09:46,628 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:46,628 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:09:46,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 12:09:46,628 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-11-03 12:09:46,629 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:46,629 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738520444, now seen corresponding path program 1 times
[2023-11-03 12:09:46,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:46,629 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856456806]
[2023-11-03 12:09:46,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:46,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:46,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:46,747 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:09:46,747 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:46,748 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856456806]
[2023-11-03 12:09:46,748 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856456806] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:46,749 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:46,749 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 12:09:46,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828732342]
[2023-11-03 12:09:46,749 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:46,750 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 12:09:46,750 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:46,751 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 12:09:46,751 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-03 12:09:46,799 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 245
[2023-11-03 12:09:46,799 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-11-03 12:09:46,800 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:46,800 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 245
[2023-11-03 12:09:46,800 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:46,924 INFO  L130       PetriNetUnfolder]: 104/565 cut-off events.
[2023-11-03 12:09:46,924 INFO  L131       PetriNetUnfolder]: For 92/94 co-relation queries the response was YES.
[2023-11-03 12:09:46,926 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-11-03 12:09:46,928 INFO  L137   encePairwiseOnDemand]: 241/245 looper letters, 41 selfloop transitions, 3 changer transitions 1/91 dead transitions.
[2023-11-03 12:09:46,928 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 350 flow
[2023-11-03 12:09:46,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 12:09:46,928 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 12:09:46,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions.
[2023-11-03 12:09:46,930 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5969387755102041
[2023-11-03 12:09:46,930 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 585 transitions.
[2023-11-03 12:09:46,930 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions.
[2023-11-03 12:09:46,931 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:46,931 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions.
[2023-11-03 12:09:46,933 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-11-03 12:09:46,936 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-11-03 12:09:46,936 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-11-03 12:09:46,936 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 4 states and 585 transitions.
[2023-11-03 12:09:46,936 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 350 flow
[2023-11-03 12:09:46,940 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 12:09:46,941 INFO  L231             Difference]: Finished difference. Result has 76 places, 75 transitions, 210 flow
[2023-11-03 12:09:46,942 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-11-03 12:09:46,942 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 7 predicate places.
[2023-11-03 12:09:46,942 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 210 flow
[2023-11-03 12:09:46,943 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-11-03 12:09:46,943 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:46,943 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:09:46,943 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 12:09:46,944 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-11-03 12:09:46,944 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:46,944 INFO  L85        PathProgramCache]: Analyzing trace with hash -1699318889, now seen corresponding path program 1 times
[2023-11-03 12:09:46,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:46,945 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293349869]
[2023-11-03 12:09:46,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:46,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:46,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:47,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:09:47,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:47,191 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293349869]
[2023-11-03 12:09:47,191 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293349869] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:47,191 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:47,191 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:09:47,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555974127]
[2023-11-03 12:09:47,192 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:47,192 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:09:47,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:47,192 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:09:47,193 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:09:47,348 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 245
[2023-11-03 12:09:47,349 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-11-03 12:09:47,349 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:47,349 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 245
[2023-11-03 12:09:47,349 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:47,609 INFO  L130       PetriNetUnfolder]: 395/1189 cut-off events.
[2023-11-03 12:09:47,609 INFO  L131       PetriNetUnfolder]: For 92/95 co-relation queries the response was YES.
[2023-11-03 12:09:47,613 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-11-03 12:09:47,618 INFO  L137   encePairwiseOnDemand]: 222/245 looper letters, 88 selfloop transitions, 29 changer transitions 0/143 dead transitions.
[2023-11-03 12:09:47,619 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 143 transitions, 606 flow
[2023-11-03 12:09:47,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:09:47,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:09:47,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions.
[2023-11-03 12:09:47,622 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5591836734693878
[2023-11-03 12:09:47,622 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 822 transitions.
[2023-11-03 12:09:47,622 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions.
[2023-11-03 12:09:47,622 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:47,622 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions.
[2023-11-03 12:09:47,624 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-11-03 12:09:47,627 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-11-03 12:09:47,627 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-11-03 12:09:47,628 INFO  L175             Difference]: Start difference. First operand has 76 places, 75 transitions, 210 flow. Second operand 6 states and 822 transitions.
[2023-11-03 12:09:47,628 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 143 transitions, 606 flow
[2023-11-03 12:09:47,630 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 143 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 12:09:47,632 INFO  L231             Difference]: Finished difference. Result has 85 places, 104 transitions, 428 flow
[2023-11-03 12:09:47,632 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-11-03 12:09:47,633 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 16 predicate places.
[2023-11-03 12:09:47,633 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 104 transitions, 428 flow
[2023-11-03 12:09:47,633 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-11-03 12:09:47,633 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:47,634 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:09:47,634 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 12:09:47,634 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-11-03 12:09:47,634 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:47,634 INFO  L85        PathProgramCache]: Analyzing trace with hash 120947037, now seen corresponding path program 1 times
[2023-11-03 12:09:47,634 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:47,635 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402871158]
[2023-11-03 12:09:47,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:47,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:47,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:47,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:09:47,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:47,675 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402871158]
[2023-11-03 12:09:47,675 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402871158] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:47,675 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:47,675 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 12:09:47,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888718433]
[2023-11-03 12:09:47,676 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:47,676 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 12:09:47,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:47,676 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 12:09:47,676 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 12:09:47,699 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 245
[2023-11-03 12:09:47,700 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-11-03 12:09:47,700 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:47,700 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 245
[2023-11-03 12:09:47,700 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:47,821 INFO  L130       PetriNetUnfolder]: 206/854 cut-off events.
[2023-11-03 12:09:47,821 INFO  L131       PetriNetUnfolder]: For 246/261 co-relation queries the response was YES.
[2023-11-03 12:09:47,823 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-11-03 12:09:47,826 INFO  L137   encePairwiseOnDemand]: 240/245 looper letters, 39 selfloop transitions, 6 changer transitions 0/114 dead transitions.
[2023-11-03 12:09:47,826 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 114 transitions, 548 flow
[2023-11-03 12:09:47,826 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 12:09:47,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 12:09:47,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions.
[2023-11-03 12:09:47,828 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5904761904761905
[2023-11-03 12:09:47,828 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 434 transitions.
[2023-11-03 12:09:47,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions.
[2023-11-03 12:09:47,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:47,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions.
[2023-11-03 12:09:47,829 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-11-03 12:09:47,830 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-11-03 12:09:47,831 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-11-03 12:09:47,831 INFO  L175             Difference]: Start difference. First operand has 85 places, 104 transitions, 428 flow. Second operand 3 states and 434 transitions.
[2023-11-03 12:09:47,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 114 transitions, 548 flow
[2023-11-03 12:09:47,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 114 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:09:47,836 INFO  L231             Difference]: Finished difference. Result has 88 places, 108 transitions, 470 flow
[2023-11-03 12:09:47,836 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-11-03 12:09:47,836 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2023-11-03 12:09:47,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 108 transitions, 470 flow
[2023-11-03 12:09:47,837 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-11-03 12:09:47,837 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:47,837 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:09:47,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 12:09:47,837 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-11-03 12:09:47,838 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:47,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -957762772, now seen corresponding path program 1 times
[2023-11-03 12:09:47,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:47,838 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535836603]
[2023-11-03 12:09:47,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:47,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:47,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:47,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:09:47,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:47,865 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535836603]
[2023-11-03 12:09:47,865 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535836603] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:47,865 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:47,865 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 12:09:47,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900434240]
[2023-11-03 12:09:47,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:47,866 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 12:09:47,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:47,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 12:09:47,866 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 12:09:47,878 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 136 out of 245
[2023-11-03 12:09:47,879 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-11-03 12:09:47,879 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:47,879 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 245
[2023-11-03 12:09:47,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:47,990 INFO  L130       PetriNetUnfolder]: 221/839 cut-off events.
[2023-11-03 12:09:47,990 INFO  L131       PetriNetUnfolder]: For 364/387 co-relation queries the response was YES.
[2023-11-03 12:09:47,991 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-11-03 12:09:47,994 INFO  L137   encePairwiseOnDemand]: 241/245 looper letters, 46 selfloop transitions, 2 changer transitions 1/119 dead transitions.
[2023-11-03 12:09:47,994 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 119 transitions, 612 flow
[2023-11-03 12:09:47,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 12:09:47,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 12:09:47,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions.
[2023-11-03 12:09:47,996 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6095238095238096
[2023-11-03 12:09:47,996 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 448 transitions.
[2023-11-03 12:09:47,996 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions.
[2023-11-03 12:09:47,996 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:47,996 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions.
[2023-11-03 12:09:47,997 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-11-03 12:09:47,999 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-11-03 12:09:47,999 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-11-03 12:09:47,999 INFO  L175             Difference]: Start difference. First operand has 88 places, 108 transitions, 470 flow. Second operand 3 states and 448 transitions.
[2023-11-03 12:09:47,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 119 transitions, 612 flow
[2023-11-03 12:09:48,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 119 transitions, 604 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 12:09:48,003 INFO  L231             Difference]: Finished difference. Result has 88 places, 107 transitions, 468 flow
[2023-11-03 12:09:48,004 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-11-03 12:09:48,004 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 19 predicate places.
[2023-11-03 12:09:48,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 468 flow
[2023-11-03 12:09:48,005 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-11-03 12:09:48,005 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:48,005 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-11-03 12:09:48,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 12:09:48,005 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-11-03 12:09:48,005 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:48,006 INFO  L85        PathProgramCache]: Analyzing trace with hash -949124360, now seen corresponding path program 1 times
[2023-11-03 12:09:48,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:48,006 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598495309]
[2023-11-03 12:09:48,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:48,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:48,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:48,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:09:48,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:48,276 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598495309]
[2023-11-03 12:09:48,276 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598495309] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:48,276 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:48,276 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:09:48,277 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291792558]
[2023-11-03 12:09:48,277 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:48,277 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:09:48,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:48,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:09:48,278 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:09:48,387 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245
[2023-11-03 12:09:48,389 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-11-03 12:09:48,389 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:48,389 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245
[2023-11-03 12:09:48,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:48,997 INFO  L130       PetriNetUnfolder]: 565/1518 cut-off events.
[2023-11-03 12:09:48,997 INFO  L131       PetriNetUnfolder]: For 805/819 co-relation queries the response was YES.
[2023-11-03 12:09:49,001 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-11-03 12:09:49,008 INFO  L137   encePairwiseOnDemand]: 222/245 looper letters, 127 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2023-11-03 12:09:49,008 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 241 transitions, 1452 flow
[2023-11-03 12:09:49,008 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:09:49,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:09:49,010 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 857 transitions.
[2023-11-03 12:09:49,010 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5829931972789115
[2023-11-03 12:09:49,010 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 857 transitions.
[2023-11-03 12:09:49,011 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 857 transitions.
[2023-11-03 12:09:49,011 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:49,011 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 857 transitions.
[2023-11-03 12:09:49,013 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-11-03 12:09:49,014 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-11-03 12:09:49,015 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-11-03 12:09:49,015 INFO  L175             Difference]: Start difference. First operand has 88 places, 107 transitions, 468 flow. Second operand 6 states and 857 transitions.
[2023-11-03 12:09:49,015 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 241 transitions, 1452 flow
[2023-11-03 12:09:49,020 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1436 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-11-03 12:09:49,022 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2023-11-03 12:09:49,023 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-11-03 12:09:49,023 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-11-03 12:09:49,023 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2023-11-03 12:09:49,024 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-11-03 12:09:49,024 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:49,024 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-11-03 12:09:49,024 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 12:09:49,024 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-11-03 12:09:49,025 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:49,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 1013407062, now seen corresponding path program 1 times
[2023-11-03 12:09:49,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:49,025 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130041462]
[2023-11-03 12:09:49,025 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:49,025 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:49,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:49,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:09:49,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:49,351 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130041462]
[2023-11-03 12:09:49,351 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130041462] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:49,351 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:49,351 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 12:09:49,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398165937]
[2023-11-03 12:09:49,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:49,352 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 12:09:49,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:49,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 12:09:49,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 12:09:49,661 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 245
[2023-11-03 12:09:49,663 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-11-03 12:09:49,663 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:49,663 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 245
[2023-11-03 12:09:49,663 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:49,895 INFO  L130       PetriNetUnfolder]: 524/1426 cut-off events.
[2023-11-03 12:09:49,896 INFO  L131       PetriNetUnfolder]: For 1458/1470 co-relation queries the response was YES.
[2023-11-03 12:09:49,899 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-11-03 12:09:49,903 INFO  L137   encePairwiseOnDemand]: 236/245 looper letters, 158 selfloop transitions, 7 changer transitions 1/209 dead transitions.
[2023-11-03 12:09:49,904 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 209 transitions, 1668 flow
[2023-11-03 12:09:49,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 12:09:49,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 12:09:49,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions.
[2023-11-03 12:09:49,906 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5102040816326531
[2023-11-03 12:09:49,906 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 875 transitions.
[2023-11-03 12:09:49,906 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions.
[2023-11-03 12:09:49,907 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:49,907 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions.
[2023-11-03 12:09:49,908 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-11-03 12:09:49,910 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-11-03 12:09:49,911 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-11-03 12:09:49,911 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 875 transitions.
[2023-11-03 12:09:49,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 209 transitions, 1668 flow
[2023-11-03 12:09:49,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 209 transitions, 1614 flow, removed 27 selfloop flow, removed 0 redundant places.
[2023-11-03 12:09:49,922 INFO  L231             Difference]: Finished difference. Result has 102 places, 189 transitions, 1208 flow
[2023-11-03 12:09:49,922 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-11-03 12:09:49,923 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 33 predicate places.
[2023-11-03 12:09:49,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 189 transitions, 1208 flow
[2023-11-03 12:09:49,923 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-11-03 12:09:49,924 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:49,924 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-11-03 12:09:49,924 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 12:09:49,924 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-11-03 12:09:49,924 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:49,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -1627961114, now seen corresponding path program 1 times
[2023-11-03 12:09:49,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:49,925 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105571731]
[2023-11-03 12:09:49,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:49,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:49,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:50,196 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:09:50,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:50,196 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105571731]
[2023-11-03 12:09:50,197 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105571731] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:50,197 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:50,197 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 12:09:50,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962893988]
[2023-11-03 12:09:50,197 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:50,197 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 12:09:50,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:50,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 12:09:50,198 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 12:09:50,422 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245
[2023-11-03 12:09:50,423 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-11-03 12:09:50,423 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:50,423 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245
[2023-11-03 12:09:50,423 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:50,884 INFO  L130       PetriNetUnfolder]: 540/1423 cut-off events.
[2023-11-03 12:09:50,884 INFO  L131       PetriNetUnfolder]: For 1470/1481 co-relation queries the response was YES.
[2023-11-03 12:09:50,890 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-11-03 12:09:50,896 INFO  L137   encePairwiseOnDemand]: 232/245 looper letters, 254 selfloop transitions, 62 changer transitions 1/343 dead transitions.
[2023-11-03 12:09:50,896 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 343 transitions, 2754 flow
[2023-11-03 12:09:50,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-03 12:09:50,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-03 12:09:50,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1078 transitions.
[2023-11-03 12:09:50,901 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.55
[2023-11-03 12:09:50,901 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1078 transitions.
[2023-11-03 12:09:50,901 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1078 transitions.
[2023-11-03 12:09:50,902 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:50,902 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1078 transitions.
[2023-11-03 12:09:50,904 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-11-03 12:09:50,906 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-11-03 12:09:50,906 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-11-03 12:09:50,906 INFO  L175             Difference]: Start difference. First operand has 102 places, 189 transitions, 1208 flow. Second operand 8 states and 1078 transitions.
[2023-11-03 12:09:50,906 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 343 transitions, 2754 flow
[2023-11-03 12:09:50,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 343 transitions, 2724 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-11-03 12:09:50,919 INFO  L231             Difference]: Finished difference. Result has 114 places, 216 transitions, 1638 flow
[2023-11-03 12:09:50,920 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-11-03 12:09:50,920 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 45 predicate places.
[2023-11-03 12:09:50,921 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 216 transitions, 1638 flow
[2023-11-03 12:09:50,921 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-11-03 12:09:50,921 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:50,921 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-11-03 12:09:50,921 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 12:09:50,922 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-11-03 12:09:50,922 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:50,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -776168387, now seen corresponding path program 1 times
[2023-11-03 12:09:50,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:50,922 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198268759]
[2023-11-03 12:09:50,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:50,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:50,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:50,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:09:50,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:50,960 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198268759]
[2023-11-03 12:09:50,960 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198268759] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:50,960 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:50,960 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 12:09:50,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748723928]
[2023-11-03 12:09:50,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:50,960 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 12:09:50,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:50,961 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 12:09:50,961 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 12:09:50,981 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 245
[2023-11-03 12:09:50,982 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-11-03 12:09:50,982 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:50,982 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 245
[2023-11-03 12:09:50,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:51,189 INFO  L130       PetriNetUnfolder]: 407/1207 cut-off events.
[2023-11-03 12:09:51,189 INFO  L131       PetriNetUnfolder]: For 3288/3310 co-relation queries the response was YES.
[2023-11-03 12:09:51,193 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-11-03 12:09:51,197 INFO  L137   encePairwiseOnDemand]: 239/245 looper letters, 46 selfloop transitions, 10 changer transitions 28/233 dead transitions.
[2023-11-03 12:09:51,197 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 233 transitions, 1857 flow
[2023-11-03 12:09:51,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 12:09:51,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 12:09:51,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2023-11-03 12:09:51,199 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6
[2023-11-03 12:09:51,199 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2023-11-03 12:09:51,199 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2023-11-03 12:09:51,200 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:51,200 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2023-11-03 12:09:51,200 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-11-03 12:09:51,201 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-11-03 12:09:51,202 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-11-03 12:09:51,202 INFO  L175             Difference]: Start difference. First operand has 114 places, 216 transitions, 1638 flow. Second operand 3 states and 441 transitions.
[2023-11-03 12:09:51,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 233 transitions, 1857 flow
[2023-11-03 12:09:51,217 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 233 transitions, 1853 flow, removed 2 selfloop flow, removed 0 redundant places.
[2023-11-03 12:09:51,220 INFO  L231             Difference]: Finished difference. Result has 117 places, 199 transitions, 1501 flow
[2023-11-03 12:09:51,220 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-11-03 12:09:51,220 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 48 predicate places.
[2023-11-03 12:09:51,221 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 199 transitions, 1501 flow
[2023-11-03 12:09:51,221 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-11-03 12:09:51,221 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:51,221 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-11-03 12:09:51,221 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 12:09:51,221 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-11-03 12:09:51,222 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:51,222 INFO  L85        PathProgramCache]: Analyzing trace with hash -1511156484, now seen corresponding path program 1 times
[2023-11-03 12:09:51,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:51,222 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446332803]
[2023-11-03 12:09:51,222 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:51,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:51,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:09:51,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:09:51,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 12:09:51,429 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446332803]
[2023-11-03 12:09:51,429 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446332803] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:09:51,429 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:09:51,429 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:09:51,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401740941]
[2023-11-03 12:09:51,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:09:51,430 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:09:51,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 12:09:51,431 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:09:51,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:09:51,646 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 245
[2023-11-03 12:09:51,647 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-11-03 12:09:51,647 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:09:51,647 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 245
[2023-11-03 12:09:51,647 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:09:52,009 INFO  L130       PetriNetUnfolder]: 476/1312 cut-off events.
[2023-11-03 12:09:52,010 INFO  L131       PetriNetUnfolder]: For 3861/3912 co-relation queries the response was YES.
[2023-11-03 12:09:52,016 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-11-03 12:09:52,022 INFO  L137   encePairwiseOnDemand]: 234/245 looper letters, 92 selfloop transitions, 41 changer transitions 35/265 dead transitions.
[2023-11-03 12:09:52,022 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 265 transitions, 2356 flow
[2023-11-03 12:09:52,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:09:52,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:09:52,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 847 transitions.
[2023-11-03 12:09:52,025 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5761904761904761
[2023-11-03 12:09:52,025 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 847 transitions.
[2023-11-03 12:09:52,025 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 847 transitions.
[2023-11-03 12:09:52,025 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:09:52,025 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 847 transitions.
[2023-11-03 12:09:52,027 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-11-03 12:09:52,028 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-11-03 12:09:52,029 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-11-03 12:09:52,029 INFO  L175             Difference]: Start difference. First operand has 117 places, 199 transitions, 1501 flow. Second operand 6 states and 847 transitions.
[2023-11-03 12:09:52,029 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 265 transitions, 2356 flow
[2023-11-03 12:09:52,046 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 265 transitions, 2329 flow, removed 1 selfloop flow, removed 4 redundant places.
[2023-11-03 12:09:52,050 INFO  L231             Difference]: Finished difference. Result has 122 places, 222 transitions, 1887 flow
[2023-11-03 12:09:52,050 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-11-03 12:09:52,050 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 53 predicate places.
[2023-11-03 12:09:52,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 222 transitions, 1887 flow
[2023-11-03 12:09:52,051 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-11-03 12:09:52,051 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:09:52,051 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-11-03 12:09:52,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 12:09:52,051 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-11-03 12:09:52,052 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:09:52,052 INFO  L85        PathProgramCache]: Analyzing trace with hash 880579718, now seen corresponding path program 1 times
[2023-11-03 12:09:52,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 12:09:52,052 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341964246]
[2023-11-03 12:09:52,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:09:52,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 12:09:52,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:09:52,071 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 12:09:52,089 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:09:52,110 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 12:09:52,111 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 12:09:52,111 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2023-11-03 12:09:52,113 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-11-03 12:09:52,113 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-11-03 12:09:52,113 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-11-03 12:09:52,113 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-11-03 12:09:52,113 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-11-03 12:09:52,113 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-11-03 12:09:52,113 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-11-03 12:09:52,114 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-11-03 12:09:52,115 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-03 12:09:52,115 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:09:52,121 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-03 12:09:52,121 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-03 12:09:52,162 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 12:09:52 BasicIcfg
[2023-11-03 12:09:52,163 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-03 12:09:52,163 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-03 12:09:52,163 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-11-03 12:09:52,163 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-11-03 12:09:52,164 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:09:43" (3/4) ...
[2023-11-03 12:09:52,166 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-11-03 12:09:52,166 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-03 12:09:52,166 INFO  L158              Benchmark]: Toolchain (without parser) took 9564.49ms. Allocated memory was 216.0MB in the beginning and 283.1MB in the end (delta: 67.1MB). Free memory was 177.5MB in the beginning and 106.7MB in the end (delta: 70.8MB). Peak memory consumption was 142.1MB. Max. memory is 16.1GB.
[2023-11-03 12:09:52,167 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 216.0MB. Free memory is still 190.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-03 12:09:52,167 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 402.06ms. Allocated memory is still 216.0MB. Free memory was 177.5MB in the beginning and 148.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
[2023-11-03 12:09:52,167 INFO  L158              Benchmark]: Boogie Procedure Inliner took 41.58ms. Allocated memory is still 216.0MB. Free memory was 148.1MB in the beginning and 145.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-03 12:09:52,167 INFO  L158              Benchmark]: Boogie Preprocessor took 31.47ms. Allocated memory is still 216.0MB. Free memory was 145.3MB in the beginning and 143.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-03 12:09:52,168 INFO  L158              Benchmark]: RCFGBuilder took 464.05ms. Allocated memory is still 216.0MB. Free memory was 143.2MB in the beginning and 124.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2023-11-03 12:09:52,168 INFO  L158              Benchmark]: TraceAbstraction took 8616.98ms. Allocated memory was 216.0MB in the beginning and 283.1MB in the end (delta: 67.1MB). Free memory was 123.6MB in the beginning and 106.7MB in the end (delta: 16.9MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB.
[2023-11-03 12:09:52,168 INFO  L158              Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 283.1MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-03 12:09:52,169 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.12ms. Allocated memory is still 216.0MB. Free memory is still 190.5MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 402.06ms. Allocated memory is still 216.0MB. Free memory was 177.5MB in the beginning and 148.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 41.58ms. Allocated memory is still 216.0MB. Free memory was 148.1MB in the beginning and 145.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 31.47ms. Allocated memory is still 216.0MB. Free memory was 145.3MB in the beginning and 143.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 464.05ms. Allocated memory is still 216.0MB. Free memory was 143.2MB in the beginning and 124.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8616.98ms. Allocated memory was 216.0MB in the beginning and 283.1MB in the end (delta: 67.1MB). Free memory was 123.6MB in the beginning and 106.7MB in the end (delta: 16.9MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB.
 * Witness Printer took 2.80ms. Allocated memory is still 283.1MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 2.3s, 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, (void*)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, (void*)j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1054]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
         VAL             [\read(*tids)={-3:0}, arg={0:3}, datas={-2:0}, i=0, j=3, pthread_create(&tids[i], ((void *)0), &thread, (void*)j)=-4, threads_mask=-1, threads_total=31, tids={8:0}]
[L1040]               1  int j = (int)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: 8.5s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1020 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 702 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 2.1s 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.1s SatisfiabilityAnalysisTime, 1.4s 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-11-03 12:09:52,185 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 12:09:53,958 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 12:09:53,960 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 12:09:53,983 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 12:09:53,984 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 12:09:53,985 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 12:09:53,986 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 12:09:53,987 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 12:09:53,988 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 12:09:53,989 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 12:09:53,990 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 12:09:53,990 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 12:09:53,991 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 12:09:53,991 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 12:09:53,992 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 12:09:53,993 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 12:09:53,994 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 12:09:53,995 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 12:09:53,996 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 12:09:53,997 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 12:09:53,998 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 12:09:53,999 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 12:09:54,000 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 12:09:54,001 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 12:09:54,003 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 12:09:54,004 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 12:09:54,004 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 12:09:54,005 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 12:09:54,005 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 12:09:54,006 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 12:09:54,006 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 12:09:54,006 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 12:09:54,007 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 12:09:54,008 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 12:09:54,008 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 12:09:54,008 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 12:09:54,009 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 12:09:54,009 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 12:09:54,009 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 12:09:54,010 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 12:09:54,010 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 12:09:54,011 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Bitvector.epf
[2023-11-03 12:09:54,030 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 12:09:54,030 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 12:09:54,030 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 12:09:54,030 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 12:09:54,031 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 12:09:54,031 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 12:09:54,032 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 12:09:54,032 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 12:09:54,032 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 12:09:54,032 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 12:09:54,032 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 12:09:54,033 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 12:09:54,033 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 12:09:54,033 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 12:09:54,033 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 12:09:54,033 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 12:09:54,033 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 12:09:54,033 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 12:09:54,033 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-11-03 12:09:54,034 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-11-03 12:09:54,034 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 12:09:54,034 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 12:09:54,034 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 12:09:54,034 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 12:09:54,034 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 12:09:54,034 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 12:09:54,035 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 12:09:54,035 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:09:54,035 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 12:09:54,035 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 12:09:54,035 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 12:09:54,035 INFO  L138        SettingsManager]:  * Trace refinement strategy=WOLF
[2023-11-03 12:09:54,036 INFO  L138        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-11-03 12:09:54,036 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 12:09:54,036 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 12:09:54,036 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 12:09:54,036 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 12:09:54,036 INFO  L138        SettingsManager]:  * Logic for external solver=AUFBV
[2023-11-03 12:09:54,036 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 12:09:54,036 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 -> 6c4ed3e2a82a65e4e5822106607d69caac9bb1b03d24f9127c093cc95d8a8150
[2023-11-03 12:09:54,330 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 12:09:54,355 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 12:09:54,358 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 12:09:54,359 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 12:09:54,360 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 12:09:54,361 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-11-03 12:09:55,332 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 12:09:55,557 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 12:09:55,558 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2023-11-03 12:09:55,569 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/ebe1de10b/7c06895b7055400ba50295712c9d8f05/FLAGae37d18a9
[2023-11-03 12:09:55,880 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/ebe1de10b/7c06895b7055400ba50295712c9d8f05
[2023-11-03 12:09:55,882 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 12:09:55,883 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 12:09:55,884 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 12:09:55,884 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 12:09:55,887 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 12:09:55,888 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:09:55" (1/1) ...
[2023-11-03 12:09:55,888 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f963d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:55, skipping insertion in model container
[2023-11-03 12:09:55,888 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:09:55" (1/1) ...
[2023-11-03 12:09:55,894 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 12:09:55,926 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 12:09:56,043 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:09:56,221 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-11-03 12:09:56,227 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:09:56,241 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 12:09:56,251 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 12:09:56,272 WARN  L623        FunctionHandler]: Unknown extern function ffs
[2023-11-03 12:09:56,278 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 12:09:56,319 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 12:09:56,320 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56 WrapperNode
[2023-11-03 12:09:56,320 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 12:09:56,321 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 12:09:56,321 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 12:09:56,321 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 12:09:56,326 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,344 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,363 INFO  L138                Inliner]: procedures = 279, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 102
[2023-11-03 12:09:56,364 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 12:09:56,364 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 12:09:56,364 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 12:09:56,364 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 12:09:56,372 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,372 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,386 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,386 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,396 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,399 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,401 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,402 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,406 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 12:09:56,406 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 12:09:56,406 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 12:09:56,406 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 12:09:56,407 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (1/1) ...
[2023-11-03 12:09:56,411 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 12:09:56,419 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 12:09:56,431 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-11-03 12:09:56,435 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-11-03 12:09:56,476 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2023-11-03 12:09:56,476 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 12:09:56,476 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 12:09:56,476 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 12:09:56,476 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-11-03 12:09:56,476 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 12:09:56,477 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 12:09:56,477 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2023-11-03 12:09:56,477 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 12:09:56,477 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 12:09:56,477 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 12:09:56,477 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 12:09:56,478 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 12:09:56,598 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 12:09:56,599 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 12:09:56,994 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 12:09:57,004 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 12:09:57,005 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 12:09:57,006 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:09:57 BoogieIcfgContainer
[2023-11-03 12:09:57,006 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 12:09:57,009 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 12:09:57,009 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 12:09:57,011 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 12:09:57,011 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 12:09:55" (1/3) ...
[2023-11-03 12:09:57,012 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74428d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:09:57, skipping insertion in model container
[2023-11-03 12:09:57,012 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:09:56" (2/3) ...
[2023-11-03 12:09:57,012 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74428d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:09:57, skipping insertion in model container
[2023-11-03 12:09:57,012 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:09:57" (3/3) ...
[2023-11-03 12:09:57,013 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2023-11-03 12:09:57,019 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 12:09:57,026 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 12:09:57,026 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2023-11-03 12:09:57,026 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 12:09:57,076 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 12:09:57,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2023-11-03 12:09:57,165 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2023-11-03 12:09:57,165 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:09:57,170 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-11-03 12:09:57,170 INFO  L82        GeneralOperation]: Start removeDead. Operand has 145 places, 147 transitions, 302 flow
[2023-11-03 12:09:57,174 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 147 transitions, 302 flow
[2023-11-03 12:09:57,177 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 12:09:57,184 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 147 transitions, 302 flow
[2023-11-03 12:09:57,187 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 147 transitions, 302 flow
[2023-11-03 12:09:57,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2023-11-03 12:09:57,219 INFO  L130       PetriNetUnfolder]: 7/212 cut-off events.
[2023-11-03 12:09:57,220 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 12:09:57,220 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-11-03 12:09:57,223 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3744
[2023-11-03 12:10:01,012 INFO  L134        LiptonReduction]: Checked pairs total: 25082
[2023-11-03 12:10:01,013 INFO  L136        LiptonReduction]: Total number of compositions: 95
[2023-11-03 12:10:01,025 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 12:10:01,029 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;@63908eaa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 12:10:01,029 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-11-03 12:10:01,031 INFO  L130       PetriNetUnfolder]: 0/1 cut-off events.
[2023-11-03 12:10:01,031 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 12:10:01,031 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:01,032 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 12:10:01,032 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-11-03 12:10:01,036 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:01,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 473, now seen corresponding path program 1 times
[2023-11-03 12:10:01,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:01,045 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709885705]
[2023-11-03 12:10:01,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:01,045 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-11-03 12:10:01,046 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:01,074 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-11-03 12:10:01,076 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-11-03 12:10:01,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:01,330 INFO  L263         TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-11-03 12:10:01,336 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:01,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:01,339 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:01,339 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:01,339 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709885705]
[2023-11-03 12:10:01,340 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [709885705] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:01,340 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:01,340 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 12:10:01,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269973322]
[2023-11-03 12:10:01,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:01,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 12:10:01,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:01,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 12:10:01,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 12:10:01,365 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 242
[2023-11-03 12:10:01,367 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-11-03 12:10:01,367 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:01,367 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 242
[2023-11-03 12:10:01,368 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:01,528 INFO  L130       PetriNetUnfolder]: 73/385 cut-off events.
[2023-11-03 12:10:01,528 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-11-03 12:10:01,530 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-11-03 12:10:01,535 INFO  L137   encePairwiseOnDemand]: 241/242 looper letters, 22 selfloop transitions, 0 changer transitions 0/66 dead transitions.
[2023-11-03 12:10:01,535 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 184 flow
[2023-11-03 12:10:01,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 12:10:01,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 12:10:01,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions.
[2023-11-03 12:10:01,555 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6301652892561983
[2023-11-03 12:10:01,556 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 305 transitions.
[2023-11-03 12:10:01,556 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions.
[2023-11-03 12:10:01,558 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:01,561 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions.
[2023-11-03 12:10:01,564 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-11-03 12:10:01,570 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-11-03 12:10:01,570 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-11-03 12:10:01,572 INFO  L175             Difference]: Start difference. First operand has 69 places, 67 transitions, 142 flow. Second operand 2 states and 305 transitions.
[2023-11-03 12:10:01,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 184 flow
[2023-11-03 12:10:01,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:10:01,578 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 140 flow
[2023-11-03 12:10:01,580 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-11-03 12:10:01,584 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places.
[2023-11-03 12:10:01,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 140 flow
[2023-11-03 12:10:01,585 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-11-03 12:10:01,585 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:01,586 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-03 12:10:01,609 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-11-03 12:10:01,787 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-11-03 12:10:01,788 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-11-03 12:10:01,789 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:01,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 467532, now seen corresponding path program 1 times
[2023-11-03 12:10:01,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:01,791 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492365450]
[2023-11-03 12:10:01,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:01,792 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-11-03 12:10:01,792 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:01,794 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-11-03 12:10:01,796 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-11-03 12:10:01,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:01,853 INFO  L263         TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-11-03 12:10:01,854 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:01,883 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:01,883 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:01,883 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:01,884 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492365450]
[2023-11-03 12:10:01,884 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [492365450] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:01,884 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:01,885 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 12:10:01,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373971168]
[2023-11-03 12:10:01,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:01,886 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 12:10:01,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:01,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 12:10:01,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 12:10:01,910 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 130 out of 242
[2023-11-03 12:10:01,928 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-11-03 12:10:01,929 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:01,929 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 242
[2023-11-03 12:10:01,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:02,115 INFO  L130       PetriNetUnfolder]: 119/458 cut-off events.
[2023-11-03 12:10:02,116 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-11-03 12:10:02,117 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-11-03 12:10:02,118 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 41 selfloop transitions, 8 changer transitions 0/87 dead transitions.
[2023-11-03 12:10:02,118 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 280 flow
[2023-11-03 12:10:02,119 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 12:10:02,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 12:10:02,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions.
[2023-11-03 12:10:02,122 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6088154269972452
[2023-11-03 12:10:02,122 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 442 transitions.
[2023-11-03 12:10:02,122 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions.
[2023-11-03 12:10:02,122 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:02,122 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions.
[2023-11-03 12:10:02,124 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-11-03 12:10:02,127 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-11-03 12:10:02,128 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-11-03 12:10:02,128 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 140 flow. Second operand 3 states and 442 transitions.
[2023-11-03 12:10:02,129 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 280 flow
[2023-11-03 12:10:02,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 87 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:10:02,132 INFO  L231             Difference]: Finished difference. Result has 73 places, 74 transitions, 210 flow
[2023-11-03 12:10:02,132 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-11-03 12:10:02,132 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 4 predicate places.
[2023-11-03 12:10:02,133 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 210 flow
[2023-11-03 12:10:02,133 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-11-03 12:10:02,133 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:02,133 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:10:02,144 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:02,334 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-11-03 12:10:02,335 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-11-03 12:10:02,336 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:02,336 INFO  L85        PathProgramCache]: Analyzing trace with hash -1212481378, now seen corresponding path program 1 times
[2023-11-03 12:10:02,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:02,337 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780682862]
[2023-11-03 12:10:02,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:02,338 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-11-03 12:10:02,338 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:02,340 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-11-03 12:10:02,342 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-11-03 12:10:02,390 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:02,392 INFO  L263         TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-11-03 12:10:02,393 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:02,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:02,403 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:02,404 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:02,404 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780682862]
[2023-11-03 12:10:02,404 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780682862] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:02,404 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:02,404 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 12:10:02,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056049007]
[2023-11-03 12:10:02,405 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:02,405 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 12:10:02,405 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:02,406 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 12:10:02,406 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 12:10:02,435 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2023-11-03 12:10:02,436 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-11-03 12:10:02,436 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:02,436 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2023-11-03 12:10:02,436 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:02,587 INFO  L130       PetriNetUnfolder]: 106/443 cut-off events.
[2023-11-03 12:10:02,587 INFO  L131       PetriNetUnfolder]: For 96/98 co-relation queries the response was YES.
[2023-11-03 12:10:02,588 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-11-03 12:10:02,591 INFO  L137   encePairwiseOnDemand]: 237/242 looper letters, 33 selfloop transitions, 6 changer transitions 0/83 dead transitions.
[2023-11-03 12:10:02,591 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 316 flow
[2023-11-03 12:10:02,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 12:10:02,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 12:10:02,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2023-11-03 12:10:02,594 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5867768595041323
[2023-11-03 12:10:02,594 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2023-11-03 12:10:02,594 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2023-11-03 12:10:02,595 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:02,595 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2023-11-03 12:10:02,597 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-11-03 12:10:02,600 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-11-03 12:10:02,600 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-11-03 12:10:02,600 INFO  L175             Difference]: Start difference. First operand has 73 places, 74 transitions, 210 flow. Second operand 3 states and 426 transitions.
[2023-11-03 12:10:02,600 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 316 flow
[2023-11-03 12:10:02,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 12:10:02,604 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 236 flow
[2023-11-03 12:10:02,604 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-11-03 12:10:02,604 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places.
[2023-11-03 12:10:02,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 236 flow
[2023-11-03 12:10:02,605 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-11-03 12:10:02,605 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:02,605 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:10:02,620 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:02,805 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-11-03 12:10:02,807 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-11-03 12:10:02,807 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:02,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -1425225994, now seen corresponding path program 1 times
[2023-11-03 12:10:02,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:02,809 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367023420]
[2023-11-03 12:10:02,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:02,809 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-11-03 12:10:02,810 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:02,811 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-11-03 12:10:02,814 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-11-03 12:10:02,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:02,868 INFO  L263         TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-11-03 12:10:02,872 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:02,911 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-11-03 12:10:02,932 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-11-03 12:10:02,970 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:02,970 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-11-03 12:10:03,016 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:03,017 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-11-03 12:10:03,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:03,058 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:03,059 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:03,059 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367023420]
[2023-11-03 12:10:03,059 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [367023420] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:03,059 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:03,059 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:10:03,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099066193]
[2023-11-03 12:10:03,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:03,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:10:03,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:03,061 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:10:03,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:10:03,441 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 116 out of 242
[2023-11-03 12:10:03,442 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-11-03 12:10:03,443 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:03,443 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 242
[2023-11-03 12:10:03,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:03,994 INFO  L130       PetriNetUnfolder]: 407/1192 cut-off events.
[2023-11-03 12:10:03,994 INFO  L131       PetriNetUnfolder]: For 254/258 co-relation queries the response was YES.
[2023-11-03 12:10:03,996 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-11-03 12:10:04,002 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 89 selfloop transitions, 29 changer transitions 0/146 dead transitions.
[2023-11-03 12:10:04,002 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 146 transitions, 641 flow
[2023-11-03 12:10:04,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:10:04,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:10:04,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions.
[2023-11-03 12:10:04,007 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5578512396694215
[2023-11-03 12:10:04,007 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 810 transitions.
[2023-11-03 12:10:04,007 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions.
[2023-11-03 12:10:04,008 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:04,008 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions.
[2023-11-03 12:10:04,009 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-11-03 12:10:04,011 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-11-03 12:10:04,012 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-11-03 12:10:04,012 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 236 flow. Second operand 6 states and 810 transitions.
[2023-11-03 12:10:04,012 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 146 transitions, 641 flow
[2023-11-03 12:10:04,015 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 633 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 12:10:04,017 INFO  L231             Difference]: Finished difference. Result has 83 places, 107 transitions, 450 flow
[2023-11-03 12:10:04,017 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-11-03 12:10:04,018 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places.
[2023-11-03 12:10:04,018 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 107 transitions, 450 flow
[2023-11-03 12:10:04,018 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-11-03 12:10:04,019 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:04,019 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:10:04,028 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-11-03 12:10:04,219 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-11-03 12:10:04,220 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-11-03 12:10:04,221 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:04,221 INFO  L85        PathProgramCache]: Analyzing trace with hash 452500327, now seen corresponding path program 1 times
[2023-11-03 12:10:04,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:04,222 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679168516]
[2023-11-03 12:10:04,222 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:04,222 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-11-03 12:10:04,223 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:04,224 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-11-03 12:10:04,226 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-11-03 12:10:04,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:04,283 INFO  L263         TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-11-03 12:10:04,285 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:04,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:04,293 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:04,293 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:04,293 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679168516]
[2023-11-03 12:10:04,294 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679168516] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:04,294 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:04,294 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 12:10:04,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619706846]
[2023-11-03 12:10:04,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:04,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 12:10:04,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:04,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 12:10:04,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 12:10:04,305 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 242
[2023-11-03 12:10:04,305 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-11-03 12:10:04,305 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:04,305 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 242
[2023-11-03 12:10:04,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:04,474 INFO  L130       PetriNetUnfolder]: 215/860 cut-off events.
[2023-11-03 12:10:04,475 INFO  L131       PetriNetUnfolder]: For 277/293 co-relation queries the response was YES.
[2023-11-03 12:10:04,477 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-11-03 12:10:04,481 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 44 selfloop transitions, 2 changer transitions 0/118 dead transitions.
[2023-11-03 12:10:04,481 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 118 transitions, 578 flow
[2023-11-03 12:10:04,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 12:10:04,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 12:10:04,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2023-11-03 12:10:04,484 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6074380165289256
[2023-11-03 12:10:04,484 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2023-11-03 12:10:04,484 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2023-11-03 12:10:04,484 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:04,484 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2023-11-03 12:10:04,485 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-11-03 12:10:04,486 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-11-03 12:10:04,487 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-11-03 12:10:04,487 INFO  L175             Difference]: Start difference. First operand has 83 places, 107 transitions, 450 flow. Second operand 3 states and 441 transitions.
[2023-11-03 12:10:04,487 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 118 transitions, 578 flow
[2023-11-03 12:10:04,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 118 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:10:04,493 INFO  L231             Difference]: Finished difference. Result has 84 places, 107 transitions, 460 flow
[2023-11-03 12:10:04,493 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-11-03 12:10:04,494 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 15 predicate places.
[2023-11-03 12:10:04,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 107 transitions, 460 flow
[2023-11-03 12:10:04,494 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-11-03 12:10:04,494 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:04,495 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:10:04,511 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:04,695 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-11-03 12:10:04,696 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-11-03 12:10:04,696 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:04,696 INFO  L85        PathProgramCache]: Analyzing trace with hash -1792765839, now seen corresponding path program 1 times
[2023-11-03 12:10:04,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:04,697 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003163263]
[2023-11-03 12:10:04,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:04,698 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-11-03 12:10:04,698 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:04,700 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-11-03 12:10:04,702 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-11-03 12:10:04,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:04,771 INFO  L263         TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-11-03 12:10:04,773 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:04,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:04,827 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:04,827 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:04,827 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003163263]
[2023-11-03 12:10:04,828 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003163263] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:04,828 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:04,828 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 12:10:04,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711403696]
[2023-11-03 12:10:04,828 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:04,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 12:10:04,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:04,829 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 12:10:04,829 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-03 12:10:04,920 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 135 out of 242
[2023-11-03 12:10:04,922 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-11-03 12:10:04,923 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:04,923 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 242
[2023-11-03 12:10:04,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:05,163 INFO  L130       PetriNetUnfolder]: 193/868 cut-off events.
[2023-11-03 12:10:05,163 INFO  L131       PetriNetUnfolder]: For 297/307 co-relation queries the response was YES.
[2023-11-03 12:10:05,165 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-11-03 12:10:05,169 INFO  L137   encePairwiseOnDemand]: 238/242 looper letters, 42 selfloop transitions, 2 changer transitions 4/123 dead transitions.
[2023-11-03 12:10:05,169 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 613 flow
[2023-11-03 12:10:05,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 12:10:05,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 12:10:05,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions.
[2023-11-03 12:10:05,172 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5981404958677686
[2023-11-03 12:10:05,172 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 579 transitions.
[2023-11-03 12:10:05,172 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions.
[2023-11-03 12:10:05,172 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:05,172 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions.
[2023-11-03 12:10:05,174 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-11-03 12:10:05,175 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-11-03 12:10:05,175 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-11-03 12:10:05,175 INFO  L175             Difference]: Start difference. First operand has 84 places, 107 transitions, 460 flow. Second operand 4 states and 579 transitions.
[2023-11-03 12:10:05,175 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 613 flow
[2023-11-03 12:10:05,178 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 123 transitions, 613 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 12:10:05,180 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 470 flow
[2023-11-03 12:10:05,180 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-11-03 12:10:05,180 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 20 predicate places.
[2023-11-03 12:10:05,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 470 flow
[2023-11-03 12:10:05,181 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-11-03 12:10:05,181 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:05,181 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-11-03 12:10:05,195 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:05,381 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-11-03 12:10:05,382 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-11-03 12:10:05,383 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:05,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -680468640, now seen corresponding path program 1 times
[2023-11-03 12:10:05,384 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:05,384 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636120933]
[2023-11-03 12:10:05,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:05,384 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-11-03 12:10:05,385 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:05,387 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-11-03 12:10:05,390 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-11-03 12:10:05,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:05,477 INFO  L263         TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-11-03 12:10:05,480 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:05,487 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-11-03 12:10:05,509 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-11-03 12:10:05,552 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:05,553 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-11-03 12:10:05,610 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:05,611 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-11-03 12:10:05,667 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:05,667 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:05,668 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:05,668 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636120933]
[2023-11-03 12:10:05,668 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [636120933] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:05,668 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:05,668 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:10:05,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214302751]
[2023-11-03 12:10:05,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:05,669 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:10:05,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:05,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:10:05,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:10:06,044 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2023-11-03 12:10:06,045 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-11-03 12:10:06,045 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:06,045 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2023-11-03 12:10:06,045 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:07,127 INFO  L130       PetriNetUnfolder]: 565/1517 cut-off events.
[2023-11-03 12:10:07,127 INFO  L131       PetriNetUnfolder]: For 805/820 co-relation queries the response was YES.
[2023-11-03 12:10:07,131 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-11-03 12:10:07,139 INFO  L137   encePairwiseOnDemand]: 219/242 looper letters, 127 selfloop transitions, 85 changer transitions 0/241 dead transitions.
[2023-11-03 12:10:07,139 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 241 transitions, 1458 flow
[2023-11-03 12:10:07,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:10:07,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:10:07,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions.
[2023-11-03 12:10:07,142 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5819559228650137
[2023-11-03 12:10:07,142 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 845 transitions.
[2023-11-03 12:10:07,142 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions.
[2023-11-03 12:10:07,142 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:07,142 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions.
[2023-11-03 12:10:07,144 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-11-03 12:10:07,145 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-11-03 12:10:07,146 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-11-03 12:10:07,146 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 470 flow. Second operand 6 states and 845 transitions.
[2023-11-03 12:10:07,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 241 transitions, 1458 flow
[2023-11-03 12:10:07,150 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 241 transitions, 1436 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-11-03 12:10:07,153 INFO  L231             Difference]: Finished difference. Result has 95 places, 188 transitions, 1212 flow
[2023-11-03 12:10:07,153 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-11-03 12:10:07,153 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-11-03 12:10:07,153 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 188 transitions, 1212 flow
[2023-11-03 12:10:07,154 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-11-03 12:10:07,154 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:07,154 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-11-03 12:10:07,168 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:07,354 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-11-03 12:10:07,355 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-11-03 12:10:07,356 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:07,356 INFO  L85        PathProgramCache]: Analyzing trace with hash -1641426374, now seen corresponding path program 1 times
[2023-11-03 12:10:07,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:07,357 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929506842]
[2023-11-03 12:10:07,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:07,358 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-11-03 12:10:07,358 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:07,359 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-11-03 12:10:07,361 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-11-03 12:10:07,465 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:07,468 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 10 conjunts are in the unsatisfiable core
[2023-11-03 12:10:07,470 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:07,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:07,717 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 12:10:07,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:07,944 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:07,945 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929506842]
[2023-11-03 12:10:07,945 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [929506842] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 12:10:07,945 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2023-11-03 12:10:07,945 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9
[2023-11-03 12:10:07,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505993307]
[2023-11-03 12:10:07,945 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2023-11-03 12:10:07,946 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-03 12:10:07,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:07,946 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-03 12:10:07,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2023-11-03 12:10:08,301 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 131 out of 242
[2023-11-03 12:10:08,303 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-11-03 12:10:08,304 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:08,304 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 242
[2023-11-03 12:10:08,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:08,676 INFO  L130       PetriNetUnfolder]: 271/947 cut-off events.
[2023-11-03 12:10:08,676 INFO  L131       PetriNetUnfolder]: For 907/937 co-relation queries the response was YES.
[2023-11-03 12:10:08,679 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-11-03 12:10:08,684 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 43 selfloop transitions, 6 changer transitions 12/184 dead transitions.
[2023-11-03 12:10:08,684 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 184 transitions, 1209 flow
[2023-11-03 12:10:08,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 12:10:08,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 12:10:08,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 959 transitions.
[2023-11-03 12:10:08,688 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5661157024793388
[2023-11-03 12:10:08,688 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 959 transitions.
[2023-11-03 12:10:08,689 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 959 transitions.
[2023-11-03 12:10:08,689 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:08,689 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 959 transitions.
[2023-11-03 12:10:08,692 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-11-03 12:10:08,694 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-11-03 12:10:08,694 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-11-03 12:10:08,694 INFO  L175             Difference]: Start difference. First operand has 95 places, 188 transitions, 1212 flow. Second operand 7 states and 959 transitions.
[2023-11-03 12:10:08,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 184 transitions, 1209 flow
[2023-11-03 12:10:08,701 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 184 transitions, 1149 flow, removed 27 selfloop flow, removed 2 redundant places.
[2023-11-03 12:10:08,703 INFO  L231             Difference]: Finished difference. Result has 100 places, 153 transitions, 935 flow
[2023-11-03 12:10:08,703 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-11-03 12:10:08,703 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 31 predicate places.
[2023-11-03 12:10:08,704 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 153 transitions, 935 flow
[2023-11-03 12:10:08,704 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-11-03 12:10:08,704 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:08,704 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-11-03 12:10:08,714 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:08,905 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-11-03 12:10:08,905 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-11-03 12:10:08,906 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:08,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 1826499191, now seen corresponding path program 1 times
[2023-11-03 12:10:08,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:08,906 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505907992]
[2023-11-03 12:10:08,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:08,907 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-11-03 12:10:08,907 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:08,908 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-11-03 12:10:08,910 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-11-03 12:10:08,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:09,002 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2023-11-03 12:10:09,006 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:09,235 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-11-03 12:10:09,265 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-11-03 12:10:09,317 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:09,318 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-11-03 12:10:09,388 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:09,388 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-11-03 12:10:09,477 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:10:09,479 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-11-03 12:10:09,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:10:09,552 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:09,552 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:09,552 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505907992]
[2023-11-03 12:10:09,553 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [505907992] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:09,553 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:09,553 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 12:10:09,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646685034]
[2023-11-03 12:10:09,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:09,554 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 12:10:09,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:09,555 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 12:10:09,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 12:10:11,747 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242
[2023-11-03 12:10:11,748 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-11-03 12:10:11,748 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:11,749 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242
[2023-11-03 12:10:11,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:12,528 INFO  L130       PetriNetUnfolder]: 384/1088 cut-off events.
[2023-11-03 12:10:12,528 INFO  L131       PetriNetUnfolder]: For 1083/1091 co-relation queries the response was YES.
[2023-11-03 12:10:12,533 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-11-03 12:10:12,539 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 114 selfloop transitions, 5 changer transitions 0/160 dead transitions.
[2023-11-03 12:10:12,539 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 160 transitions, 1217 flow
[2023-11-03 12:10:12,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 12:10:12,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 12:10:12,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 843 transitions.
[2023-11-03 12:10:12,542 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.49763872491145217
[2023-11-03 12:10:12,542 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 843 transitions.
[2023-11-03 12:10:12,542 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 843 transitions.
[2023-11-03 12:10:12,543 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:12,543 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 843 transitions.
[2023-11-03 12:10:12,544 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-11-03 12:10:12,547 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-11-03 12:10:12,547 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-11-03 12:10:12,547 INFO  L175             Difference]: Start difference. First operand has 100 places, 153 transitions, 935 flow. Second operand 7 states and 843 transitions.
[2023-11-03 12:10:12,547 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 160 transitions, 1217 flow
[2023-11-03 12:10:12,554 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 160 transitions, 1194 flow, removed 1 selfloop flow, removed 5 redundant places.
[2023-11-03 12:10:12,556 INFO  L231             Difference]: Finished difference. Result has 95 places, 155 transitions, 962 flow
[2023-11-03 12:10:12,556 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-11-03 12:10:12,556 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 26 predicate places.
[2023-11-03 12:10:12,556 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 155 transitions, 962 flow
[2023-11-03 12:10:12,557 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-11-03 12:10:12,557 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:12,557 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-11-03 12:10:12,573 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-11-03 12:10:12,757 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-11-03 12:10:12,758 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-11-03 12:10:12,759 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:12,759 INFO  L85        PathProgramCache]: Analyzing trace with hash 1814981271, now seen corresponding path program 1 times
[2023-11-03 12:10:12,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:12,760 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38524941]
[2023-11-03 12:10:12,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:12,761 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-11-03 12:10:12,761 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:12,762 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-11-03 12:10:12,765 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-11-03 12:10:12,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:12,867 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core
[2023-11-03 12:10:12,872 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:13,096 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-11-03 12:10:13,142 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-11-03 12:10:13,196 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:13,196 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-11-03 12:10:13,281 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:13,281 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-11-03 12:10:13,397 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 12:10:13,398 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-11-03 12:10:13,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:10:13,487 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:13,487 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:13,487 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38524941]
[2023-11-03 12:10:13,488 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [38524941] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:13,488 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:13,488 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-03 12:10:13,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431589239]
[2023-11-03 12:10:13,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:13,489 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-03 12:10:13,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:13,489 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-03 12:10:13,489 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2023-11-03 12:10:14,788 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242
[2023-11-03 12:10:14,789 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-11-03 12:10:14,789 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:14,789 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242
[2023-11-03 12:10:14,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:17,748 INFO  L130       PetriNetUnfolder]: 403/1095 cut-off events.
[2023-11-03 12:10:17,749 INFO  L131       PetriNetUnfolder]: For 1014/1023 co-relation queries the response was YES.
[2023-11-03 12:10:17,753 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-11-03 12:10:17,760 INFO  L137   encePairwiseOnDemand]: 230/242 looper letters, 177 selfloop transitions, 48 changer transitions 0/249 dead transitions.
[2023-11-03 12:10:17,760 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 249 transitions, 1973 flow
[2023-11-03 12:10:17,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 12:10:17,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 12:10:17,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions.
[2023-11-03 12:10:17,763 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5330578512396694
[2023-11-03 12:10:17,763 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 903 transitions.
[2023-11-03 12:10:17,763 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions.
[2023-11-03 12:10:17,763 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:17,763 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions.
[2023-11-03 12:10:17,765 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-11-03 12:10:17,766 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-11-03 12:10:17,767 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-11-03 12:10:17,767 INFO  L175             Difference]: Start difference. First operand has 95 places, 155 transitions, 962 flow. Second operand 7 states and 903 transitions.
[2023-11-03 12:10:17,767 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 249 transitions, 1973 flow
[2023-11-03 12:10:17,774 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 249 transitions, 1964 flow, removed 4 selfloop flow, removed 1 redundant places.
[2023-11-03 12:10:17,776 INFO  L231             Difference]: Finished difference. Result has 105 places, 167 transitions, 1233 flow
[2023-11-03 12:10:17,776 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-11-03 12:10:17,777 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 36 predicate places.
[2023-11-03 12:10:17,777 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 167 transitions, 1233 flow
[2023-11-03 12:10:17,777 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-11-03 12:10:17,778 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:17,778 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-11-03 12:10:17,795 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-11-03 12:10:17,978 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-11-03 12:10:17,979 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-11-03 12:10:17,979 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:17,979 INFO  L85        PathProgramCache]: Analyzing trace with hash -86355948, now seen corresponding path program 1 times
[2023-11-03 12:10:17,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:17,980 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852298875]
[2023-11-03 12:10:17,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:17,981 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-11-03 12:10:17,981 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:17,982 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-11-03 12:10:17,985 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-11-03 12:10:18,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:18,059 INFO  L263         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core
[2023-11-03 12:10:18,061 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:18,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 12:10:18,072 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:18,072 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:18,073 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852298875]
[2023-11-03 12:10:18,073 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [852298875] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:18,073 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:18,073 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 12:10:18,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774221009]
[2023-11-03 12:10:18,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:18,074 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 12:10:18,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:18,074 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 12:10:18,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 12:10:18,101 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 242
[2023-11-03 12:10:18,102 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-11-03 12:10:18,102 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:18,102 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 242
[2023-11-03 12:10:18,102 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:18,321 INFO  L130       PetriNetUnfolder]: 280/891 cut-off events.
[2023-11-03 12:10:18,322 INFO  L131       PetriNetUnfolder]: For 1922/1959 co-relation queries the response was YES.
[2023-11-03 12:10:18,323 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-11-03 12:10:18,326 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 39 selfloop transitions, 10 changer transitions 0/179 dead transitions.
[2023-11-03 12:10:18,326 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 179 transitions, 1381 flow
[2023-11-03 12:10:18,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 12:10:18,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 12:10:18,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions.
[2023-11-03 12:10:18,328 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5895316804407713
[2023-11-03 12:10:18,328 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 428 transitions.
[2023-11-03 12:10:18,328 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions.
[2023-11-03 12:10:18,328 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:18,328 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions.
[2023-11-03 12:10:18,329 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-11-03 12:10:18,331 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-11-03 12:10:18,331 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-11-03 12:10:18,331 INFO  L175             Difference]: Start difference. First operand has 105 places, 167 transitions, 1233 flow. Second operand 3 states and 428 transitions.
[2023-11-03 12:10:18,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 179 transitions, 1381 flow
[2023-11-03 12:10:18,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 179 transitions, 1368 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-11-03 12:10:18,343 INFO  L231             Difference]: Finished difference. Result has 107 places, 173 transitions, 1292 flow
[2023-11-03 12:10:18,343 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-11-03 12:10:18,343 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 38 predicate places.
[2023-11-03 12:10:18,343 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 173 transitions, 1292 flow
[2023-11-03 12:10:18,344 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-11-03 12:10:18,344 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:18,344 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-11-03 12:10:18,364 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:18,544 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-11-03 12:10:18,545 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-11-03 12:10:18,545 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:18,546 INFO  L85        PathProgramCache]: Analyzing trace with hash -1426846396, now seen corresponding path program 1 times
[2023-11-03 12:10:18,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:18,547 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944304296]
[2023-11-03 12:10:18,547 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:18,547 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-11-03 12:10:18,548 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:18,549 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-11-03 12:10:18,551 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-11-03 12:10:18,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 12:10:18,630 INFO  L263         TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjunts are in the unsatisfiable core
[2023-11-03 12:10:18,634 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 12:10:18,641 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-11-03 12:10:18,659 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-11-03 12:10:18,690 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:18,691 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-11-03 12:10:18,740 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 12:10:18,740 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-11-03 12:10:18,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 12:10:18,801 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 12:10:18,801 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-03 12:10:18,802 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944304296]
[2023-11-03 12:10:18,802 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944304296] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 12:10:18,802 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 12:10:18,802 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 12:10:18,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815969464]
[2023-11-03 12:10:18,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 12:10:18,803 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 12:10:18,803 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-03 12:10:18,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 12:10:18,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 12:10:19,474 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 242
[2023-11-03 12:10:19,475 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-11-03 12:10:19,475 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 12:10:19,476 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 242
[2023-11-03 12:10:19,476 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 12:10:20,298 INFO  L130       PetriNetUnfolder]: 411/1111 cut-off events.
[2023-11-03 12:10:20,298 INFO  L131       PetriNetUnfolder]: For 2953/3001 co-relation queries the response was YES.
[2023-11-03 12:10:20,304 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-11-03 12:10:20,308 INFO  L137   encePairwiseOnDemand]: 231/242 looper letters, 85 selfloop transitions, 41 changer transitions 36/239 dead transitions.
[2023-11-03 12:10:20,308 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 239 transitions, 2072 flow
[2023-11-03 12:10:20,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 12:10:20,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 12:10:20,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 832 transitions.
[2023-11-03 12:10:20,312 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5730027548209367
[2023-11-03 12:10:20,312 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 832 transitions.
[2023-11-03 12:10:20,312 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 832 transitions.
[2023-11-03 12:10:20,313 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 12:10:20,313 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 832 transitions.
[2023-11-03 12:10:20,315 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-11-03 12:10:20,318 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-11-03 12:10:20,319 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-11-03 12:10:20,319 INFO  L175             Difference]: Start difference. First operand has 107 places, 173 transitions, 1292 flow. Second operand 6 states and 832 transitions.
[2023-11-03 12:10:20,319 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 239 transitions, 2072 flow
[2023-11-03 12:10:20,334 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 2056 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-03 12:10:20,337 INFO  L231             Difference]: Finished difference. Result has 116 places, 195 transitions, 1624 flow
[2023-11-03 12:10:20,337 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-11-03 12:10:20,338 INFO  L288   CegarLoopForPetriNet]: 69 programPoint places, 47 predicate places.
[2023-11-03 12:10:20,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 195 transitions, 1624 flow
[2023-11-03 12:10:20,338 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-11-03 12:10:20,338 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 12:10:20,338 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-11-03 12:10:20,348 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:20,539 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-11-03 12:10:20,540 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-11-03 12:10:20,541 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 12:10:20,541 INFO  L85        PathProgramCache]: Analyzing trace with hash -1114213243, now seen corresponding path program 1 times
[2023-11-03 12:10:20,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-03 12:10:20,542 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332353391]
[2023-11-03 12:10:20,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 12:10:20,542 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-11-03 12:10:20,543 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/mathsat
[2023-11-03 12:10:20,545 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-11-03 12:10:20,547 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-11-03 12:10:20,650 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:10:20,651 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 12:10:20,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 12:10:20,728 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-11-03 12:10:20,728 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 12:10:20,729 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 18 remaining)
[2023-11-03 12:10:20,731 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2023-11-03 12:10:20,732 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2023-11-03 12:10:20,732 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2023-11-03 12:10:20,732 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2023-11-03 12:10:20,732 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2023-11-03 12:10:20,732 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2023-11-03 12:10:20,732 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2023-11-03 12:10:20,732 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2023-11-03 12:10:20,733 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining)
[2023-11-03 12:10:20,733 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2023-11-03 12:10:20,733 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2023-11-03 12:10:20,733 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2023-11-03 12:10:20,733 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2023-11-03 12:10:20,733 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2023-11-03 12:10:20,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2023-11-03 12:10:20,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2023-11-03 12:10:20,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2023-11-03 12:10:20,761 INFO  L552       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)] Ended with exit code 0
[2023-11-03 12:10:20,934 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-11-03 12:10:20,935 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 12:10:20,944 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-03 12:10:20,944 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-03 12:10:20,983 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 12:10:20 BasicIcfg
[2023-11-03 12:10:20,983 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-03 12:10:20,984 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-03 12:10:20,984 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-11-03 12:10:20,984 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-11-03 12:10:20,985 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:09:57" (3/4) ...
[2023-11-03 12:10:20,989 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-11-03 12:10:20,989 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-03 12:10:20,990 INFO  L158              Benchmark]: Toolchain (without parser) took 25107.33ms. Allocated memory was 111.1MB in the beginning and 249.6MB in the end (delta: 138.4MB). Free memory was 86.6MB in the beginning and 160.7MB in the end (delta: -74.0MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB.
[2023-11-03 12:10:20,991 INFO  L158              Benchmark]: CDTParser took 0.25ms. Allocated memory is still 111.1MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-03 12:10:20,991 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 436.52ms. Allocated memory is still 111.1MB. Free memory was 86.3MB in the beginning and 56.0MB in the end (delta: 30.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
[2023-11-03 12:10:20,992 INFO  L158              Benchmark]: Boogie Procedure Inliner took 42.81ms. Allocated memory is still 111.1MB. Free memory was 56.0MB in the beginning and 53.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-03 12:10:20,992 INFO  L158              Benchmark]: Boogie Preprocessor took 41.44ms. Allocated memory is still 111.1MB. Free memory was 53.4MB in the beginning and 88.1MB in the end (delta: -34.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB.
[2023-11-03 12:10:20,992 INFO  L158              Benchmark]: RCFGBuilder took 600.42ms. Allocated memory is still 111.1MB. Free memory was 87.9MB in the beginning and 66.4MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
[2023-11-03 12:10:20,993 INFO  L158              Benchmark]: TraceAbstraction took 23974.78ms. Allocated memory was 111.1MB in the beginning and 249.6MB in the end (delta: 138.4MB). Free memory was 65.8MB in the beginning and 160.7MB in the end (delta: -94.9MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB.
[2023-11-03 12:10:20,993 INFO  L158              Benchmark]: Witness Printer took 5.43ms. Allocated memory is still 249.6MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-03 12:10:20,995 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.25ms. Allocated memory is still 111.1MB. Free memory is still 89.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 436.52ms. Allocated memory is still 111.1MB. Free memory was 86.3MB in the beginning and 56.0MB in the end (delta: 30.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 42.81ms. Allocated memory is still 111.1MB. Free memory was 56.0MB in the beginning and 53.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 41.44ms. Allocated memory is still 111.1MB. Free memory was 53.4MB in the beginning and 88.1MB in the end (delta: -34.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB.
 * RCFGBuilder took 600.42ms. Allocated memory is still 111.1MB. Free memory was 87.9MB in the beginning and 66.4MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 23974.78ms. Allocated memory was 111.1MB in the beginning and 249.6MB in the end (delta: 138.4MB). Free memory was 65.8MB in the beginning and 160.7MB in the end (delta: -94.9MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB.
 * Witness Printer took 5.43ms. Allocated memory is still 249.6MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 3.8s, 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, (void*)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, (void*)j)=0, threads_mask=-2, threads_total=3, tids={7:0}]
[L1054]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, (void*)j)
         VAL             [\read(*tids)={5:0}, arg={0:0}, datas={1:0}, i=0, j=0, pthread_create(&tids[i], ((void *)0), &thread, (void*)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 = (int)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: 23.8s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1300 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 944 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 10.3s 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, 0.8s 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s 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-11-03 12:10:21,038 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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
